<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: clauderoux</title><link>https://news.ycombinator.com/user?id=clauderoux</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 23 Jul 2026 05:08:01 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=clauderoux" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by clauderoux in "AI is slowing down"]]></title><description><![CDATA[
<p>I have been a pretty consistent user of AI since 2022 (Instruct-GPT), so I don't have a bad opinion about the topic. However, I think the real problem now has become pretty obvious. We are hitting a reality wall, where we simply don't have enough ressources to feed the AI industry. We don't generate enough electrical power nor enough GPU or TPU. For the first time in computer science, the real issue here is the finitude of the physical world. Unless, we start digging asteroids, we are already facing a shortage of raw material and industrial output. In my opinion, the only way to go is small models running on regular hardwares.</p>
]]></description><pubDate>Tue, 09 Jun 2026 07:18:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=48457697</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=48457697</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48457697</guid></item><item><title><![CDATA[New comment by clauderoux in "Try LispE in the Browser"]]></title><description><![CDATA[
<p>LispE has been fully ported to WebAssembly, you can see it in action with some examples.</p>
]]></description><pubDate>Wed, 13 May 2026 08:43:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=48119341</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=48119341</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48119341</guid></item><item><title><![CDATA[Try LispE in the Browser]]></title><description><![CDATA[
<p>Article URL: <a href="https://naver.github.io/lispe/">https://naver.github.io/lispe/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48119340">https://news.ycombinator.com/item?id=48119340</a></p>
<p>Points: 31</p>
<p># Comments: 1</p>
]]></description><pubDate>Wed, 13 May 2026 08:43:11 +0000</pubDate><link>https://naver.github.io/lispe/</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=48119340</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48119340</guid></item><item><title><![CDATA[New comment by clauderoux in "Extending JavaScript at once with a WASM language"]]></title><description><![CDATA[
<p>LispE is a programming language that has been ported to WASM. It's lightweight (about 3.3MB) and provides many features natively, with no external dependencies. You can now try it directly in your browser.</p>
]]></description><pubDate>Wed, 06 May 2026 12:39:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=48035521</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=48035521</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48035521</guid></item><item><title><![CDATA[Extending JavaScript at once with a WASM language]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/naver/lispe/wiki/1.4-Extending-JS-at-once-with-a-WASM-language">https://github.com/naver/lispe/wiki/1.4-Extending-JS-at-once-with-a-WASM-language</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48035520">https://news.ycombinator.com/item?id=48035520</a></p>
<p>Points: 7</p>
<p># Comments: 1</p>
]]></description><pubDate>Wed, 06 May 2026 12:39:07 +0000</pubDate><link>https://github.com/naver/lispe/wiki/1.4-Extending-JS-at-once-with-a-WASM-language</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=48035520</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48035520</guid></item><item><title><![CDATA[MLX Library for Lisp on Mac OS]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.reddit.com/r/mlxAI/s/fToUXzfaYU">https://www.reddit.com/r/mlxAI/s/fToUXzfaYU</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46867803">https://news.ycombinator.com/item?id=46867803</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 03 Feb 2026 07:42:22 +0000</pubDate><link>https://www.reddit.com/r/mlxAI/s/fToUXzfaYU</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=46867803</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46867803</guid></item><item><title><![CDATA[New comment by clauderoux in "Things that helped me get out of the AI 10x engineer imposter syndrome"]]></title><description><![CDATA[
<p>This article nails it. The claim 10x is in my opinion one of these tactics used by large corporations to force engineers into submission. The idea that you could be replaced with an AI is frightening enough to keep people in check, when negotiating your salary.  AI is a wonderful tool that I use everyday, and I have been able to implement stuff that I would have considered too cumbersome to even start working on. But, it doesn't make you a 10x more efficient engineer. It gives you an edge when you start a new project, which is already a lot. But don't expect your whole project of 100,000 lines to be handled by the machine. It won't happen any time soon.</p>
]]></description><pubDate>Wed, 06 Aug 2025 07:10:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=44808682</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44808682</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44808682</guid></item><item><title><![CDATA[New comment by clauderoux in "Numai is an open source JavaScript spreadsheet powered by AI"]]></title><description><![CDATA[
<p>Formulas can be written in English and translated by an AI in JS formulas.</p>
]]></description><pubDate>Tue, 05 Aug 2025 07:42:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=44795341</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44795341</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44795341</guid></item><item><title><![CDATA[Numai is an open source JavaScript spreadsheet powered by AI]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/clauderouxster/NUMAI">https://github.com/clauderouxster/NUMAI</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44795340">https://news.ycombinator.com/item?id=44795340</a></p>
<p>Points: 3</p>
<p># Comments: 1</p>
]]></description><pubDate>Tue, 05 Aug 2025 07:42:30 +0000</pubDate><link>https://github.com/clauderouxster/NUMAI</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44795340</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44795340</guid></item><item><title><![CDATA[New comment by clauderoux in "I know when you're vibe coding"]]></title><description><![CDATA[
<p>I love how so many people are eager to criticize LLM code, when in fact, according to my experience it is pretty superior to anything I have seen produced by human programmers, most of the time. It is documented, the code is explained at each step of its creation, and it is pretty readable when you dig into it. I have 30 years of experience in coding, and I have been playing with these LLM for 3 years. Yeah!!! Of course, sometimes they produce very bad code. But in average, the code they produce is largely on par with my fellow humans. And since, they produce the whole explanation of it, it takes a couple of minutes to understand it. And if you don't understand the main points of the code, the LLM will tell you all about it. When did you have a colleague that was eager to explain his/her code to you??? When did you have a colleague that did produce a code you could understand in a few minute??? I really think these tools are quite useful, no need to wrap yourself into the mantel of expertise and look down on these LLM, because sometimes they will produce a code you don't like.</p>
]]></description><pubDate>Thu, 31 Jul 2025 08:48:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=44743685</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44743685</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44743685</guid></item><item><title><![CDATA[New comment by clauderoux in "Every American Is Bilingual"]]></title><description><![CDATA[
<p>The answer is very easy. Latinate words (mostly of French origin for the matter), first because of the number of people speaking romance languages (French, Italian, Spanish, Romanian and Portuguese) is the largest in Europe, second, because most European languages have also borrowed a lot from Latin, Greek and French during the last centuries, which means that latinate words are usually the subset which is shared across most languages. Furthermore, English and other Germanic languages have started evolving quite early one from the others (around the 6 century) and cognates might be quite difficult to recognize: through/durch, for instance.</p>
]]></description><pubDate>Tue, 29 Jul 2025 07:44:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=44720301</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44720301</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44720301</guid></item><item><title><![CDATA[New comment by clauderoux in "Google in 1999: Search engines escape the portal matrix"]]></title><description><![CDATA[
<p>Funny as they always seem to forget the hardware side of search engines. Google was incredibly fast compared to its competitors because they were among the first to store their whole index in RAM rather than on hard drives. They were among the first to install huge data center with computer blades that could be changed in an instant in case of failure. As an early user, I was on board as early as 99, I was amazed by the response speed of Google and its bare style quite dépouillé.</p>
]]></description><pubDate>Sat, 26 Jul 2025 08:18:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=44692371</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44692371</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44692371</guid></item><item><title><![CDATA[New comment by clauderoux in "The Collapse of the FDA"]]></title><description><![CDATA[
<p>Well. There is measles epidemic right now...</p>
]]></description><pubDate>Tue, 15 Jul 2025 10:05:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=44569626</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44569626</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44569626</guid></item><item><title><![CDATA[New comment by clauderoux in "We’re years away from anyone creating artificial intelligence, says Martha Wells"]]></title><description><![CDATA[
<p>Some people still think that LLM are just word predictors. Technically, it is not. First, transformer architectures don't process words, they process semantic representations stored as vectors or embeddings in a continuous space.
What a lot of people don't understand is that in an LLM, we go from discrete values (the tokens) to continuous values (embeddings) that the transformer takes as input. A transformer is a polynomial function that will project into the latent embedding space. It doesn't generate word per se, but a vector that is then compared against the latent embedding space to find the closest matches. The decoding part is usually not deterministic.
This huge polynomial function is the reason we can't understand what is going on in a transformer. It doesn't mimick human speech, it builds a huge representation of the world, which it uses to respond to a query. This is not a conceptual graph, it is not a mere semantic representation. It is a distillation of all the data it ingested. And each model is unique as the process itself is split over hundreds of gpu, with no control over which GPU is going to churn out which part of the dataset and in which order.</p>
]]></description><pubDate>Sat, 12 Jul 2025 09:56:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=44540758</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44540758</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44540758</guid></item><item><title><![CDATA[New comment by clauderoux in "A Canadian's AI hoax duped the media and propelled a 'band' to success"]]></title><description><![CDATA[
<p>For those who don't know, "frelon" is French for hornet.</p>
]]></description><pubDate>Sun, 06 Jul 2025 08:04:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=44478743</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44478743</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44478743</guid></item><item><title><![CDATA[New comment by clauderoux in "It's Known as 'The List'–and It's a Secret File of AI Geniuses"]]></title><description><![CDATA[
<p>Gradient descent is to AI, what a loop is to understand programming. However, understanding a loop doesn't mean you can program a full video game from scratch. Organizing hundreds of layers in an efficient way is pretty complex, even if the work today has been simplified thanks to PyTorch or Tensorflow, it remains pretty complicated. You have to understand how to organize your data, how to size your batches, how to make your code resilient enough to survive GPU cards crashing. Train a model over hundreds of GPU is really really complicated. New algorithms are proposed all the time, because we have no idea how to handle these interconnected layers in an efficient way, but with cumbersome heuristics. However, salary inflation is never a good thing, because it will create a gap between decent engineers and other people pronounced geniuses. The AI teams will suffer from these decisions... Badly. It will be like these samouraïs who would kill peasants after a battle to increase their head count, because this was how people were rewarded after a battle. Some of these people, in order to justify their salaries, will feel pressure to poach other people's ideas...</p>
]]></description><pubDate>Sun, 29 Jun 2025 08:20:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=44411256</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44411256</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44411256</guid></item><item><title><![CDATA[New comment by clauderoux in "New IQ research shows why smarter people make better decisions"]]></title><description><![CDATA[
<p>The problem of measuring intelligence is that most of these techniques reveal more about what we think intelligence is in a specific cultural context. Which means that individuals who rank higher in these tests are those who conform the most to a society expectancies. High level of literacy, proper nutrition during their childhood, proper education, help foster better IQ. Which of course leads to a better understanding of how your own society works, hence to a better evaluation of probabilities. If you have grown up in a family with money, you have a much better understanding of how to benefit from your investments.</p>
]]></description><pubDate>Sat, 28 Jun 2025 07:58:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=44402986</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44402986</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44402986</guid></item><item><title><![CDATA[New comment by clauderoux in "SIMD-friendly algorithms for substring searching (2016)"]]></title><description><![CDATA[
<p>What I do is to build a substring out of the initial strings that is a multiple of 2. If the string I try to search is 9 characters long, then I extract an 8 characters substrings that I transform into an integer over an integer:<p>Here is the example for 4 characters:
                //We look for the presence of four characters in a row
```
            int32_t cc = search[3];
            for (shift = 2; shift >= 0; shift--) {
                cc <<= 8;
                cc |= search[shift];
            }
__m256i firstchar = _mm256_set1_epi16(cc);
```<p>In this case, I will look for a 4 bytes integers over my sequence:
```
current_bytes = _mm256_cmpeq_epi16(firstchar, current_bytes);
q <<= 1;
q |= _mm256_movemask_epi8(current_bytes);
````
I'm looking for blocks of 4 characters at a time in my string.</p>
]]></description><pubDate>Sun, 15 Jun 2025 07:43:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=44281128</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44281128</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44281128</guid></item><item><title><![CDATA[New comment by clauderoux in "SIMD-friendly algorithms for substring searching (2016)"]]></title><description><![CDATA[
<p>I implemented many different algorithms for searching and splitting strings using SMID methods as well:
<a href="https://github.com/naver/tamgu/blob/06aedf2f14895925d7b5a8e25e109faa7623010d/src/conversion.cxx#L126">https://github.com/naver/tamgu/blob/06aedf2f14895925d7b5a8e2...</a>
I used a different algorithm than the ones presented here.</p>
]]></description><pubDate>Sat, 14 Jun 2025 07:46:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=44274902</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44274902</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44274902</guid></item><item><title><![CDATA[New comment by clauderoux in "Pentagon Has Been Pushing Americans to Believe in UFOs for Decades, New Report"]]></title><description><![CDATA[
<p>Or a variation of Princess Bride mind challenge...</p>
]]></description><pubDate>Fri, 13 Jun 2025 07:25:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=44266460</link><dc:creator>clauderoux</dc:creator><comments>https://news.ycombinator.com/item?id=44266460</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44266460</guid></item></channel></rss>