<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: gpugreg</title><link>https://news.ycombinator.com/user?id=gpugreg</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 31 Aug 2026 09:40:03 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=gpugreg" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by gpugreg in "Hy4 preview"]]></title><description><![CDATA[
<p>Not <i>all</i> their research, but certainly a lot: <a href="https://github.com/orgs/deepseek-ai/repositories?q=sort%3Astars" rel="nofollow">https://github.com/orgs/deepseek-ai/repositories?q=sort%3Ast...</a></p>
]]></description><pubDate>Sun, 30 Aug 2026 15:49:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=49499771</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49499771</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49499771</guid></item><item><title><![CDATA[New comment by gpugreg in "Time complexity of operations on Python's built-in types"]]></title><description><![CDATA[
<p>I could have used more precise terminology. rfind is <i>average case</i> O(n + m), <i>worst case</i> O(n * m). Imho the worst case performance is more important than the average case performance, since it tells us whether there is any risk for attacks like Hash DoS, which is the reason why Python's dict hashing had to be changed. <a href="https://peps.python.org/pep-0456/" rel="nofollow">https://peps.python.org/pep-0456/</a></p>
]]></description><pubDate>Sat, 29 Aug 2026 18:54:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=49492301</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49492301</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49492301</guid></item><item><title><![CDATA[New comment by gpugreg in "Time complexity of operations on Python's built-in types"]]></title><description><![CDATA[
<p>Because the use case is very niche and nobody optimized it yet.<p><a href="https://github.com/python/cpython/issues/135824#issuecomment-2994405973" rel="nofollow">https://github.com/python/cpython/issues/135824#issuecomment...</a><p>`x in range(n)` is already optimized, but that was easier since the `__contains__` method already existed, but an equivalent `__min__` or `__max__` does not.</p>
]]></description><pubDate>Sat, 29 Aug 2026 11:19:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=49488973</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49488973</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49488973</guid></item><item><title><![CDATA[New comment by gpugreg in "Time complexity of operations on Python's built-in types"]]></title><description><![CDATA[
<p>Notable pitfalls:<p>- s[i:j] is O(j - i) because it creates a copy instead of a view<p>- max(range(n)) is O(n)<p>- substring search is O(n), which is good, but rfind is O(n m)<p>- iterative string concatenation (for c in ...: s += c) can be O(n^2) due to string immutability according to footnote 10, although it is O(n) in most cases due to an implementation detail of CPython: <a href="https://stackoverflow.com/a/34008199" rel="nofollow">https://stackoverflow.com/a/34008199</a></p>
]]></description><pubDate>Sat, 29 Aug 2026 11:02:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=49488867</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49488867</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49488867</guid></item><item><title><![CDATA[New comment by gpugreg in "Helsinki Hacker News Meetup"]]></title><description><![CDATA[
<p>Sure! But where?</p>
]]></description><pubDate>Wed, 05 Aug 2026 11:29:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=49181339</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49181339</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49181339</guid></item><item><title><![CDATA[New comment by gpugreg in "DeepSeek V4 Flash on a Single AMD MI300X"]]></title><description><![CDATA[
<p>To learn about sentiment analysis, I'd look for related datasets and then look at recent code, e.g. here: <a href="https://www.kaggle.com/datasets?search=sentiment+analysis" rel="nofollow">https://www.kaggle.com/datasets?search=sentiment+analysis</a><p>For more LLM-specific stuff, you can pick some agent trace dataset on <a href="https://huggingface.co/datasets?format=format%3Aagent-traces" rel="nofollow">https://huggingface.co/datasets?format=format%3Aagent-traces</a> and check out what people are doing with it (usually linked on the right when you click on a dataset).<p>And of course <a href="https://scholar.google.com/" rel="nofollow">https://scholar.google.com/</a> for research papers.</p>
]]></description><pubDate>Wed, 05 Aug 2026 11:24:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=49181287</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49181287</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49181287</guid></item><item><title><![CDATA[New comment by gpugreg in "DeepSeek V4 Flash on a Single AMD MI300X"]]></title><description><![CDATA[
<p>Agents usually start with ingesting the existing code base, and DeepSeek can use those code bases for pretraining. And they will have filters on top of that to throw out garbage.<p>I am not sure how they are using the data for post-training, but there probably are ways to get signal out of it, e.g. sentiment analysis when the user begins cursing at the agent, or checking whether the user continued another session with the generated code, or started a new session with the same starting point as before, i.e. they git-stashed.<p>Generally, you can train on data that is quite bad (e.g. the entire internet). It will still work, but take much longer compared to clean data.</p>
]]></description><pubDate>Tue, 04 Aug 2026 15:20:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=49170235</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49170235</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49170235</guid></item><item><title><![CDATA[New comment by gpugreg in "DeepSeek V4 Flash on a Single AMD MI300X"]]></title><description><![CDATA[
<p>Oh, I messed up. Half-way through, I thought it would be a good idea to double the numbers so I don't have to deal with half millions, but forgot to also double the 98.5. Unfortunately, I can not edit it anymore.<p>I think the margins of DeepSeek may be a bit better than with this vibe-coded framework here, since they had the liberty of optimizing their models for their own hardware.<p>For DeepSeek V3, they claimed a cost profit margin of 545%: <a href="https://github.com/deepseek-ai/open-infra-index/blob/main/202502OpenSourceWeek/day_6_one_more_thing_deepseekV3R1_inference_system_overview.md" rel="nofollow">https://github.com/deepseek-ai/open-infra-index/blob/main/20...</a><p>At the time, open frameworks were not anywhere close to achieving that number. Not sure whether they caught up. The software wizards at DeepSeek are quite skilled.</p>
]]></description><pubDate>Tue, 04 Aug 2026 15:09:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=49170056</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49170056</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49170056</guid></item><item><title><![CDATA[New comment by gpugreg in "DeepSeek V4 Flash on a Single AMD MI300X"]]></title><description><![CDATA[
<p>Agentic workloads are somewhere around 1%/0.5%/98.5% input/output/cached tokens. Cached tokens are pretty much free for inference providers (if they implement sparse and compressed attention properly) and throughput for input tokens is much higher.<p>Lets assume that you've got 2 million input tokens, 1 million output tokens and 98.5 million cached tokens to process. That would cost 2 * $0.14 + 1 * $0.28 + 98.5 * $0.0028 = $0.8358 with DeepSeek API pricing.<p>For comparison, it would take 2M / 8000 + 1M / 800 = 1500 seconds to process this amount of tokens with the linked framework, which is about $0.83 when we assume $2/hr for one MI300X.<p>However, other inference providers have 10 times higher prices for cached tokens, which results in a comfortable margin.<p>And we should not discount that DeepSeek also gets paid in data, which is probably more valuable to them.<p>And I believe that this framework still has some room for optimization for generation with high batch sizes.</p>
]]></description><pubDate>Tue, 04 Aug 2026 12:08:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=49167533</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49167533</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49167533</guid></item><item><title><![CDATA[New comment by gpugreg in "Qwen3.8-Max: A New Bar for Coding and Cowork"]]></title><description><![CDATA[
<p>Personally, I prefer QDirStat. I just tried to use FileLight to compare, but the package seems to be broken on Lubuntu.</p>
]]></description><pubDate>Mon, 03 Aug 2026 13:47:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=49155763</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49155763</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49155763</guid></item><item><title><![CDATA[New comment by gpugreg in "Qwen3.8-Max: A New Bar for Coding and Cowork"]]></title><description><![CDATA[
<p>> you're having issues handling files properly?<p>I guess they were using ollama, which does not tell you where it puts the models it downloads.</p>
]]></description><pubDate>Mon, 03 Aug 2026 10:36:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=49153884</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49153884</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49153884</guid></item><item><title><![CDATA[New comment by gpugreg in "Turtle-inspired interactive Python project"]]></title><description><![CDATA[
<p>I get the following error:<p><pre><code>    Traceback (most recent call last):
      File "/app.py", line 1, in <module>
        import spider
    ModuleNotFoundError: No module named 'spider'
</code></pre>
Steps to reproduce:<p>1. Visit <a href="https://www.codembark.com/" rel="nofollow">https://www.codembark.com/</a><p>2. Click on "Start Coding Right Now"<p>3. Write "import spider" into app.py in the right panel<p>4. Click the Play button in the bottom middle panel.</p>
]]></description><pubDate>Sun, 02 Aug 2026 19:53:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=49147693</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49147693</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49147693</guid></item><item><title><![CDATA[New comment by gpugreg in "Running Kimi K3 on MI355X at Better Performance per Dollar Than B300"]]></title><description><![CDATA[
<p>I did not say that it is impossible. I just think that we need architectural improvements, or maybe even a fundamentally different approach to get something like Kimi K3 for cheap. The point I was trying to make was that we shouldn't just laze about and hope that hardware improvements will get us there.<p>(Also, I know Tom Jobbins (TheBloke), and have personally contributed to increase the adoption of GGUF, e.g. in the transformers and ktransformers libraries, so I find the personal dig quite amusing.)</p>
]]></description><pubDate>Sun, 02 Aug 2026 12:59:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=49144205</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49144205</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49144205</guid></item><item><title><![CDATA[New comment by gpugreg in "Running Kimi K3 on MI355X at Better Performance per Dollar Than B300"]]></title><description><![CDATA[
<p>Looks like global energy consumption has risen by an order of magnitude from 1900 to 2000: <a href="https://www.encyclopedie-energie.org/en/world-energy-consumption-1800-2000-results/#h3-1" rel="nofollow">https://www.encyclopedie-energie.org/en/world-energy-consump...</a><p>Unfortunately, electricity prices did not fall by the same factor, so I fear that training a frontier model will still cause a an unsustainable dent in my monthly budget.</p>
]]></description><pubDate>Sun, 02 Aug 2026 09:52:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=49142824</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49142824</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49142824</guid></item><item><title><![CDATA[New comment by gpugreg in "Running Kimi K3 on MI355X at Better Performance per Dollar Than B300"]]></title><description><![CDATA[
<p>> Some of us might be rich<p>I sure wish I had a few 100M of disposable income to train a frontier model.<p>> or in the future it could be useful when training is cheaper.<p>I do not think that physics will allow hardware getting that much faster. But maybe we will have different, cheaper architectures by then.</p>
]]></description><pubDate>Sun, 02 Aug 2026 09:15:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=49142616</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49142616</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49142616</guid></item><item><title><![CDATA[New comment by gpugreg in "Running Kimi K3 on MI355X at Better Performance per Dollar Than B300"]]></title><description><![CDATA[
<p>Where do you see less than $10/h for 8 * MI354X? I can only find $2.50 for 1 * MI355X (lowest I can find for rent on other websites is $2.65, but maybe they got a better deal).</p>
]]></description><pubDate>Sun, 02 Aug 2026 08:58:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=49142515</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49142515</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49142515</guid></item><item><title><![CDATA[New comment by gpugreg in "Moonshot’s Kimi uses 20k Nvidia chip cluster from Alibaba"]]></title><description><![CDATA[
<p>Notably, MXFP4 was introduced at the (much less costly) supervised fine-tuning stage <i>after</i> pretraining, so the number of B200/B300 GPUs could be relatively small in comparison to the number of H200 GPUs used during pretraining (or maybe not, who knows).<p>(Kimi K3 tech report section 4.1.1 <a href="https://arxiv.org/pdf/2607.24653" rel="nofollow">https://arxiv.org/pdf/2607.24653</a>)</p>
]]></description><pubDate>Fri, 31 Jul 2026 20:37:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=49128254</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49128254</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49128254</guid></item><item><title><![CDATA[New comment by gpugreg in "Moonshot’s Kimi uses 20k Nvidia chip cluster from Alibaba"]]></title><description><![CDATA[
<p>> they also mentioned only having a 20K GPU cluster (unclear if NVIDIA, or Huawei).<p>A few quotes from the transcript:<p>> Our current computing capacity is approximately 20,000 H-equivalent units, most of which have just arrived within the past month or two<p>> Regarding the Huawei 950, Huawei currently provides us with 16,000 SIM cards<p>> A Huawei 950 [cluster] with 16,000 cards is equivalent to only a B-series card [cluster] with 4,000 cards.</p>
]]></description><pubDate>Fri, 31 Jul 2026 16:12:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=49124995</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49124995</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49124995</guid></item><item><title><![CDATA[New comment by gpugreg in "DeepSeek-V4-Flash Update"]]></title><description><![CDATA[
<p>dax (coauthor) recently tweeted <a href="https://xcancel.com/thdxr/status/2083178051052155182" rel="nofollow">https://xcancel.com/thdxr/status/2083178051052155182</a><p>> because we added the new deepseek which we do not yet have a ZDR with we cannot blanket say we offer ZDR<p>I wonder how the website can make the statement that data will not be used for training.</p>
]]></description><pubDate>Fri, 31 Jul 2026 14:05:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=49123305</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49123305</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49123305</guid></item><item><title><![CDATA[New comment by gpugreg in "DeepSeek-V4-Flash Update"]]></title><description><![CDATA[
<p>The memory bandwidth of the 2x RTX Pro 6000 Blackwell setup will be 10x higher, which should have an equivalent effect on the generated tokens per second.</p>
]]></description><pubDate>Fri, 31 Jul 2026 10:44:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=49121467</link><dc:creator>gpugreg</dc:creator><comments>https://news.ycombinator.com/item?id=49121467</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49121467</guid></item></channel></rss>