<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: DevelopingElk</title><link>https://news.ycombinator.com/user?id=DevelopingElk</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 08 Oct 2026 00:53:18 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=DevelopingElk" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by DevelopingElk in "AI-assisted proof of optimal packing for 11 squares"]]></title><description><![CDATA[
<p>A simpler way to see this is to first focus on the central region of the big square that's 0.5 units away from the edge. All squares centers must lie in this region. Break this region into a grid of 25 equally sized square tiles. Each tile is now small enough that the center of two squares can't lie within the same tile. This gives 25 choose 11 possibilities. The article instead broke this region into hexagons that were still small enough that the centers of two squares can't lie in the same hexagon. This let them use only 16 tiles, which vastly reduced the space of possibilities.</p>
]]></description><pubDate>Wed, 07 Oct 2026 19:36:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=49997761</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=49997761</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49997761</guid></item><item><title><![CDATA[New comment by DevelopingElk in "AI-assisted proof of optimal packing for 11 squares"]]></title><description><![CDATA[
<p>I'm working on a reproduction of the proof with some personal changes. The basic approach is the standard computer assisted "unavoidable set" approach. First, choose some regions small enough that two square's centers don't fit in the same region, the article used 16. Each region must contain or not contain a square, which is  16 choose 11 cases, about 2000. For each case you try and rule it out. You do this by identifying areas that must be covered by a square, and propagating this information. You can also use packing LPs like Stromquist did in 1989 to rule out more configurations. You then narrow in on the remaining cases and subdivide them more.<p>I think the only reason this wasn't done pre-AI was due to it not being a topic of serious focus. 1989's computers were too weak to handle all the cases. But all the basic ingredients were present in the Kepler conjecture proof. What AI did was lower the effort enough that amateurs who just liked square packings could perform and formally verify such a proof. I consider myself among such amateurs. So this isn't a case of AI stealing mathematicians proofs, or doing something superhuman, its a case of democratization. I am concerned about how AI is affecting math and how the AI companies are behaving, but this isn't the case to be worried about. The calculations for proving this arrangement optimal will always be too big to be checked by hand. However, I'm hoping to produce some nice visualizations of the packing LP or core overlap that rejects each configuration</p>
]]></description><pubDate>Wed, 07 Oct 2026 19:02:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=49997321</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=49997321</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49997321</guid></item><item><title><![CDATA[New comment by DevelopingElk in "Transformers Explained Visually"]]></title><description><![CDATA[
<p>They do work, but transformers work better on the accuracy/compute tradeoff curve. Transformers let far away positions in the sequence exchange info in 1 step, while a dilated CNN will need many layers. Additionally, Transformers can be fairly efficiently trained.<p>I do think if Transformers weren't invented you would still be able to train powerful language models, but they would take more ram and be slower so nobody does this.</p>
]]></description><pubDate>Tue, 22 Sep 2026 05:32:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=49797138</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=49797138</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49797138</guid></item><item><title><![CDATA[New comment by DevelopingElk in "Passing DBs through continuations"]]></title><description><![CDATA[
<p>CPS is a way of embedding imperative computation into an FP language. I think they built a mini compiler for their binary relation language, which is then Jitted by Julia.</p>
]]></description><pubDate>Tue, 09 Jun 2026 05:28:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=48456863</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=48456863</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48456863</guid></item><item><title><![CDATA[New comment by DevelopingElk in "The Futility of Lava Lamps: What Random Means"]]></title><description><![CDATA[
<p>Russian one time pads were frequently broken. How? They were inconvenient to distribute, so people reused them.<p>Symmetric cryptography is safer because one key can easily protect as much data as you need.</p>
]]></description><pubDate>Tue, 19 May 2026 00:51:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=48187909</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=48187909</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48187909</guid></item><item><title><![CDATA[New comment by DevelopingElk in "AWS North Virginia data center outage – recovery to take hours"]]></title><description><![CDATA[
<p>One of the data center's cooling loops broke.</p>
]]></description><pubDate>Fri, 08 May 2026 22:07:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=48069373</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=48069373</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48069373</guid></item><item><title><![CDATA[New comment by DevelopingElk in "Easy Random Trees"]]></title><description><![CDATA[
<p>I ran into this problem where I wanted to generate balanced trees for test cases, and I decided to crack it with math.<p>Let X = the number of remaining open parenthesis required to reach your target length, and Y = the number of remaining close parenthesis.<p>Let P(X) = X/(X+Y) * (1 + 1/(Y-X+1)). Generate an open parenthesis with probability P(X), and otherwise a close parenthesis.<p>This will efficiently generate an unbiased random plane tree. The reason this works has to do with counting the valid ways to complete the plane tree, using a calculation similar to the one in the article.</p>
]]></description><pubDate>Fri, 08 May 2026 00:51:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=48057102</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=48057102</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48057102</guid></item><item><title><![CDATA[New comment by DevelopingElk in "Not all elementary functions can be expressed with exp-minus-log"]]></title><description><![CDATA[
<p>His claim is that we exp-minus-log cannot compute the root of an arbitrary quintic. If you consider the root of an arbitrary quintic "elementary" the exp-minus-log  can't represent all elementary functions.<p>I think it really comes down to what set of functions you are calling "elementary".</p>
]]></description><pubDate>Wed, 15 Apr 2026 05:05:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=47774882</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=47774882</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47774882</guid></item><item><title><![CDATA[New comment by DevelopingElk in "New synthesis of astronomical measurements shows Hubble tension is real"]]></title><description><![CDATA[
<p>According to the article “This work effectively rules out explanations of the Hubble tension that rely on a single overlooked error in local distance measurements". So any systemic errors would need to affect multiple measurement types.</p>
]]></description><pubDate>Sun, 12 Apr 2026 05:23:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=47736371</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=47736371</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47736371</guid></item><item><title><![CDATA[New comment by DevelopingElk in "Baby's Second Garbage Collector"]]></title><description><![CDATA[
<p>Good? Bad? Doesn't matter as long as you had fun.<p>Have you tested this GCs performance? Sometimes a baby GC can be fast enough.</p>
]]></description><pubDate>Sun, 05 Apr 2026 20:14:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=47653431</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=47653431</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47653431</guid></item><item><title><![CDATA[New comment by DevelopingElk in "Ohm's Peg-to-WASM Compiler"]]></title><description><![CDATA[
<p>The issue with Regex for parsing is it can't handle balanced parentheses. <a href="https://en.wikipedia.org/wiki/Regular_expression" rel="nofollow">https://en.wikipedia.org/wiki/Regular_expression</a>. More generally, they can't handle nested structure. Context free grammars are the most natural extension that can. It adds a substitution operator to Regex that makes it powerful enough to recognize nested structure. So, Regex would be reinvented if history was rerun, but so would Context Free Grammars. Part of the complexity in parsing is attaching semantic meaning to the parse. Regex mostly avoids this by not caring how a string matches, just if it matches or not.<p>Now, I do agree that LR grammars are messy. Nowadays, they have mostly fallen from favor. Instead, people use simpler parsers that work for the restricted grammars actual programming languages have.<p>IIRC there is some research into formalizing the type of unambiguous grammar that always uses () or [] as nesting elements, but can use Regex for lexing.</p>
]]></description><pubDate>Mon, 30 Mar 2026 00:28:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=47568991</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=47568991</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47568991</guid></item><item><title><![CDATA[New comment by DevelopingElk in "Windows: Microsoft broke the only thing that mattered"]]></title><description><![CDATA[
<p>I'm fairly sure this was human written.</p>
]]></description><pubDate>Tue, 10 Mar 2026 05:57:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=47319513</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=47319513</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47319513</guid></item><item><title><![CDATA[New comment by DevelopingElk in "My “grand vision” for Rust"]]></title><description><![CDATA[
<p>Rust's discussion boards has an idea of "keyword generics" for expressing some of these concepts. The idea is that a function can be generic over const, async or some other keyworded effect. I like this description. It shows the benefits without too much theory.</p>
]]></description><pubDate>Mon, 09 Mar 2026 05:05:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=47305075</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=47305075</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47305075</guid></item><item><title><![CDATA[New comment by DevelopingElk in "Pushing and Pulling: Three reactivity algorithms"]]></title><description><![CDATA[
<p>Yours might go a little less into the details, but its really clear and I like the diagrams and explanation around glitch hazards. Please do follow up on your tangents if you have time.</p>
]]></description><pubDate>Sun, 08 Mar 2026 22:40:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=47302383</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=47302383</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47302383</guid></item><item><title><![CDATA[New comment by DevelopingElk in "Ask HN: Please restrict new accounts from posting"]]></title><description><![CDATA[
<p>I have commented once or twice on articles being AI generated. I don't put them when I think the writer used AI to clean up some text. I added them when there are paragraphs of meaningless or incorrect content.<p>Formats, name collisions or back-button breakage are tangential to the content of the article. Being AI generated isn't. And it does add to the overall HN conversation by making it easier to focus on meaningful content and not AI generated text.<p>Basically, if the writer didn't do a good job checking and understanding the content we shouldn't bother to either.</p>
]]></description><pubDate>Sun, 08 Mar 2026 21:22:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=47301619</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=47301619</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47301619</guid></item><item><title><![CDATA[New comment by DevelopingElk in "The Life Cycle of Money"]]></title><description><![CDATA[
<p>This is written by an LLM account. My guess is this article was created with some human guidance too, but the profile shows LLM patterns.</p>
]]></description><pubDate>Sat, 28 Feb 2026 16:06:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=47196935</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=47196935</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47196935</guid></item><item><title><![CDATA[New comment by DevelopingElk in "Testing Super Mario Using a Behavior Model Autonomously"]]></title><description><![CDATA[
<p>The start of the article is good, but it starts to sound like LLM staring at the "Why this maps to Genetic Algorithms?" section. Is that the case?</p>
]]></description><pubDate>Fri, 20 Feb 2026 21:50:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=47094486</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=47094486</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47094486</guid></item><item><title><![CDATA[New comment by DevelopingElk in "What Every Experimenter Must Know About Randomization"]]></title><description><![CDATA[
<p>By the definition of a cryptographically secure PRNG, no. They, with overwhelming probability, produce results indistinguishable from truly random numbers no matter what procedure you use to tell them apart.</p>
]]></description><pubDate>Thu, 19 Feb 2026 01:41:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=47068864</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=47068864</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47068864</guid></item><item><title><![CDATA[New comment by DevelopingElk in "AWS European Sovereign Cloud"]]></title><description><![CDATA[
<p>I worked on a team deploying a service to European Sovereign Cloud (ESC). Disclaimer - I am a low level SDE and all opinions are my own.<p>AWS has set up proper boundaries between ESC and global AWS. Since I'm based out of the US I can't see anything going on in ECS even in the service we develop. To fix an issue there we have to play telephone with an engineer in ESC where they give us a summary of the issue or debug it on their own. All data is really 100% staying within ESC.<p>My guess is that ESC will be less reliable than other regions, at least for about a year. The isolation really slows down debugging issues. Problems that would be fixed in a day or two can take a month. The engineers in ESC don't have the same level of knowledge about systems as the teams owning them. The teething issues will eventually resolve, but new features will be delayed within the region.</p>
]]></description><pubDate>Fri, 16 Jan 2026 00:11:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=46641347</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=46641347</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46641347</guid></item><item><title><![CDATA[New comment by DevelopingElk in "Lie groups are crucial to some of the most fundamental theories in physics"]]></title><description><![CDATA[
<p>The consequence of Noether's theorem is that if a system is time symmetric then energy is conserved. On a global perspective, the universe isn't time symmetric. It has a beginning and an expansion through time. This isn't reversible so energy isn't conserved.</p>
]]></description><pubDate>Wed, 03 Dec 2025 22:35:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=46141215</link><dc:creator>DevelopingElk</dc:creator><comments>https://news.ycombinator.com/item?id=46141215</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46141215</guid></item></channel></rss>