<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: RandomBK</title><link>https://news.ycombinator.com/user?id=RandomBK</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 10 Oct 2026 23:18:04 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=RandomBK" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by RandomBK in "Show HN: GlassBox – what the browser reveals, and how identifiable you are"]]></title><description><![CDATA[
<p>It's worth noting that you need both uniqueness and some form of stability. If you consistently show up as a diffent fingerprint every time you visit or for every different site, then that is a form of privacy as well.</p>
]]></description><pubDate>Mon, 24 Aug 2026 17:53:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=49423499</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=49423499</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49423499</guid></item><item><title><![CDATA[New comment by RandomBK in "Incremental – A library for incremental computations"]]></title><description><![CDATA[
<p>Laziness and weak connections makes sense as differentiators.<p>However I'm not sure Excel is such a great illustration in that case, as it's neither lazy nor weakly connected; at least at the surface.</p>
]]></description><pubDate>Tue, 21 Jul 2026 06:10:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=48988667</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=48988667</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48988667</guid></item><item><title><![CDATA[New comment by RandomBK in "Incremental – A library for incremental computations"]]></title><description><![CDATA[
<p>One thing I've never fully grokked is how this differs from an observable pattern where one can publish new values to inputs, propagate that through the computation, and push newly computed values to listeners.<p>I guess there's probably optimizations around change detection and stopping the propagation if there's no change (though observables can do that as well). The stabilize command also makes things interesting as a way to batch changes together before recomputing (but again, doable with observables too).<p>Is the delta primarily coming from introspection and automatically building the compute graph? Or is there something more fundamental that I'm missing?</p>
]]></description><pubDate>Tue, 21 Jul 2026 04:54:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=48988187</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=48988187</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48988187</guid></item><item><title><![CDATA[New comment by RandomBK in "Show HN: Low-latency local LLM runner via OpenJDK Panama FFM (Java 22)"]]></title><description><![CDATA[
<p>I'm curious to hear what bottlenecks you encountered in the traditional path. Of all the compute and data shuffling involved in LLM inference, I would have thought shuffling the raw input/output around would have been a trivial part of the overall cost, and thus not a big optimization target?</p>
]]></description><pubDate>Wed, 15 Jul 2026 23:13:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=48928436</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=48928436</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48928436</guid></item><item><title><![CDATA[New comment by RandomBK in "Gradle Is Javamaxxing"]]></title><description><![CDATA[
<p>As someone who uses gradle largely out of inertia, I'm curious what you would pick as a better alternative.</p>
]]></description><pubDate>Thu, 28 May 2026 20:32:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=48315048</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=48315048</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48315048</guid></item><item><title><![CDATA[New comment by RandomBK in "The user is visibly frustrated"]]></title><description><![CDATA[
<p>I've found swearing at a model to be quite effective in getting it to rethink and correct its mistakes. This seems to apply across Codex, Claude, Qwen, and Gemma/Gemini.<p>I don't know if the model is picking up on a "need to lock in and be more rigorous" signal, or if the model providers are routing to smarter models if they detect a frustrated user. But if a model keeps making the same mistakes, swearing at it often helped kick it out of a glut and onto the right track.<p>Or it could just be catharsis.</p>
]]></description><pubDate>Tue, 26 May 2026 07:01:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=48276112</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=48276112</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48276112</guid></item><item><title><![CDATA[New comment by RandomBK in "δ-mem: Efficient Online Memory for Large Language Models"]]></title><description><![CDATA[
<p>> context with 2.1 bits of entropy per token<p>Can you elaborate on this? I'm seen estimates of ~1.5bit per English <i>letter</i>, and tokens encode a lot more than that - sometimes full words, with multimodal even more. If KV cache embedding are storing more than just simple tokens but entire concepts with context and nuance, that'll bump the entropy up quite quickly.</p>
]]></description><pubDate>Sun, 17 May 2026 04:40:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=48166087</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=48166087</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48166087</guid></item><item><title><![CDATA[New comment by RandomBK in "I am building a cloud"]]></title><description><![CDATA[
<p>VPS comes at the cost of potential for oversubscription - even from more reputable vendors. You never really know if you're actually getting what you're paying for.</p>
]]></description><pubDate>Thu, 23 Apr 2026 09:04:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=47873618</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=47873618</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47873618</guid></item><item><title><![CDATA[New comment by RandomBK in "I am building a cloud"]]></title><description><![CDATA[
<p>One annoyance (I don't know if they've since fixed it) was that Docker Hub would count pulls that don't contain an update towards the rate limit. That ultimately prompted me to switch to alternate repositories.</p>
]]></description><pubDate>Thu, 23 Apr 2026 09:01:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=47873595</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=47873595</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47873595</guid></item><item><title><![CDATA[New comment by RandomBK in "Why XML tags are so fundamental to Claude"]]></title><description><![CDATA[
<p>How well do we understand the tokenization for Claude? I'd posit that the exact human-representation of this markup is likely irrelevant if it's all being converted into a single token.</p>
]]></description><pubDate>Mon, 02 Mar 2026 08:00:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=47215068</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=47215068</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47215068</guid></item><item><title><![CDATA[New comment by RandomBK in "The Cost of a Function Call"]]></title><description><![CDATA[
<p>Code length will itself become a problem. The instruction cache is limited in size and often quite small. Bloating instruction counts with lots of duplicated code will eventually have a negative effect on performance.<p>Ultimately, there's too many factors to predetermine which approach is faster. Write clean code, and let a profiler guide optimizations when needed.</p>
]]></description><pubDate>Mon, 09 Feb 2026 09:47:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=46943468</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=46943468</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46943468</guid></item><item><title><![CDATA[New comment by RandomBK in "Claude Shannon's randomness-guessing machine"]]></title><description><![CDATA[
<p>Additionally, so long as we can be sure the human's output is not <i>actively adversarial</i>, we can xor it into the entropy pool. Entropy can only increase this way.</p>
]]></description><pubDate>Sun, 18 Jan 2026 08:47:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=46666022</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=46666022</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46666022</guid></item><item><title><![CDATA[New comment by RandomBK in "Outside, Dungeon, Town: Integrating the Three Places in Videogames (2024)"]]></title><description><![CDATA[
<p>I'm reminded of a diagram from the pitch doc for the original Diablo [0] that made its rounds across the web recently. The dungeon/town split was particularly sharp back then, but the broad design has stuck with modern ARPG design, either in the form of safe zones around town or explicit town zones.<p>A lot of this seems to be due to modern multiplayer design, with shared town instances and (usually) private dungeon/outside instances.<p>[0] <a href="https://www.gamedeveloper.com/business/here-s-a-look-at-the-original-design-pitch-document-for-i-diablo-i-" rel="nofollow">https://www.gamedeveloper.com/business/here-s-a-look-at-the-...</a> (scroll down)</p>
]]></description><pubDate>Tue, 30 Dec 2025 04:17:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=46429480</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=46429480</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46429480</guid></item><item><title><![CDATA[New comment by RandomBK in "Titan submersible’s $62 SanDisk memory card found undamaged at wreckage site"]]></title><description><![CDATA[
<p>Good catch; it was somewhat ambiguous in the report.</p>
]]></description><pubDate>Sat, 18 Oct 2025 22:59:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=45630976</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=45630976</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45630976</guid></item><item><title><![CDATA[New comment by RandomBK in "Titan submersible’s $62 SanDisk memory card found undamaged at wreckage site"]]></title><description><![CDATA[
<p>I see a lot of discussion in this thread stemming from some confusion+not reading the actual report[0].<p>Some key points:<p>1. The Camera+Card was encased in a separate enclosure made of titanium+sapphire, and did not seem to be exposed to extreme pressures.<p>2. The encryption was done via a variant of LUKS/dm-crypt, with the key stored on the NVRAM of a chip (Edited; not in TrustZone).<p>3. The recovery was done by transplanting the original chip onto a new working board. No manufacturer backdoors or other hidden mechanisms were used.<p>4. Interestingly, the camera vendor didn't seem to realize there was any encryption at all.<p>[0] <a href="https://data.ntsb.gov/Docket/Document/docBLOB?ID=18741602&FileExtension=pdf&FileName=Underwater%20Camera%20-%20Specialist%27s%20Factual%20Report-Rel.pdf" rel="nofollow">https://data.ntsb.gov/Docket/Document/docBLOB?ID=18741602&Fi...</a></p>
]]></description><pubDate>Sat, 18 Oct 2025 21:39:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=45630550</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=45630550</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45630550</guid></item><item><title><![CDATA[New comment by RandomBK in "Google Safe Browsing incident"]]></title><description><![CDATA[
<p>> Getting on the public suffix list is easier said than done [1].<p>Can you elaborate on this? I didn't see anything in either link that would indicate unreasonable challenges. The PSL naturally has a a series of validation requirements, but I haven't heard of any undue shenanigans.<p>Is it great that such vital infrastructure is held together by a ragtag band of unpaid volunteers? No; but that's hardly unique in this space.</p>
]]></description><pubDate>Fri, 10 Oct 2025 23:08:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=45544854</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=45544854</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45544854</guid></item><item><title><![CDATA[Show HN: Open-source Voice Cloning at 16x real-time: Porting Chatterbox to vLLM]]></title><description><![CDATA[
<p>Chatterbox TTS from ResembleAI (<a href="https://github.com/resemble-ai/chatterbox">https://github.com/resemble-ai/chatterbox</a>) is one of the most accessible and highest-quality Voice Cloning models available today. However, its implementation via HF Transformers left a lot of performance on the table.<p>This is a pet project I've been building on-and-off. It ports the core of Chatterbox - a 0.5B Llama-architecture model - to vLLM. A lot of ugly hacks and workarounds were needed to make it work, but the end result <i>works</i>.<p>Outputting at around the same quality level as the original implementation, this port is roughly 5-10x faster, generating a 40min benchmark output in around 2min30s wall time on a 3090 (or 4m30s on a 3060ti). That's almost 16x faster than real-time.<p>High throughput like this can be itself transformative, enabling scale and efficiency that unblocks new use-cases. I look forward to seeing what the community can do with this!<p><i>Disclaimer: This is a personal community project not affiliated with ResembleAI, my employer, or any other entity. The project is based solely on publicly-available information. All opinions are my own and do not necessarily represent the views of my employer.</i></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44777452">https://news.ycombinator.com/item?id=44777452</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Sun, 03 Aug 2025 16:00:08 +0000</pubDate><link>https://github.com/randombk/chatterbox-vllm</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=44777452</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44777452</guid></item><item><title><![CDATA[New comment by RandomBK in "Low-background Steel: content without AI contamination"]]></title><description><![CDATA[
<p>My 2c is that it <i>is</i> worthwhile to train on AI generated content that has obtained some level of human approval or interest, as a form of extended RLHF loop.</p>
]]></description><pubDate>Tue, 10 Jun 2025 22:16:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=44242089</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=44242089</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44242089</guid></item><item><title><![CDATA[New comment by RandomBK in "Pyrefly vs. Ty: Comparing Python's two new Rust-based type checkers"]]></title><description><![CDATA[
<p>It reminds me of the early days of Typescript rollout, which similarly focused on a smooth on-boarding path for existing large projects.<p>More restrictive requirements (ie `noImplicitAny`) could be turned on one at a time before eventually flipping the `strict` switch to opt in to all the checks.</p>
]]></description><pubDate>Tue, 27 May 2025 16:34:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=44108503</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=44108503</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44108503</guid></item><item><title><![CDATA[Show HN: Kernel-level LLM inference via /dev/llm0]]></title><description><![CDATA[
<p>I saw an April Fools joke and decided to implement it.<p>This is a rough port of llm.c into a kernel module. A lot of hacks were needed to make this happen, so a <i>lot</i> of performance was left on the table. Nevertheless, it is a minimally functional GPT2 inference loop running in the kernel.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=43558042">https://news.ycombinator.com/item?id=43558042</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 02 Apr 2025 15:49:06 +0000</pubDate><link>https://github.com/randombk/kllm</link><dc:creator>RandomBK</dc:creator><comments>https://news.ycombinator.com/item?id=43558042</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43558042</guid></item></channel></rss>