<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: derefr</title><link>https://news.ycombinator.com/user?id=derefr</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 14 Aug 2026 22:24:42 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=derefr" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by derefr in "Delta"]]></title><description><![CDATA[
<p>I wonder if a productive avenue might be "doing aspect-oriented programming in reverse": asking the LLM not to "summarize" the code per se, but rather to "clarify" it by transforming it into what a programming blog post would call a "toy example" of what the code is doing, by stripping out all the (non-semantic) error-handling, logging, metrics incrementing, etc — all the things that you might treat as their own "aspects" under AOP.</p>
]]></description><pubDate>Wed, 12 Aug 2026 19:35:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=49277521</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49277521</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49277521</guid></item><item><title><![CDATA[New comment by derefr in "DeepSeek V4 Pro 0813"]]></title><description><![CDATA[
<p>Because complex problems can be decomposed (a skill in itself) into easy parts and hard parts; and the hard parts are almost always bottlenecked on understanding concepts and principles (i.e. things that are either in a model's weights, or not), not on having certain facts available. Models <i>can</i> solve complex problems insofar as they can decompose those problems, and have learned the concepts and principles relevant to approaching the hard parts of those problems.<p>Whereas tool-use isn't a capability problem, but a context problem: the thing that makes models fail by default is that they have no idea, when first summoned out of the aether, what kind of conversation they're having, who it's with, what that person is trying to do, what tools they have available, and how those tools can be invoked.<p>Think of the difference between how you'd respond to a casual programming question asked by a person sitting next to you on a flight, vs. a programming question asked of you by someone you're pair-programming with with your IDE open in front of you. Now imagine waking up blind and deaf and needing to discern which of the two situations you're in. LLMs know <i>how</i> to approach both of these problem-contexts (and more besides), but they need to be given context to know which problem-context they're in (and everything else about that problem-context: which IDE they're using, which OS it's installed on, what other tools are installed+accessible, etc.)<p>And before you say "but why can't they just <i>experiment to figure these things out</i>" — if you think about it, knowing how to interface with a shell and an IDE are <i>bootstrapping requirements</i> for any kind of experimentation, in about the same way that "knowing how to open your eyes and move your head" is a bootstrap requirement for a human gaining information about the world around them. These capabilities are necessary to explore the world to "discover" and "probe" other capabilities.<p>---<p>Also, a lot of the work LLMs do "needs" (i.e. is heavily improved by the use of) some kind of structured scratchpad, that they have been trained to manipulate and "look at" through tool-use. Even for a human who could accurately visualize a canvas based on a coordinate system, you still wouldn't expect said human to succeed at the pelican test if they had to write the SVG entirely in their head and then write it out sequentially with no rewinding to fix mistakes. You'd expect them to ask for at least a whiteboard, if not a text editor, to be able to write and rewrite the SVG XML.<p>(Really, they'd <i>ideally</i> want to <i>run</i> the SVG and look at it to see how close it is, and optimize that way. I'm not sure if we're letting LLMs do that part in the classical pelican test. It feels like that would vaguely violate the "zero-shot"-ness of the test, though I'm not sure if we're currently considering a conversation to be "zero-shot" if it involves the model iteratively interacting with a third-party system [such that there are repeated model -> system -> model conversation turns] but holding off to responding to the user until they think they've fully solved the problem.)<p>---<p>And <i>also</i>, on a lower level, all of these external capabilities are getting exposed to the LLM through MCP. Models can and do understand how to speak <i>MCP itself</i>. But there's no standard for how a given harness's capabilities (e.g. "execute command line in new shell session", "send patch edit command to active tab in IDE", etc) should be modelled to be exposed <i>through</i> MCP, either in their encoding or in their semantics. There's no MCP equivalent of WASM's WASI meta-standard, such that models could learn these specs and "assume by default" that things work like them until told otherwise; and nor are there even open harnesses that LLMs could learn about during training, and through them, learn some de-facto MCP-endpoint specs. Instead, there are mostly just proprietary harnesses, that hide all that info from public access, sharing it only with the LLM during inference, and even then, only at the moment the LLM needs it.</p>
]]></description><pubDate>Wed, 12 Aug 2026 19:01:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=49277068</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49277068</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49277068</guid></item><item><title><![CDATA[New comment by derefr in "Show HN: Needle2: 14MB agentic LLM for phones, wearables, smart home and robots"]]></title><description><![CDATA[
<p>> Like, what does a 28MB binary get you?<p>For one thing, on beefy-enough recent CPUs, you could keep the weights hot in the L2 cache of a single CPU core. (Which is clearly not the use-case, but might be interesting to those looking for extreme TPS numbers. Or perhaps for efficient training!)</p>
]]></description><pubDate>Tue, 11 Aug 2026 20:17:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=49263847</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49263847</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49263847</guid></item><item><title><![CDATA[New comment by derefr in "The US tried to stop cartel money-laundering; devastated mom-and-pop businesses"]]></title><description><![CDATA[
<p>@dang is there a mechanism to indicate that I think a post itself is okay, but that the entire comments section attached to it should be nuked from orbit? Are we supposed to flag the post in this case?</p>
]]></description><pubDate>Tue, 11 Aug 2026 20:11:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=49263765</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49263765</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49263765</guid></item><item><title><![CDATA[New comment by derefr in "How Claude marks AI-generated content"]]></title><description><![CDATA[
<p>> How unique could the LLM possibly make it while still retaining its usefulness?<p>They could be doing invisible and vaguely-harmless Unicode stuff. Insertion of zero-width joiners and non-joiners, replacement of regular spaces with non-breaking spaces, building spaces from multiple hairline spaces, intentional use of non-NFC-normalized codepoint sequences for accented characters, etc.<p>Text with all this junk in it still reads the same; it just might wrap a little strangely, or not byte-match / collate correctly in a database (and Anthropic has never made a guarantee that their models would be capable of emitting text with these properties, so that’s fine.)<p>And, importantly, no regular text or document editor would insert these things (especially in the useless places you could insert them for watermarking.) You only really see them in text that’s been explicitly typeset for a specific layout (e.g. in text-containing SVGs, website mastheads, or game HUDs) or for print publication.<p>Of course, if this <i>is</i> the technique they end up using, then it’s very simple to strip it out by canonicalizing the text (i.e. Unicode-normalizing it + stripping out invisible layout characters + replacing “weird spaces” with regular ones, etc. Essentially the same thing many sites already do to user-generated content to prevent users from using Unicode features to break the page’s layout.</p>
]]></description><pubDate>Tue, 11 Aug 2026 19:51:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=49263514</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49263514</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49263514</guid></item><item><title><![CDATA[New comment by derefr in "Rust SIMD on the GPU"]]></title><description><![CDATA[
<p>From how I understand it, there'd likely only be a single SIMD function impl per uarch that'd actually be fully legally executable without hitting undefined instructions. Plus increasingly-more-generic function impls compiled for lower and lower common-denominator subsets of SIMD functionality. (Ultimately grounding in a non-SIMD impl.)<p>If that's the case, then the selection logic would be trivial: figure out the full hierarchical ID of the uarch you're running on, then search for the longest prefix match in the table of available impls.<p>If things work more like you're imagining, though, then I suppose the process-boot impl-selector would narrow down the impl matrix to just the subset that are legal on the running uarch; pick one arbitrarily to be active at first; and then wrap the calls in a handler that gradually re-works the called function in a way reminiscent of a profile-guided JIT, but without the need to actually synthesize any code at runtime — instead, it'd just be a multi-armed bandit passing-through-to and re-ranking competitor impls, with decreasing sampling of the non-first-ranked impls as confidence-in-score-separation increases.</p>
]]></description><pubDate>Tue, 11 Aug 2026 06:19:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=49254033</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49254033</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49254033</guid></item><item><title><![CDATA[New comment by derefr in "Rust SIMD on the GPU"]]></title><description><![CDATA[
<p>Only if the end-user is the one compiling the software, on the same very system they'll be running it on. Which is true of GPU shader kernels, due to how GPU drivers work; but isn't generally true of CPU object code (unless you're on Gentoo.)<p>What you'd actually want is a matrix of variant implementations burned into the binary, with runtime (or process-boot-time) hardware detection that swaps symbols out to point to the correct variant.</p>
]]></description><pubDate>Mon, 10 Aug 2026 23:56:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=49251496</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49251496</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49251496</guid></item><item><title><![CDATA[New comment by derefr in "Exploring Claude/GPT Knowledge Cutoffs and Pre-Training Timelines"]]></title><description><![CDATA[
<p>That's an good answer to the question when taken in strict terms of a model version = weights.<p>But, insofar as:<p>1. "a model" as presented to the user, <i>isn't</i> just its weights, but also anything else happening on the "business layer" (though this maybe applies more to ChatGPT than "direct" model access via the API); and<p>2. said business layer has any "knowledge base"-type stuff going on in it (i.e. automatic or tool-call-triggered embedding of results from search of some vector-DB into which has been embedded distilled pre-validated trustworthy info — like per-user memory mechanisms, but searching + injecting from global shared data sources); and<p>3. said "knowledge base" mechanisms are where most of the up-to-date, fast-changing info a model "knows" (without having to do a web search) is actually coming from;<p>...then do y'all ever update the pinned knowledge-base data snapshot associated with the model version, without updating the weights themselves?</p>
]]></description><pubDate>Mon, 10 Aug 2026 22:28:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=49250740</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49250740</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49250740</guid></item><item><title><![CDATA[New comment by derefr in "In Japan, 'calf hair harassment' exposes gender-based appearance conflicts"]]></title><description><![CDATA[
<p>This and <a href="https://en.wikipedia.org/wiki/Paris_syndrome" rel="nofollow">https://en.wikipedia.org/wiki/Paris_syndrome</a> make me feel like Japanese culture has somehow induced a unique kind of coddling within their population. People there seem to build up severely idealized views on many different things, to which the real-world equivalents can never live up; and then they are then either repeatedly disappointed/frustrated/disgusted by reality, or they refuse to engage with the real versions of things altogether, holding out for the impossible ideal.<p>(And, for however much of this effect is accidental, there are also parts of it which are maintained consciously/intentionally by the population and cultural institutions. Consider, for example, the Japanese public's idealized view of musical-performer "idols" as being "pure" [i.e. never being in romantic relationships.] This isn't <i>just</i> a mistaken idealized assumption that garners disappointment when corrected by reality; it garners actual backlash toward idols violating the assumption, often so widespread and vicious that the performers are effectively forced out of the industry. Which has caused the idols' production companies to effectively require their talent stays single [or at least hides their relationships from the public] — making what was originally a mistaken idealized assumption into a social-norm-enforced truth.)</p>
]]></description><pubDate>Mon, 10 Aug 2026 21:57:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=49250345</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49250345</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49250345</guid></item><item><title><![CDATA[New comment by derefr in "Tail-call optimization in C is relatively recent (2025)"]]></title><description><![CDATA[
<p>I think the problem with considering it a "pure optimization" is that code that is written to use tail-calls, if <i>not</i> optimized, is almost always <i>unbounded</i> recursive code. And modern OSes tend to have relatively small stack-size limits (relative to the kinds of huge data structures modern software slings around, incl. not only individually-"wide" structures, but also "deep" trees and graphs.)<p>Which means that "whether this naively-recursive code is actually recursive in practice" is a <i>semantic</i> difference, in that there is an error/failure-mode (stack overflow) that can be statically guaranteed to <i>not</i> happen (at least for a given compilation target) if TCO gets applied; but which <i>cannot</i> be guaranteed to not happen <i>without</i> TCO applied.<p>---<p>Tangent: you could of course try to write code defensively, to guarantee that a stack overflow won't occur, by bounding recursion separately (e.g. via a passed-and-decremented recursion-limit parameter), so that in the non-TCO case, you get a software exception thrown (which you'd hopefully then handle... somehow), rather than triggering a stack overflow.<p>And for many more-traditional recursive algorithms, this works!<p>But doing so for the types of algorithms that are "canonically" expressed in terms of tail-calls (even in a non-tail-call-idiomatic language like C), almost always requires poking holes in the C abstract machine to see through to the micro-architectural details underneath.<p>You can't just use something like a recursion-limit parameter as a general solution for these algorithms, as TCO is used in things like continuation-passing or threaded-code VM implementations — i.e. things that look less like visiting trees and more like visiting unboundedly-non-terminal <i>infinite</i>-state-machine states ["infinite" because the states are dynamic function pointers to JITted code, and more of them can appear at runtime.]<p>You need to <i>not</i> track the "number of invocations deep" you are into the algorithm, but rather, <i>how big the stack actually is at the moment</i>. Which means you need to actually do math on addresses of the stack base pointer vs either the stack pointer, or the address of a local stack-allocated variable. There's no version of that that doesn't require writing non-portable inline assembly.</p>
]]></description><pubDate>Mon, 10 Aug 2026 19:10:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=49248277</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49248277</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49248277</guid></item><item><title><![CDATA[New comment by derefr in "Mistral Patent for “Code implemented tool calls”"]]></title><description><![CDATA[
<p>I think what GP is saying is that, upon Fraunhofer's licensing of their technologies to Thomson, Thomson demanded (perhaps contractually) that Fraunhofer defend their patents so that Thomson could actually "get something" for having licensed those patents.<p>This is pretty common when a company <i>exclusively</i> licenses a patent: they demand that the patent holder sue anyone using the tech who isn't them, so that they actually benefit in the market from the exclusivity. Without that enforcement, the money they were paying for exclusivity would be for nothing.<p>Thomson just made this kind of arrangement in the context of a non-exclusive license — getting Fraunhofer to start legally enforcing their patent rights at all, so that Thomson <i>and</i> whoever else licenses Fraunhofer's patents could benefit in the market from having licensed the patents, by ensuring that non-licensees aren't getting to use the patented tech for free.<p>In the US, such an arrangement is unnecessary (to the point that it might be causing a miscommunication in this conversation!), since patent holders tend to legally protect their patents all on their own, suing non-licensees for use of the patented tech even when there are no licensees demanding to "get the benefit they paid for." In Europe, patents aren't sued over by default, with enforcement instead only beginning when the patent is licensed and the licensee demands enforcement so that they can benefit.</p>
]]></description><pubDate>Mon, 10 Aug 2026 18:45:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=49247921</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49247921</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49247921</guid></item><item><title><![CDATA[New comment by derefr in "Show HN: Ante, a coding agent in a single binary that runs offline"]]></title><description><![CDATA[
<p>"A game" is a different abstraction layer from "a piece of software", though. A game has designed mechanics, a scenario (level design, etc.), art/music assets, writing, and so on. I would say that if you're making all of <i>those</i> things yourself, but you're having an AI write the software that executes the game, then you're still "building a game" per se. "Developing a game" even.<p>Compare/contrast: people who develop games on top of high-level genre-specific game engines like RPG Maker are still considered to be "building a game." What's the difference between using a pre-made purpose-fit engine like RPG Maker, vs. asking an AI (or, for that matter, a contracted software company) to build you a custom purpose-fit engine?</p>
]]></description><pubDate>Mon, 10 Aug 2026 18:15:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=49247522</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49247522</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49247522</guid></item><item><title><![CDATA[New comment by derefr in "Study links GLP-1 drugs to bigger jump in women's employment than a degree"]]></title><description><![CDATA[
<p>I would point out that there's a middle way between those stances: GLP-1 receptor agonism has anti-auto-immune effects.<p>(I don't know yet if anyone has determined whether this is a direct effect of GLP-1R agonism; or whether e.g. metabolic disorder has auto-immune aspects, and GLP-1R agonism effectively treats metabolic disorder; or whether it's just that e.g. sugar and other simple carbs are directly pro-auto-immune, and GLP-1R agonism breaks the addictive salience of sugars/simple carbs in such a way that even if you're eating the same amount, you're putting less of those in your body. Regardless of the mechanism, there does seem to be a consensus on the overall anti-auto-immune effect itself.)<p>The anti-auto-immune effects of GLP-1RAs show up visibly, e.g. on the face, entirely separately from the effects of weight loss (because this effect still occurs even when the dose of GLP-1RAs is too low to provoke weight loss), in the form of decreased puffiness, oiliness, acne, chapped lips, etc. It causes a bunch of small changes that make someone look like they're "taking better care of themselves" (even though they may have been taking assiduous care of themselves before, but didn't look it, for autoimmune reasons.) People definitely judge others on how "healthy" they look, so this could definitely help someone to get a job.<p>But the anti-auto-immune effects of GLP-1RAs <i>also</i> show up in <i>entirely unconscious</i> behavioral changes — not in anything cognitive, like "confidence", but rather due to GLP-1RAs being at least partly effective in treating chronic, sometimes-subclinical, usually-not-well-managed autoimmune pain disorders (think fibromyalgia) and autoimmune energy disorders (think ME-CFS.) Being less achey and having more energy makes people behave differently — whether that be on the macro level in subconscious decision-making (think of how people make different choices when overtired without being aware of it — people with chronic energy disorders are "overtired" 100% of the time!), or on the micro level, in terms of how e.g. speech is performed (people have reported becoming less "croaky", and their usable vocal range expanding), how nonverbal communication is performed (it's easier and "cheaper" to move your face and head and body, so you do), etc.<p>And note how, for these behavioral changes, some of these might be obvious to the person going through the changes (like your voice changing); but others are things you may not be aware has changed.<p>For facial expressions in particular, people learn to use their face in certain expressive ways when they're young, and then often don't notice when their face stops "responding" fully/correctly/in the way they'd anticipate to their brain's commands to execute these expressions. As far as <i>you're</i> concerned, you're doing what you always did; it's just that, at some point, you developed an autoimmune condition that attacked (or plugged up with waste) some nerves or muscles or tissues or whatever, that made those higher-level signals from your motor cortex stop translating perfectly to actually initiating the actions you expected. Most people don't periodically test their facial expressions in a mirror, so you only get info about the breakdown of these capabilities reflected in other people's reactions toward you changing. And, likewise, if these capabilities were to be suddenly <i>restored</i>, you'd only find out through others' reactions to you as well!</p>
]]></description><pubDate>Mon, 10 Aug 2026 17:38:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=49247021</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49247021</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49247021</guid></item><item><title><![CDATA[New comment by derefr in "_for-sale DNS records"]]></title><description><![CDATA[
<p>> If you are willing to sell, the interested buyer has no way to learn that short of a cold email to a WHOIS contact that privacy redaction has probably removed.<p>Has everybody forgotten about well-known email alias addresses? Inquiries about the hostname itself would be (among other things) exactly what `hostmaster@domain` was intended as a point-of-contact for. No need for a working WHOIS service, let alone a non-privacy-redacted WHOIS record.</p>
]]></description><pubDate>Sun, 09 Aug 2026 02:27:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=49227846</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49227846</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49227846</guid></item><item><title><![CDATA[New comment by derefr in "Autoregressive Language Model on the 6502 Processor"]]></title><description><![CDATA[
<p>> The model weights and inference code need to be contained within 25KB of user-space memory<p>Wouldn’t it be era-appropriate to allow relying on banked memory? You’d still need to hold the inference code, but you could effectively stream(ing page) the weights as you compute on them.</p>
]]></description><pubDate>Mon, 03 Aug 2026 01:05:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=49150070</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49150070</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49150070</guid></item><item><title><![CDATA[New comment by derefr in "Show HN: Kakehashi – Experimental userspace to run macOS binaries on Linux ARM"]]></title><description><![CDATA[
<p>If you didn't care about having a fully-redistributable image, but were okay with doing things more like modern old-console-game decompilation projects do (where compiling the project requires the original game ROM as an input), would a project like this be more trivial?<p>I.e. how hard would it be, comparatively, to design a virtualization <i>framework</i> that doesn't actually ship with any ground-up-rewritten <i>libraries</i>, but instead just expects to execute the binary in question in the context of a full rootfs copied over from a "real" macOS install?</p>
]]></description><pubDate>Sun, 02 Aug 2026 19:09:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=49147354</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49147354</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49147354</guid></item><item><title><![CDATA[New comment by derefr in "Linux on ESP32"]]></title><description><![CDATA[
<p>You wouldn’t be able to guarantee execution of arbitrary ELF, but couldn’t you intentionally build non-PIC-compiled ELF executables where the section base addresses as defined in the header must match the MMU region “slots” the host provides?</p>
]]></description><pubDate>Sat, 01 Aug 2026 19:08:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=49137400</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49137400</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49137400</guid></item><item><title><![CDATA[New comment by derefr in "A Surveillance Treaty in Disguise: Canada Signs UN Cybercrime Convention"]]></title><description><![CDATA[
<p>I could imagine true WYSIWYG politics, but it would need a very different temporal organizational structure than current politics.<p>Currwntly, politicians each have a series of meetings over time with different parties (constituents, lobbyists, domain experts, coalition members) and then at some point one of them drafts and tables a law (that's probably already been informally planned for ages among those in the know) and others vote for it (where many of those votes have probably also been informally pre-arranged for ages.)<p>To get WYSIWYG, every bit of all of those meetings would need to occur in the open. And likely the only way to practically accomplish that, in a “nothing up my sleeve” manner (i.e. to guarantee that there were no meetings outside of the official ones), would be to have all those meetings occur <i>contiguously</i> as part of one long recorded session in one place, with everyone who wants “a seat at the table” needing to operate on that session’s schedule; and where the politicians involved (i.e. those everyone else is there to influence) have a political career that starts and ends with that single session.<p>In other words, basically do the papal-election thing, or the sequestered-jury-trial thing: lock all the concerned parties (politicians + PAC leaders + lobbyists + etc) in a building together, and don’t let them out until they make a year’s worth of law. (But unlike either of those—record everything! Don’t allow any two people to be in the same room together without a camera.)</p>
]]></description><pubDate>Sat, 01 Aug 2026 18:47:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=49137200</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49137200</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49137200</guid></item><item><title><![CDATA[New comment by derefr in "The Art of 64-bit Assembly"]]></title><description><![CDATA[
<p>Is that with or without the LLM being able to assemble + profile its hypotheses itself? Because “optimize this code to execute in fewer CPU cycles under the test harness” seems like one of those perfect self-contained problems for LLMs (their equivalent of an “embarrassingly parallel problem”: an “embarrassingly-easily-explored solution space with embarrassingly-easily-measured objective success criteria.”)<p>Sure, they might make all sorts of dumb hypotheses at first, but as long as the results of those stay in their context, they do seem to eventually “run out of ways to be stupid.” (Which is to say, LLMs seem to experience in-context learning even via self-directed trial-and-error, if given a sufficiently-large number of iterations and no way to cheat.)</p>
]]></description><pubDate>Sat, 01 Aug 2026 18:33:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=49137072</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49137072</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49137072</guid></item><item><title><![CDATA[New comment by derefr in "Google fixed more Chrome bugs in June than over the past two years, thanks to AI"]]></title><description><![CDATA[
<p>An agent doesn’t know what “job” it’s being asked to do until you tell it.<p>Imagine you’re blind and deaf and have temporary retrograde amnesia. You “wake up” one moment with a memory of some words in your head like “what is the bug?” …but you don’t recall the <i>context</i> of that question, and nor can you look/listen around to observe the context.<p>So you don’t know whether you’re e.g. at the office, in front of your computer, in the middle of doing some pair-programming (where, yes, you’d in investigate the bug thoroughly with tools), vs. having a conversation with a colleague over lunch (where the expectation is for you to tap into your knowledge + intuitions to either guess or say you don’t know — not to pull out your laptop.<p>That’s what it’s like to be one of these LLMs being prompted by some agent harness. Unless the harness injects the proper context into its “recent memory”, it just doesn’t know.</p>
]]></description><pubDate>Fri, 31 Jul 2026 16:10:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=49124967</link><dc:creator>derefr</dc:creator><comments>https://news.ycombinator.com/item?id=49124967</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49124967</guid></item></channel></rss>