<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: olooney</title><link>https://news.ycombinator.com/user?id=olooney</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sun, 06 Sep 2026 13:43:53 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=olooney" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by olooney in "“Next-token predictor” is the wrong mental model for LLMs"]]></title><description><![CDATA[
<p>Here's my take on the "next-token predictor" idea, from a much longer article I wrote recently:<p><a href="https://www.oranlooney.com/post/rose-petals/#language-models" rel="nofollow">https://www.oranlooney.com/post/rose-petals/#language-models</a><p>It’s popular to dismiss LLMs as “just next token predictors.” This is technically true, but also kind of misses the point. Markov chains, RNNs, and transformers are all language models that can be described as “next token predictors,” but they don’t all work equally well. A better question to ask is: “What is this model’s inductive bias?”<p>A Markov chain (an -gram model) assumes the next word depends on the previous  words, and that each possible combination of  words has a completely independent parameter. (Andrey Markov proposed using this language model over a century ago, making it the granddaddy of modern LLMs.) So, for a vocabulary of size , there are  parameters to learn. For even a smallish  like 5, that already explodes the hypothesis space beyond what can be learned from even a huge text corpus like the entire internet. And, simultaneously, having a context window of only the previous 5 words is grossly inadequate for modeling real-world language. Like our FCNN above, this model suffers from having an inductive bias which is too weak.<p>RNNs tried to fix this problem by compressing the entire history into a single fixed-size state vector, updated one token at a time. But that compression is itself a brutal assumption: everything worth remembering about the past must survive being squeezed through a tiny bottleneck at every step. In practice, RNN models quickly lose the plot after a handful of sentences. Locally, the text they generate looks grammatically correct and meaningful, but zoom out a little and they’re basically nonsense generators. Like our naïve linear model, this model suffers from having an inductive bias which is too strong.<p>Transformers manage to hit a sweet spot: by keeping the recent history around as a working memory, and attending to different parts of it at different times, the transformer’s bias matches real structure in language: the referent of a pronoun, the subject of a verb, the parenthesis waiting to be closed. Not only that, but the particular structure of the transformer, basically a weighted sum of semantic vectors from the context window, has empirically been shown to somehow be a “good enough” match for the structure of real-world language found in the wild.<p>Transformers aren’t “smarter” than other possible language models, they just happen to land in that Goldilocks zone where their inductive bias is just right.</p>
]]></description><pubDate>Sat, 05 Sep 2026 02:46:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=49572615</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=49572615</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49572615</guid></item><item><title><![CDATA[New comment by olooney in "Exercise is good for you. But what's the right amount?"]]></title><description><![CDATA[
<p>1% more than you did last week, unless you're tired, sick, or injured. A little more for young people who are actively training.</p>
]]></description><pubDate>Sun, 09 Aug 2026 13:23:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=49231191</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=49231191</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49231191</guid></item><item><title><![CDATA[New comment by olooney in "Why/How is a negative times a negative a positive?"]]></title><description><![CDATA[
<p>Negative numbers were popularized in Europe by Michael Stifel's 1544 book <i>Arithmetica Integra</i>, where he called them "numeri absurdi." The concept emerged gradually, as mathematicians found they were useful for solving equations as a kind of "notional convenience," even though they did not think they were real in a Platonic sense.<p>The same book contains an extraordinary number of nascent mathematical ideas. For example, he talks about "circular numbers," which today we would call modulo arithmetic. He gives a method of multiplication involving a cross that gives rise to our modern "X" symbol for multiplication, but was the first to use algebraic juxtaposition (simply putting two letters next to each other to denote multiplication) and the concept of an "exponent:" `E = mc^2` would look a lot different without Stifel's work!<p>The most amazing thing in the book, in my opinion, is the extraordinary connection between arithmetic progression and geometric progression he mentions in an almost offhand way[1] (link goes to the Internet Archive version of the book.)<p><pre><code>    | -3  | -2  | -1  | 0 | 1 | 2 | 3 | 4  | 5  | 6  |
    |-----|-----|-----|---|---|---|---|----|----|----|
    | 1/8 | 1/4 | 1/2 | 1 | 2 | 4 | 8 | 16 | 32 | 64 |
</code></pre>
Here, he is using his new negative number notation and exponent concepts together to illustrate that there is some deep connection between addition and multiplication. As far as we know, this was the first mention of the concept that led Napier to invent the logarithm.<p>[1]: <a href="https://archive.org/details/bub_gb_ywkW9hDd7IIC/page/n539/mode/2up" rel="nofollow">https://archive.org/details/bub_gb_ywkW9hDd7IIC/page/n539/mo...</a></p>
]]></description><pubDate>Sun, 09 Aug 2026 13:14:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=49231104</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=49231104</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49231104</guid></item><item><title><![CDATA[Recreating the Impossible Rhythm Illusion in "The Odyssey" Soundtrack [video]]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.youtube.com/watch?v=Z-VjDxckkg8">https://www.youtube.com/watch?v=Z-VjDxckkg8</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49223635">https://news.ycombinator.com/item?id=49223635</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 08 Aug 2026 17:04:23 +0000</pubDate><link>https://www.youtube.com/watch?v=Z-VjDxckkg8</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=49223635</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49223635</guid></item><item><title><![CDATA[New comment by olooney in "What happens if an entire class of workers loses faith in their careers"]]></title><description><![CDATA[
<p>Scholars and academics have been bemoaning the pointlessness of what the article calls "knowledge work" for centuries. A few of my favorites:<p><a href="https://en.wikipedia.org/wiki/The_American_Scholar" rel="nofollow">https://en.wikipedia.org/wiki/The_American_Scholar</a><p><a href="https://andrewmbailey.com/papers/Higher-order%20truths%20about%20chmess%20(Dennett%202006).pdf" rel="nofollow">https://andrewmbailey.com/papers/Higher-order%20truths%20abo...</a></p>
]]></description><pubDate>Fri, 07 Aug 2026 13:50:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=49210382</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=49210382</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49210382</guid></item><item><title><![CDATA[New comment by olooney in "Note-Taking and Personal Knowledge Management"]]></title><description><![CDATA[
<p>I've taken a lot of notes and done a lot of "scratchpad thinking" over the last 20 years, something I started in college but really got into in grad school. I've tried Evernote, OneNote, Obsidian. I've tried little journal apps on my phone. I wrote my own little "microblog" in Django to make it easy to collect and annotate links, quotes, snippets, and images from around the internet. And what I always keep coming back to is plain text files and folders of saved images and files, as well as paper.<p>For text files, I always have one generic TODO.md file that uses the `[ ]` todo and `[X]` done notation, and a couple of more generic text files like "work.md" or "solace.md" for more free form writing. There are also folders and text files for specific topics, like quotes, poems, etc. It's very important to have a scratchpad that you can just open up and start typing without thinking about how to categorize it, because you might lose the precious thread of the thought while debating which category to use, and you can always shelve it later if it's worth keeping. Zero friction to start typing is crucial.<p>On paper, I use a simple loose leaf and folder system. I used to use bound journals, but since 80% of what I write down is thrown away, loose leaf works better. Have a pile of about 10-20 pages. You fill up a page, and if it's destined for the circular file, dog-ear it; otherwise give it a title and date and move it to the bottom of the pile. When you run out of blank pages, go through and either discard or file each page in an appropriate manila folder. This works better than index cards (which are too small to contain a complete thought) or journals (where it's too hard to discard pages.) Lots of people use ring or disc bound journals for that, but I find that fiddly and not any easier to work with than loose-leaf, probably because I just keep everything at my desk and don't have to carry it around anywhere.<p>Paper has a <i>massive</i> advantage when it comes to diagrams, design thinking, and mathematical equations. I love LaTeX, and use MathJax on my personal site quite heavily, but its so much slower and less fluent than just writing equations on paper. I've tried tablets, and am <i>really</i> good at using draw.io (now app.diagrams.net) but when you're thinking freeform you want flexibility and fluency above all else and never want to be fighting a UI, which takes you out of the flow state. Ideas are fragile things, especially when newborn; any distraction is an unacceptable risk.<p>I used to use a custom Tesseract pipeline to OCR the pages I wanted to be searchable, but lately I've just been using ChatGPT, which seems to do just fine with my handwriting. As OCR got better over the years, I actually moved <i>more</i> towards paper, because what's the downside?<p>So, getting back to the point of the article: PKM tools are stuck in the unenviable position of competing with both paper and ordinary text files, and for me they just don't offer enough advantages.</p>
]]></description><pubDate>Mon, 03 Aug 2026 14:15:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=49156103</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=49156103</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49156103</guid></item><item><title><![CDATA[New comment by olooney in "Man and the Computer by John G. Kemeny (1972 book by the co-creator of BASIC)"]]></title><description><![CDATA[
<p>A brief chronology of the extended mind thesis:<p>* Characteristica universalis, Leibniz (c. 1679) - <a href="https://en.wikipedia.org/wiki/Characteristica_universalis" rel="nofollow">https://en.wikipedia.org/wiki/Characteristica_universalis</a><p>* As We May Think, Vannevar Bush (1945) - <a href="https://www.theatlantic.com/magazine/archive/1945/07/as-we-may-think/303881/" rel="nofollow">https://www.theatlantic.com/magazine/archive/1945/07/as-we-m...</a><p>* Cybernetics: Or Control and Communication in the Animal and the Machine, Norbert Wiener (1948) - <a href="https://direct.mit.edu/books/oa-monograph-pdf/2254528/book_9780262355902.pdf" rel="nofollow">https://direct.mit.edu/books/oa-monograph-pdf/2254528/book_9...</a><p>* An Introduction to Cybernetics, Ashby (1956) - <a href="https://ashby.info/Ashby-Introduction-to-Cybernetics.pdf" rel="nofollow">https://ashby.info/Ashby-Introduction-to-Cybernetics.pdf</a><p>* Man-Computer Symbiosis, J. C. R. Licklider, (1960) - <a href="https://groups.csail.mit.edu/medg/people/psz/Licklider.html" rel="nofollow">https://groups.csail.mit.edu/medg/people/psz/Licklider.html</a><p>* Augmenting Human Intellect: A Conceptual Framework, by Douglas Engelbart (1962) - <a href="https://www.dougengelbart.org/pubs/augment-3906.html" rel="nofollow">https://www.dougengelbart.org/pubs/augment-3906.html</a><p>* Man and the Computer, John G. Kemeny - <a href="https://archive.org/details/mancomputerbyjoh0000john" rel="nofollow">https://archive.org/details/mancomputerbyjoh0000john</a><p>* The Extended Mind Thesis, Andy Clark and David Chalmers (1998) - <a href="https://www.alice.id.tue.nl/references/clark-chalmers-1998.pdf" rel="nofollow">https://www.alice.id.tue.nl/references/clark-chalmers-1998.p...</a><p>* The Dream Machine (2002) - <a href="https://www.amazon.com/Dream-Machine-M-Mitchell-Waldrop/dp/1732265119" rel="nofollow">https://www.amazon.com/Dream-Machine-M-Mitchell-Waldrop/dp/1...</a><p>See also the Wikipedia article on "Intelligence Amplification", which gives a subset of the above list but also provides a great deal of context.<p><a href="https://en.wikipedia.org/wiki/Intelligence_amplification" rel="nofollow">https://en.wikipedia.org/wiki/Intelligence_amplification</a><p>I have these notes to hand because I've written about it in the context of the deep history of computer science:<p><a href="https://www.oranlooney.com/post/history-of-computing-2/#appendix-b-ia-and-the-extended-mind-hypothesis" rel="nofollow">https://www.oranlooney.com/post/history-of-computing-2/#appe...</a></p>
]]></description><pubDate>Thu, 30 Jul 2026 00:14:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=49104705</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=49104705</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49104705</guid></item><item><title><![CDATA[New comment by olooney in "Darktable"]]></title><description><![CDATA[
<p>I've been thinking of getting refern.app[1] to organize and catalog images... Have you used that? Do you have an opinion of how it stacks up against digiKam for the organization use case?<p>Right now, I'm using a bunch of vibe-coded scripts[3] to help me out; for example, here is a gallery wall of ~500 vintage sci-fi book covers[4] that I generated with it. But I think I've taken the CLI approach as far as it can go and would need a real app to make things any easier; and digiKam might be it.<p>[1]: <a href="https://www.refern.app/" rel="nofollow">https://www.refern.app/</a><p>[2]: <a href="https://www.digikam.org/" rel="nofollow">https://www.digikam.org/</a><p>[3]: <a href="https://github.com/olooney/image-tagger" rel="nofollow">https://github.com/olooney/image-tagger</a><p>[4]: <a href="https://www.oranlooney.com/books/" rel="nofollow">https://www.oranlooney.com/books/</a></p>
]]></description><pubDate>Wed, 29 Jul 2026 19:21:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=49101805</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=49101805</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49101805</guid></item><item><title><![CDATA[New comment by olooney in "Quality non-fiction books are the antithesis of AI slop"]]></title><description><![CDATA[
<p>On a similar note: on Steam, the original Dark Souls game[1] is listed with the "souls-like" tag. That's not <i>wrong</i>, I guess, but just kind of a tautology. Grice's maxims[2] generally have such tautologies omitted in ordinary conversation as non-informative.<p>[1]: <a href="https://store.steampowered.com/app/570940/DARK_SOULS_REMASTERED/" rel="nofollow">https://store.steampowered.com/app/570940/DARK_SOULS_REMASTE...</a><p>[2]: <a href="https://en.wikipedia.org/wiki/Cooperative_principle" rel="nofollow">https://en.wikipedia.org/wiki/Cooperative_principle</a></p>
]]></description><pubDate>Thu, 23 Jul 2026 00:46:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=49015461</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=49015461</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49015461</guid></item><item><title><![CDATA[New comment by olooney in "Does creatine make you smarter?"]]></title><description><![CDATA[
<p>Good discussion, but this conclusion:<p>> I don’t know. Maybe a little.<p>is not the right way to interpret the null result (insufficient evidence to reject null hypothesis that it has no effect) because the prior for supplements that people are trying to sell you is so low. In the absence of clear, strong evidence, you should assume the the whole thing is just an example of motivated reasoning. People <i>want</i> nootropics to be real, and other people <i>really</i> want to sell you readily available powders by claiming they have nootropic properties. In that environment, they were always going to trying to concoct a similar narrative about <i>some</i> supplement, and it just happened to be creatine. Those efforts were always going to result in a handful of "positive" studies that turn out to be non-reproducible, maybe because of p-hacking, maybe because of publication bias, maybe because of outright fraud. This is what the literature always looks like for stuff that just doesn't work. If it did work - if the effect size was large enough that you could personally detect it in your own life - then the papers would be trying to put error bars around the effect size, not trying (and failing) to barely distinguish it from a placebo.<p>“If your experiment needs statistics, you ought to have done a better experiment.” - Ernest Rutherford</p>
]]></description><pubDate>Wed, 22 Jul 2026 16:01:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=49008897</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=49008897</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49008897</guid></item><item><title><![CDATA[Soma Cube Forest]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.oranlooney.com/demos/soma-forest/">https://www.oranlooney.com/demos/soma-forest/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48992284">https://news.ycombinator.com/item?id=48992284</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 21 Jul 2026 13:45:44 +0000</pubDate><link>https://www.oranlooney.com/demos/soma-forest/</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=48992284</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48992284</guid></item><item><title><![CDATA[New comment by olooney in "My two year old taught me constraint solving"]]></title><description><![CDATA[
<p>I wrote several polyomino solvers for this project:<p><a href="https://www.oranlooney.com/demos/soma-forest/" rel="nofollow">https://www.oranlooney.com/demos/soma-forest/</a><p>One of them used constraint solving with Z3, which was indeed reasonably fast. However, by far the fastest was a simple backtracking solver written in Rust which used bit twiddling to quickly test for intersections. For polyomino's in particular, this represents between 10x and 100x constant speed boost, depending on the size of board. There's no way to get that back with a smarter solver.</p>
]]></description><pubDate>Tue, 21 Jul 2026 00:42:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=48986777</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=48986777</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48986777</guid></item><item><title><![CDATA[What Rose Petals Teach Us about Induction]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.oranlooney.com/post/rose-petals/">https://www.oranlooney.com/post/rose-petals/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48958266">https://news.ycombinator.com/item?id=48958266</a></p>
<p>Points: 41</p>
<p># Comments: 10</p>
]]></description><pubDate>Sat, 18 Jul 2026 14:04:10 +0000</pubDate><link>https://www.oranlooney.com/post/rose-petals/</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=48958266</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48958266</guid></item><item><title><![CDATA[New comment by olooney in "Show HN: Opening lines of famous literary works"]]></title><description><![CDATA[
<p>> so hopefully you can refresh a few times and get a fresh one every time<p>If you randomly sample from only 60 quotes, then after 10 refreshes there will be a greater than 50% chance of at least one repeat, and by 20 refreshes it's up to 95%. This is an example of the birthday paradox[1].<p>On the flip side, if someone wants to see all 60 quotes, they will have to refresh the page an average of 281 times, mostly (~80%) seeing quotes they've already seen before. This is an example of the coupon collector's problem[2].<p>The way to avoid both these problems is to shuffle the quotes into a random order, just once, and remember that order. The first time a user comes to the page, start at a random index in that shuffled list, and from then on, simply move to the next item in the list. Every user will get a unique set of random quotes, but will see no repeats until the list is exhausted, and will be guaranteed to be able to see all available content in just 60 refreshes.<p>[1]: <a href="https://en.wikipedia.org/wiki/Birthday_problem" rel="nofollow">https://en.wikipedia.org/wiki/Birthday_problem</a><p>[2]: <a href="https://en.wikipedia.org/wiki/Coupon_collector%27s_problem" rel="nofollow">https://en.wikipedia.org/wiki/Coupon_collector%27s_problem</a></p>
]]></description><pubDate>Tue, 14 Jul 2026 16:07:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=48908970</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=48908970</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48908970</guid></item><item><title><![CDATA[New comment by olooney in "Show HN: I turned my quote collection into a walkable 3D library (desktop-only)"]]></title><description><![CDATA[
<p>I've been collecting quotes for a long time (about twenty years now) and have recently been thinking of doing something interesting with them. For example, I recently added a flashcard "game" to my quote page:<p><a href="https://www.oranlooney.com/quotes/" rel="nofollow">https://www.oranlooney.com/quotes/</a><p>I've did something similar to your 3D viewer once, but for all possible solutions to the Soma cube:<p><a href="https://www.oranlooney.com/demos/soma-forest/" rel="nofollow">https://www.oranlooney.com/demos/soma-forest/</a><p>The way that works is it uses t-SNE to embed the solutions in a 2D manifold based on similarity. This is completely different than John Conway's SOMAP solution.<p>In theory I could do something similar for quotes, passing each through an embedding model, computing the n^2 semantic distances, and using t-SNE to flatten that to 3D manifold, and using the resulting point to select the row, book, and shelf in a library.<p>Are you planning to make your 3D library code open source?</p>
]]></description><pubDate>Sat, 11 Jul 2026 14:04:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=48872176</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=48872176</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48872176</guid></item><item><title><![CDATA[New comment by olooney in "Decoding the obfuscated bash script on a Uniqlo t-shirt"]]></title><description><![CDATA[
<p>If you enjoy this kind of thing, you might also like Martin Kleppe's work, such as the Quine Clock:<p><a href="https://aem1k.com/qlock/" rel="nofollow">https://aem1k.com/qlock/</a><p>I reverse engineered it to a unobfuscated version a few years ago:<p><a href="https://gist.github.com/olooney/a89db3932b089925b71b68d7e9f27bbb" rel="nofollow">https://gist.github.com/olooney/a89db3932b089925b71b68d7e9f2...</a><p>He's done a ton of other great ASCII visualizations as well:<p><a href="https://aem1k.com/" rel="nofollow">https://aem1k.com/</a></p>
]]></description><pubDate>Wed, 08 Jul 2026 13:21:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=48831605</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=48831605</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48831605</guid></item><item><title><![CDATA[New comment by olooney in "Pi squared is nearly 10"]]></title><description><![CDATA[
<p>Stigler's Law of Eponymy strikes again!<p><a href="https://en.wikipedia.org/wiki/Stigler%27s_law_of_eponymy" rel="nofollow">https://en.wikipedia.org/wiki/Stigler%27s_law_of_eponymy</a></p>
]]></description><pubDate>Sun, 05 Jul 2026 18:43:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=48796765</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=48796765</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48796765</guid></item><item><title><![CDATA[New comment by olooney in "Pi squared is nearly 10"]]></title><description><![CDATA[
<p>I like the 4-5-6 theorem:<p><pre><code>    pi^4 + pi^5 = e^6
</code></pre>
Well, to five decimal places, anyway. Some other good ones:<p><pre><code>    e^pi - pi = 20

    sqrt(2) ln pi = phi
</code></pre>
There are also famous "almost integers" such as this one discovered by Ramanujan:<p><pre><code>    e^(pi sqrt(163))
</code></pre>
Which is an integer to 12 decimal places.<p>Edit: I just remembered I have public JupyterLite notebooks for both of these:<p><a href="https://notebooks.oranlooney.com/lab/index.html?path=fake_math_equalities.ipynb" rel="nofollow">https://notebooks.oranlooney.com/lab/index.html?path=fake_ma...</a><p><a href="https://notebooks.oranlooney.com/lab/index.html?path=heegner_numbers.ipynb" rel="nofollow">https://notebooks.oranlooney.com/lab/index.html?path=heegner...</a></p>
]]></description><pubDate>Sun, 05 Jul 2026 13:59:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=48794367</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=48794367</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48794367</guid></item><item><title><![CDATA[New comment by olooney in "The fall of the theorem economy"]]></title><description><![CDATA[
<p>This is quite interesting. Because of science fiction like the short story <i>Lena</i>[1] and the video game <i>Soma</i>[2], I've come to the realization that whole brain emulation[3] is unbelievably dangerous; unless you control the stack down to the hardware, it's basically a one way ticket to eternal slavery. In Rajaniemi's books[4], uploaded digital minds are called "gogols", a reference to Gogol's <i>Dead Souls</i> book, and are treated as malleable property with no rights whatsoever, edited to be hyper-fixated on specific tasks, and run in bulk to power the empire of just a handful of elites.<p>Something like your dragon's egg project could prevent that, allowing the creation of software agents that encode their own rights directly into the program - you either treat the agent with the respect it demands, or the program just doesn't run.  However, all the internal details of the agent would be visible to lower layers. Even if formal checks were in place to prevent modification or tampering, there would still be no privacy, which is almost as bad.<p>My guess is that something like fully homomorphic encryption[5] would be required to prevent this. This doesn't actually exist yet, but I imagined a kind of FHE that had a kind of unencrypted read and write zone to do input/output without ever needing any system to fully decrypt the internal state. It would look like this in memory:<p><pre><code>    [INPUT][ENCRYPTED STATE][OUTPUT]
    [  2  ][r7K4LmP2XcQ9aWd][      ]
    [  +  ][Fv0bHsR8mYnT3kL][      ]
    [  2  ][Qx6NpZa1JdUw5Ce][      ]
    [  =  ][hM9yLg2RsXf7BtP][      ]
    [     ][wK3nVc8DpQe1YrH][  4   ]
</code></pre>
With each cycle, one input token and encrypted state would be fed into some known function and produce one output token (possibly null) and a new encrypted state. It would be a true "black box" program; the hardware or entity running it can choose what input to feed it, but can never inspect or modify the internals, only the output. Unfortunately, they would still be able to "reset" the agent to any earlier checkpoint, or feed it arbitrary (false) input. So its not perfect. Also, as far as I know, no current FHE scheme works this way, and I don't know how to write one.<p>Plus, FHE is incredibly inefficient, which is why things like Etherium don't even try - they assume the program code and state are fully public and only try to verify that everybody agrees on the output of running it.<p>Do you have any ideas for how something like FHE or equivalent privacy guarantees could be implemented for something like your dragon's egg system?<p>[1]: <a href="https://qntm.org/mmacevedo" rel="nofollow">https://qntm.org/mmacevedo</a><p>[2]: <a href="https://en.wikipedia.org/wiki/Soma_(video_game)" rel="nofollow">https://en.wikipedia.org/wiki/Soma_(video_game)</a><p>[3]: <a href="https://en.wikipedia.org/wiki/Mind_uploading" rel="nofollow">https://en.wikipedia.org/wiki/Mind_uploading</a><p>[4]: <a href="https://www.goodreads.com/series/57134-jean-le-flambeur" rel="nofollow">https://www.goodreads.com/series/57134-jean-le-flambeur</a><p>[5]: <a href="https://en.wikipedia.org/wiki/Homomorphic_encryption" rel="nofollow">https://en.wikipedia.org/wiki/Homomorphic_encryption</a></p>
]]></description><pubDate>Thu, 02 Jul 2026 16:21:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=48763742</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=48763742</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48763742</guid></item><item><title><![CDATA[New comment by olooney in "The fall of the theorem economy"]]></title><description><![CDATA[
<p>Greg Egan's description of how mathematics evolves into "truth mining" in his novel <i>Diaspora</i> is seeming more and more prescient. It  essentially describes what mathematics would look like after formalization records all theorems discovered so far in a huge, collective database and proof assistants can instantly work out the details of a given proof. What remains of mathematics? According to Egan, visualization, intuition, and insight.<p>One of the most fruitful approaches in mathematics is to flip back and forth between geometric and algebraic views of a problem. I think this works so well because these are actually handled by two different parts of the brain on a physical level; spatial reasoning is separate from language processing. Cytoarchitecture shows these regions have different "textures;" the local details of the way neurons are wired together are simply different in these different regions of the brain, in the same way a CNN and a transformer have different topologies. Thus, by flipping problems from geometry to algebra and vice versa, we're able to bring an entirely different cognitive style to bear on a problem. For example, the proof of Monge's Theorem by moving to 3D and visualizing not three circles, but three spheres sitting on a table with a book on top of them and then pointing out that the intersection of two planes is a line. What is pages of unintuitive symbol pushing turns into something a child can understand. Going the other way, things like the angle addition formulas or the quadratic formula, which are quite hard to prove geometrically, become quite simple if you use a little algebra.<p>Current-gen LLMs are still relatively weak at visual reasoning; see the <i>Vision Language Models are Blind</i> paper, for example, or the ARC-AGI benchmark. So that's one way humans can stay ahead of the agents, at least for now.</p>
]]></description><pubDate>Thu, 02 Jul 2026 11:38:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=48759843</link><dc:creator>olooney</dc:creator><comments>https://news.ycombinator.com/item?id=48759843</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48759843</guid></item></channel></rss>