<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: peter_d_sherman</title><link>https://news.ycombinator.com/user?id=peter_d_sherman</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 17 Apr 2026 06:17:59 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=peter_d_sherman" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by peter_d_sherman in "Verification Debt Is Your Next Headache"]]></title><description><![CDATA[
<p>>"If AI makes every engineer 50% more productive, you don't get 50% more output. You get 50% more pull requests. 50% more documentation. 50% more design proposals. And <i>someone, somewhere, still has to review all of it.</i><p>When two or three early adopters start generating more PRs than before, the team absorbs it. No big deal.<p><i>When everyone does it, review becomes the constraint.</i><p>The <i>bottleneck doesn't vanish. It moves upstream</i>, to the parts of the job that are irreducibly human: deciding what to build, defining "done," understanding the domain, making judgment calls about risk.<p>I've written about this pattern before:<p><i>the work didn't disappear, it moved.</i><p>What's new here is that it moved specifically into <i>verification</i> - and most teams haven't consciously staffed or structured for that yet.<p>[...]<p>The question isn't "how do we produce more code?" anymore. The question is <i>"how do we verify more code?"</i> And I don't think most teams have a real answer to that yet."<p>Excellent article!<p>It's a great question... how do we <i>verify</i> AI produced code?  We could use AI to do that too, but then:<p><i>Who verifies the verifier?</i><p>Related:<p><i>Quis custodiet ipsos custodes?</i> (Alternatively known as: "Who watches the watchmen?" / "Who oversees the overseers?" / "Who manages the managers?" / "Who guards the guardians?" / "Who reviews the reviewers?", etc., etc.):<p><a href="https://en.wikipedia.org/wiki/Quis_custodiet_ipsos_custodes%3F" rel="nofollow">https://en.wikipedia.org/wiki/Quis_custodiet_ipsos_custodes%...</a></p>
]]></description><pubDate>Wed, 15 Apr 2026 03:24:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=47774333</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47774333</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47774333</guid></item><item><title><![CDATA[Understanding the FFT Algorithm (2013)]]></title><description><![CDATA[
<p>Article URL: <a href="https://jakevdp.github.io/blog/2013/08/28/understanding-the-fft/">https://jakevdp.github.io/blog/2013/08/28/understanding-the-fft/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47773969">https://news.ycombinator.com/item?id=47773969</a></p>
<p>Points: 5</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 15 Apr 2026 02:29:39 +0000</pubDate><link>https://jakevdp.github.io/blog/2013/08/28/understanding-the-fft/</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47773969</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47773969</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "Gauss' Secret Way to Calculate π Faster [video]"]]></title><description><![CDATA[
<p>IMHO: Of all of the videos showing Pi's relationship with the Arithmetic-Geometric Mean (AGM), this is the best one.<p>Related:<p>Gauss–Legendre algorithm:<p><a href="https://en.wikipedia.org/wiki/Gauss%E2%80%93Legendre_algorithm" rel="nofollow">https://en.wikipedia.org/wiki/Gauss%E2%80%93Legendre_algorit...</a><p>Arithmetic–Geometric Mean (AGM)<p><a href="https://en.wikipedia.org/wiki/Arithmetic%E2%80%93geometric_mean" rel="nofollow">https://en.wikipedia.org/wiki/Arithmetic%E2%80%93geometric_m...</a><p>Chudnovsky algorithm<p><a href="https://en.wikipedia.org/wiki/Chudnovsky_algorithm" rel="nofollow">https://en.wikipedia.org/wiki/Chudnovsky_algorithm</a><p>Landen's transformation<p><a href="https://en.wikipedia.org/wiki/Landen%27s_transformation" rel="nofollow">https://en.wikipedia.org/wiki/Landen%27s_transformation</a><p>Binary splitting:<p><a href="https://en.wikipedia.org/wiki/Binary_splitting" rel="nofollow">https://en.wikipedia.org/wiki/Binary_splitting</a></p>
]]></description><pubDate>Wed, 15 Apr 2026 02:29:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=47773964</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47773964</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47773964</guid></item><item><title><![CDATA[Gauss' Secret Way to Calculate π Faster [video]]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.youtube.com/watch?v=7qiDDhIYx48">https://www.youtube.com/watch?v=7qiDDhIYx48</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47773792">https://news.ycombinator.com/item?id=47773792</a></p>
<p>Points: 1</p>
<p># Comments: 1</p>
]]></description><pubDate>Wed, 15 Apr 2026 02:00:00 +0000</pubDate><link>https://www.youtube.com/watch?v=7qiDDhIYx48</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47773792</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47773792</guid></item><item><title><![CDATA[100x Defect Tolerance: How Cerebras Solved the Yield Problem (2025)]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.cerebras.ai/blog/100x-defect-tolerance-how-cerebras-solved-the-yield-problem">https://www.cerebras.ai/blog/100x-defect-tolerance-how-cerebras-solved-the-yield-problem</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47652296">https://news.ycombinator.com/item?id=47652296</a></p>
<p>Points: 5</p>
<p># Comments: 0</p>
]]></description><pubDate>Sun, 05 Apr 2026 18:20:10 +0000</pubDate><link>https://www.cerebras.ai/blog/100x-defect-tolerance-how-cerebras-solved-the-yield-problem</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47652296</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47652296</guid></item><item><title><![CDATA[Businesses you can start and run from a phone?]]></title><description><![CDATA[
<p>Article URL: <a href="https://old.reddit.com/r/Entrepreneur/comments/2r8vop/businesses_you_can_start_and_run_from_a_phone/">https://old.reddit.com/r/Entrepreneur/comments/2r8vop/businesses_you_can_start_and_run_from_a_phone/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47641863">https://news.ycombinator.com/item?id=47641863</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 04 Apr 2026 18:29:59 +0000</pubDate><link>https://old.reddit.com/r/Entrepreneur/comments/2r8vop/businesses_you_can_start_and_run_from_a_phone/</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47641863</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47641863</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "I Built an SMS Gateway with a $20 Android Phone – Jonno.nz"]]></title><description><![CDATA[
<p>Brilliant idea!<p>Heck, a brilliant potential <i>bootstrapped-from-virtually-nothing-except-a-cell-phone</i> business idea!</p>
]]></description><pubDate>Sat, 04 Apr 2026 18:28:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=47641851</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47641851</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47641851</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "No One at Waffle House Remembers FEMA Official Who Says He Teleported In"]]></title><description><![CDATA[
<p>(Comedy writing mode ON):<p>SNL's Stefon character: "This one has it all... Waffle House, FEMA, breakfast foods, federal emergencies, waffles, emergency preparedness, eggs, teleportation, bacon, black helicopters, hash browns, angry men in combat fatigues talking to God over 2-way radios, George Carlin, grits, syrup for the grits, toast, military communications, orange juice, armageddon/end-of-the-world apocalypse themes, milk, coffee and other breakfast items... all for a very reasonable price!"<p>:-)<p>(Comedy writing mode OFF)</p>
]]></description><pubDate>Sat, 04 Apr 2026 17:50:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=47641438</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47641438</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47641438</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "Show HN: sllm – Split a GPU node with other developers, unlimited tokens"]]></title><description><![CDATA[
<p>What a brilliant idea!<p>Split a "it needs to run in a datacenter because its hardware requirements are so large" AI/LLM across multiple people who each want shared access to that particular model.<p>Sort of like the Real Estate equivalent of subletting, or splitting a larger space into smaller spaces and subletting each one...<p>Or, like the Web Host equivalent of splitting a single server into multiple virtual machines for shared hosting by multiple other parties, or what-have-you...<p><i>I could definitely see marketplaces similar to this, popping up in the future!</i><p>It seems like it should make AI cheaper for everyone... that is, "democratize AI"... in a "more/better/faster/cheaper" way than AI has been democratized to date...<p>Anyway, it's a brilliant idea!<p>Wishing you a lot of luck with this endeavor!</p>
]]></description><pubDate>Sat, 04 Apr 2026 17:04:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=47640970</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47640970</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47640970</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "Abstract Semantic Graph"]]></title><description><![CDATA[
<p>>"<i>ASGs are more complex and concise than ASTs</i><p>because they may contain shared subterms (also known as "common subexpressions").[1]<p><i>Abstract semantic graphs</i> are often used as an <i>intermediate representation</i> by compilers to store the results of performing common subexpression elimination upon abstract syntax trees."<p>Related (Transpiler IR Related):<p>Intermediate Representations:<p><a href="https://cs.lmu.edu/~ray/notes/ir/" rel="nofollow">https://cs.lmu.edu/~ray/notes/ir/</a><p><a href="https://en.wikipedia.org/wiki/Intermediate_representation" rel="nofollow">https://en.wikipedia.org/wiki/Intermediate_representation</a><p>QBE Intermediate Language:<p><a href="https://c9x.me/compile/" rel="nofollow">https://c9x.me/compile/</a><p><a href="https://c9x.me/compile/doc/il.html" rel="nofollow">https://c9x.me/compile/doc/il.html</a><p>Can Large Language Models Understand Intermediate Representations in Compilers?:<p><a href="https://arxiv.org/abs/2502.06854" rel="nofollow">https://arxiv.org/abs/2502.06854</a></p>
]]></description><pubDate>Tue, 31 Mar 2026 23:00:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=47594603</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47594603</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47594603</guid></item><item><title><![CDATA[Abstract Semantic Graph]]></title><description><![CDATA[
<p>Article URL: <a href="https://en.wikipedia.org/wiki/Abstract_semantic_graph">https://en.wikipedia.org/wiki/Abstract_semantic_graph</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47594580">https://news.ycombinator.com/item?id=47594580</a></p>
<p>Points: 2</p>
<p># Comments: 1</p>
]]></description><pubDate>Tue, 31 Mar 2026 22:57:33 +0000</pubDate><link>https://en.wikipedia.org/wiki/Abstract_semantic_graph</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47594580</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47594580</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "Kotlin creator's new language: talk to LLMs in specs, not English"]]></title><description><![CDATA[
<p>There's an <i>interesting set of ideas</i> here!<p>If we look at the history of programming languages, we see the idea of <i>Templating </i> occuring over and over again, in different contexts, i.e., C's macros, C++ Templates, embedding PHP code snippets into an otherwise mostly HTML file, etc., etc.<p>Templating can involve aspects of meta-code (code about the code), interpretation proxying (which engine/compiler/system/parser/program/subsystem/? is responsible for interpreting a given section of text), etc., etc.<p>Here we see this idea as another level of proxied/layered abstraction/indirection, in this case between an AI/LLM and the underlying source code...<p>Is this a good idea?<p>Will all code be written like this, using this pattern or a similar one, in the future?<p>I for one don't know (it's too early to tell!) but one thing is for sure, and that's that this new "layer" certainly contains an <i>interesting set of ideas</i>!<p>I will definitely be watching to see more about how this pattern plays out in future software development...</p>
]]></description><pubDate>Mon, 16 Mar 2026 18:45:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=47403037</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47403037</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47403037</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "Federal Right to Privacy Act – Draft legislation"]]></title><description><![CDATA[
<p>Full text:<p><a href="https://github.com/righttoprivacyact/bill/blob/main/bill/right_to_privacy_act.md" rel="nofollow">https://github.com/righttoprivacyact/bill/blob/main/bill/rig...</a></p>
]]></description><pubDate>Mon, 16 Mar 2026 18:00:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=47402477</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47402477</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47402477</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "If It Quacks Like a Package Manager"]]></title><description><![CDATA[
<p>>"The quacking that catches my ear is when something develops a dependency graph: your package depends on a package that depends on a package, and now you need resolution algorithms, lockfiles, integrity verification, and some way to answer “what am I actually running and how did it get here?”<p>Several tools that started as plugin systems, CI runners, and chart templating tools have quietly grown transitive dependency trees. Now they walk like a package manager, quack like a package manager, and have all the problems that npm and Cargo and Bundler have spent years learning to manage, though most of them haven’t caught up on the solutions."<p><a href="https://edolstra.github.io/pubs/phd-thesis.pdf" rel="nofollow">https://edolstra.github.io/pubs/phd-thesis.pdf</a></p>
]]></description><pubDate>Tue, 10 Mar 2026 10:37:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=47321438</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47321438</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47321438</guid></item><item><title><![CDATA[Tachyum Open Sources 281GB/S TDIMM for the Future of AI and Computing (2025)]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.tachyum.com/media/press-releases/2025/11/25/tachyum-open-sources-281gb/s-tdimm-for-the-future-of-ai-and-computing/">https://www.tachyum.com/media/press-releases/2025/11/25/tachyum-open-sources-281gb/s-tdimm-for-the-future-of-ai-and-computing/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47320810">https://news.ycombinator.com/item?id=47320810</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 10 Mar 2026 09:16:03 +0000</pubDate><link>https://www.tachyum.com/media/press-releases/2025/11/25/tachyum-open-sources-281gb/s-tdimm-for-the-future-of-ai-and-computing/</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47320810</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47320810</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "Crawling a billion web pages in just over 24 hours, in 2025"]]></title><description><![CDATA[
<p>Very interesting!<p>Yes, in this day and age, I could definitely see web pages being harder to crawl by search engines (and SEO companies and other users of automated web crawling technologies (AI agents?)) than they were in the early days of the Internet due to many possible causes -- many of which you've excellently described!<p>In other words, there's more to be aware of for anyone writing a search engine (or search-engine-like piece of software -- SEO, AI Agent, etc., etc.) than there was in the early days of the Internet, where everything was straight unencrypted http and most URLs were easily accessible without having to jump through additional hoops...<p>Which leads me to wonder... on the one hand, a website owner may not want bots and other automated software agents spidering their site (we have ROBOTS.TXT for this), but on the flip side, most business owners DO want publicity and easy accessibility for sales and marketing purposes, thus, they'd never want to issue a 403 (or other error code) for any public-facing product webpage...<p>Thus there may be a market for testing public facing business/product websites against faulty "I can't give you that web page for whatever reason" error codes from a wide variety of clients, from a wide variety of locations around the world.<p>That market is related to the market for testing if a website is up and functioning properly (the "uptime market"), again, from a wide variety of locations around the world, using a wide variety of browsers...<p>So, a very interesting post!<p>Also (for future historians!) compare all of the restrictive factors which may prevent access to a public-facing web page today Vs. Tim Berners-Lee original vision for the web, which was basically to let scientists (and other academic types!) SHARE their data PUBLICLY with one another!<p>(Things have changed... a bit! :-) )<p>Anyway, a very interesting post, and a very interesting article -- for both present and future Search Engine programmers!</p>
]]></description><pubDate>Tue, 24 Feb 2026 02:02:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=47131944</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47131944</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47131944</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "Making Wolfram tech available as a foundation tool for LLM systems"]]></title><description><![CDATA[
<p>>"But an approach that’s immediately and broadly applicable today—and for which we’re releasing several new products—is based on what we call<p><i>computation-augmented generation, or CAG.</i><p>The key idea of <i>CAG</i> is to inject in real time capabilities from our foundation tool into the stream of content that LLMs generate. In traditional retrieval-augmented generation, or RAG, one is injecting content that has been retrieved from existing documents.<p><i>CAG is like an infinite extension of RAG</i><p>, in which <i>an infinite amount of content</i> can be <i>generated on the fly—using computation</i>—to feed to an LLM."<p>We welcome <i>CAG</i> -- to the list of LLM-related technologies!</p>
]]></description><pubDate>Tue, 24 Feb 2026 01:25:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=47131645</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47131645</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47131645</guid></item><item><title><![CDATA[The Pope Bot – OpenClaw Alternative]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/stephengpope/thepopebot">https://github.com/stephengpope/thepopebot</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47131542">https://news.ycombinator.com/item?id=47131542</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 24 Feb 2026 01:13:04 +0000</pubDate><link>https://github.com/stephengpope/thepopebot</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47131542</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47131542</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "I found a vulnerability. they found a lawyer"]]></title><description><![CDATA[
<p>My favorite quote from the article:<p><i>"Don't shoot the messenger. The person reporting the bug is not your enemy. The bug is."</i></p>
]]></description><pubDate>Mon, 23 Feb 2026 07:01:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=47119002</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47119002</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47119002</guid></item><item><title><![CDATA[New comment by peter_d_sherman in "Six Math Essentials"]]></title><description><![CDATA[
<p>Here is what Grok says about the above (I asked it to explain it better):<p>Grok:<p>"⟨T⟩0: ZFC (The Material) — Zermelo–Fraenkel set theory with the axiom of choice (the standard foundation for most modern mathematics). Called "The Material" and metaphorically "the box that contains the idea of a box," highlighting how ZFC provides the basic "stuff" (sets) out of which everything else is built. Without this, "you aren’t even playing the game."<p>⟨T⟩1: Topology (The Stage) — Introduces the primitive notion of "nearness" or continuity without any rigid measurement (no distances or angles yet). Famously, topology is "rubber-sheet geometry," where continuous deformations are allowed, so a donut and a coffee mug are equivalent (both have one hole/handle). Singularities/infinities (e.g., zero-point in physics or the point at infinity in projective geometry) can exist naturally here without causing foundational issues.<p>⟨T⟩2: Geometry (The Ruler) — Builds on topology by adding concrete measurements (distances, angles, metrics). It's topology "forced to commit" to specifics.<p>⟨T⟩3: Algebra (The Syntax) — Focuses on symmetries and structures (groups, rings, fields, etc.) that geometry permits. It's more abstract and rule-based ("the ledger" tracking allowed operations).<p>⟨T⟩4: Analysis (The Measure) — Deals with limits, continuity, change, integration/differentiation, etc. ("measuring the vibration of a string"). It's powerful for dynamics but "blind" to deeper structural issues in the underlying topology or sets.<p>(Or, phrased another way, it's one set of possibilities for a "<i>Math/Mathematics Stack</i>" (AKA <i>"Abstraction Hierarchy"</i>, <i>"Math Abstraction Hierarchy"</i>) built level by level, on top of the foundation of Logic...)</p>
]]></description><pubDate>Mon, 23 Feb 2026 05:41:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=47118550</link><dc:creator>peter_d_sherman</dc:creator><comments>https://news.ycombinator.com/item?id=47118550</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47118550</guid></item></channel></rss>