<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: timmaxw</title><link>https://news.ycombinator.com/user?id=timmaxw</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 07 May 2026 00:16:14 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=timmaxw" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by timmaxw in "Design for 3D-Printing"]]></title><description><![CDATA[
<p>> Cut threads into printed parts with a thread tap for quick design of low-reuse joints.<p>I've found wood screws work well for this. The wood screw can cut its own threads without needing to use a tap.<p>It does put some stress on the part, though. I mostly print in PETG, which is strong enough; but PLA might split if the hole was parallel to the layers.<p>> A design limitation of threaded inserts is that they are not reliably usable for screws inserted from the back side. During insertion, heat-set inserts often push some molten plastic into the hole beneath them, preventing easy insertion of a screw from the back side.<p>A trick I sometimes use:<p>1. Before installing the insert, insert the screw from the back side<p>2. Screw the insert onto the protruding screw<p>3. Use a soldering iron to install the insert+screw together into the plastic<p>Because the screw is filling the hole, the molten plastic can't block the hole. Instead, the molten plastic forms itself around the screw, and it acts like a Nyloc nut.</p>
]]></description><pubDate>Sun, 04 May 2025 22:46:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=43890261</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=43890261</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43890261</guid></item><item><title><![CDATA[New comment by timmaxw in "Coder wrote a bug so bad security guards wanted a word when he arrived at work"]]></title><description><![CDATA[
<p>> refusing charge backs is too easy<p>That doesn't sound right...? Credit/debit card chargebacks are handled by the bank. If the merchant doesn't pick up the phone, the bank will take the money from the merchant and return it to the customer.<p><a href="https://www.usatoday.com/money/blueprint/credit-cards/credit-card-chargebacks/" rel="nofollow">https://www.usatoday.com/money/blueprint/credit-cards/credit...</a><p>Were you using a different payment system with fewer consumer protections than credit/debit cards?</p>
]]></description><pubDate>Mon, 16 Dec 2024 17:09:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=42432967</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=42432967</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42432967</guid></item><item><title><![CDATA[New comment by timmaxw in "Bankruptcy judge rejects sale of Infowars to The Onion"]]></title><description><![CDATA[
<p>> If someone owes you $1B and they owe me $2B, and they've got an asset worth $500M, I can't just pledge $2B of bad debt to buy the asset. The only fair way is to sell it for $500M in actual cash<p>No, that's not the _only_ fair way. Suppose the $2B creditor bids $200M in cash and also agrees to forfeit their share of the proceeds from the sale. Then the $1B creditor would receive the entire $200M, which is more than the $167M they would have received from a $500M cash sale. The bid is effectively equivalent to $600M.<p>Isn't that what happened in the InfoWars case? The bankruptcy judge agreed that the structure of the Onion's bid was valid; he just said the auction would have continued for more rounds.</p>
]]></description><pubDate>Wed, 11 Dec 2024 17:22:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=42390196</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=42390196</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42390196</guid></item><item><title><![CDATA[New comment by timmaxw in "Negative Temperature"]]></title><description><![CDATA[
<p>Here's an intuition that might help: Suppose we define β=1/T, the reciprocal of temperature. (See <a href="https://en.wikipedia.org/wiki/Thermodynamic_beta" rel="nofollow">https://en.wikipedia.org/wiki/Thermodynamic_beta</a>.) As a system gets hotter and hotter, T gets bigger and bigger, so β falls closer and closer to zero. If β falls past zero and becomes negative, then T will also be negative.<p>(Also: If T=0, then β would be undefined/infinity. This corresponds to the fact that absolute zero temperature is impossible. β is arguably a more natural way of thinking about temperature than T is.)</p>
]]></description><pubDate>Tue, 09 Jul 2024 03:55:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=40912407</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=40912407</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40912407</guid></item><item><title><![CDATA[New comment by timmaxw in "Medieval Bologna was full of tall towers"]]></title><description><![CDATA[
<p>Really? I zoomed in on the Towers of Bologna and then used the "measurement" tool to draw a 97m line on the ground. The line seems about as long as the tower is high. If you try that, do you get the same result?</p>
]]></description><pubDate>Sun, 26 May 2024 05:59:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=40480064</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=40480064</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40480064</guid></item><item><title><![CDATA[New comment by timmaxw in "Medieval Bologna was full of tall towers"]]></title><description><![CDATA[
<p>Note, those pictures depict the towers as about 5x bigger than they actually were.<p>To get a true sense of scale, here's the same view on Google Earth: <a href="https://earth.google.com/web/@44.48152905,11.33820409,94.60421062a,3857.75677249d,35y,-159.75723051h,84.72408363t,0r" rel="nofollow">https://earth.google.com/web/@44.48152905,11.33820409,94.604...</a> You can see the towers that are still standing. They visibly stick out from the shorter buildings, but they're nowhere near as big as in the picture.</p>
]]></description><pubDate>Sat, 25 May 2024 21:28:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=40478007</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=40478007</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40478007</guid></item><item><title><![CDATA[New comment by timmaxw in "Ask HN: C/C++ developer wanting to learn efficient Python"]]></title><description><![CDATA[
<p>Yes, Python dicts remember insertion order. This is different from C++ std::map, which maintains the keys in sorted order. For example, std::map::lower_bound(X) finds "the smallest key in the map which is greater than or equal to X" in O(log(N)) time. I don't think Python has any data structure in the standard library that supports this operation while also supporting insertion in O(log(N)) time.</p>
]]></description><pubDate>Wed, 10 Apr 2024 16:34:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=39992642</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=39992642</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39992642</guid></item><item><title><![CDATA[New comment by timmaxw in "Ask HN: C/C++ developer wanting to learn efficient Python"]]></title><description><![CDATA[
<p>In Python job interviews, I think the interviewer will only judge your code on asymptotic complexity, not absolute speed. I think Python engineers generally aren't expected to know how to micro-optimize their Python code.<p>Some general tips for algorithmic complexity in Python:<p>- Python's list is equivalent to C++ std::vector. If you need to push/pop at the head of the list, use Python's "collections.deque" to avoid the O(N) cost. Python's standard library doesn't have a linked list implementation.<p>- Python's dict is a fast unordered hashmap. However, if you need order-aware operations like C++'s std::map::lower_bound(), you're out of luck; Python's standard library doesn't have a tree implementation.<p>- Python has a "bisect" module for binary searching in a Python list, and a "heapq" module for using a Python list as a heap. However, neither one is nicely encapsulated in a data type.<p>If your Python program is seriously CPU-bound, the normal solution is to use a C/C++/Rust extension. For example, if you're doing large numeric calculations, use NumPy; it can store a vector of numbers as a single contiguous array, which is much faster than a list-of-Python-floats.<p>If you want to parallelize across CPU cores, it's important to understand the Python GIL (global interpreter lock). Often you need to use multiple Python processes. See e.g. <a href="https://superfastpython.com/multiprocessing-pool-gil/" rel="nofollow">https://superfastpython.com/multiprocessing-pool-gil/</a><p>Maybe also worth reading about __slots__ (<a href="https://wiki.python.org/moin/UsingSlots);" rel="nofollow">https://wiki.python.org/moin/UsingSlots);</a> it's a micro-optimization that helps when allocating a lot of tiny Python objects.<p>Hope some of that is helpful! Good luck with your job interviews.</p>
]]></description><pubDate>Wed, 10 Apr 2024 15:51:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=39992096</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=39992096</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39992096</guid></item><item><title><![CDATA[New comment by timmaxw in "Python datetime pitfalls, and what libraries are (not) doing about it"]]></title><description><![CDATA[
<p>Well done. It's horrifying that the Python standard library "+/-" operators don't handle DST correctly.</p>
]]></description><pubDate>Sun, 18 Feb 2024 17:50:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=39421229</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=39421229</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39421229</guid></item><item><title><![CDATA[New comment by timmaxw in "A journalist goes undercover to reveal the absurdity of the art scene"]]></title><description><![CDATA[
<p>> Non wealthy people are largely not willing to pay ... what it actually costs to make them<p>The general public pays enough money to pay the artists' salaries, plus the marketing budget and all the other costs. Otherwise Hollywood would go out of business.</p>
]]></description><pubDate>Wed, 31 Jan 2024 17:13:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=39206383</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=39206383</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39206383</guid></item><item><title><![CDATA[New comment by timmaxw in "A journalist goes undercover to reveal the absurdity of the art scene"]]></title><description><![CDATA[
<p>The reason people complain about "high art" is because we're told that everyone should aspire to appreciate high art, and that people who appreciate high art are somehow better than the general public, even though it's deliberately niche and opaque.<p>> There's an endless continuum libraries, languages, tools and machines out there which have trivial impact on the world but are absolute objects of beauty when you know what's inside.<p>Imagine if the SF MOMA were replaced with a museum full of those niche libraries and languages, showing these absolute objects of beauty to the general public, and (implicitly) saying "you ought to appreciate the beauty; if you can't appreciate e.g. the beauty of the Haskell programming language is, you're ignorant".</p>
]]></description><pubDate>Wed, 31 Jan 2024 17:08:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=39206303</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=39206303</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39206303</guid></item><item><title><![CDATA[New comment by timmaxw in "A journalist goes undercover to reveal the absurdity of the art scene"]]></title><description><![CDATA[
<p>The non-wealthy regularly pay for books, music, movies, video games, etc. Hollywood is a $40B/year industry. All these industries follow a model of "make a work of art, then sell infinite copies"; this makes it possible to sell the copies at reasonable prices. These prices are appropriate, and the non-wealthy pay them.<p>The "high art" world, on the other hand, fetishizes the original physical work of art. If an expert painter spends weeks on a painting, then they must sell it for enough money to cover "weeks of an expert's income"; so of course only wealthy people will be able to afford it. How is this price more "appropriate" than the prices that non-wealthy people pay?</p>
]]></description><pubDate>Wed, 31 Jan 2024 16:59:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=39206137</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=39206137</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39206137</guid></item><item><title><![CDATA[New comment by timmaxw in "'Energy independent' Uruguay runs on 100% renewables for four straight months"]]></title><description><![CDATA[
<p>If Uruguay can run on 100% renewable energy, the unstated implication is "The US could do it too, we just lack the political will". (As opposed to the idea that "Renewable energy is a genuinely hard problem that will take time, effort, and technological advances to solve.") The implication that "we just lack the political will" can feel like a criticism of anyone who's not maximally-environmentalist. I think that's why people are getting defensive about it.</p>
]]></description><pubDate>Fri, 17 Nov 2023 16:05:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=38305406</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=38305406</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38305406</guid></item><item><title><![CDATA[New comment by timmaxw in "The beautiful mind of Sam Bankman-Fried"]]></title><description><![CDATA[
<p>Yeah. I agree with most of what David Gerard writes, but this attack on Scott Alexander was weak. The "54 billion lives" thing was obviously a joke.</p>
]]></description><pubDate>Wed, 01 Nov 2023 02:57:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=38094107</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=38094107</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38094107</guid></item><item><title><![CDATA[New comment by timmaxw in "How many billions of transistors in an iPhone processor?"]]></title><description><![CDATA[
<p>What are all those transistors doing?<p>I've heard the cache is the biggest part. Per <a href="https://en.wikipedia.org/wiki/Apple_A17" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Apple_A17</a>, the A17 has 72MB of cache. Cache is typically SRAM. Per <a href="https://en.wikipedia.org/wiki/Static_random-access_memory" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Static_random-access_memory</a>, a single bit of SRAM typically uses 6 transistors, but it could be anywhere from 4 to 10. So that's between 2.3B and 5.7B transistors for the cache.<p>That leaves about 1B transistors for each of the 12 cores (6 CPU + 6 GPU). The instruction set is a few hundred instructions. Surely it doesn't take millions of transistors to implement each instruction. Other than the cache, which parts of the processor need millions of transistors?</p>
]]></description><pubDate>Mon, 30 Oct 2023 06:40:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=38066359</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=38066359</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38066359</guid></item><item><title><![CDATA[New comment by timmaxw in "Beginners guide to building a hardware hacking lab"]]></title><description><![CDATA[
<p>As a beginner, I've been a big fan of the Digilent Analog Discovery. This guide lists it under "logic analyzers", but it's also a passable oscilloscope if you don't need more than 30MHz bandwidth. Because the target market is undergraduates learning electrical engineering, it's designed to be inexpensive, doesn't take up much space, is easy to get started with, etc.</p>
]]></description><pubDate>Sun, 22 Oct 2023 20:09:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=37978643</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=37978643</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37978643</guid></item><item><title><![CDATA[New comment by timmaxw in "I Will Fucking Haymaker You If You Mention Agile Again"]]></title><description><![CDATA[
<p>haymaker (noun) a powerful blow with the fist.<p>etymology: "the punch probably so called for resemblance to the wide swinging stroke of a scythe"</p>
]]></description><pubDate>Mon, 16 Oct 2023 04:18:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=37895888</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=37895888</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37895888</guid></item><item><title><![CDATA[New comment by timmaxw in "The FTC sues to break up Amazon over an economy-wide “hidden tax”"]]></title><description><![CDATA[
<p>The latter seems plausible to me, but the former makes no sense. If the problem is that Amazon-retail has too much market power, how would splitting off AWS help with that problem? Amazon-retail would still have the same fraction of the retail market as before.</p>
]]></description><pubDate>Wed, 04 Oct 2023 17:03:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=37768204</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=37768204</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37768204</guid></item><item><title><![CDATA[New comment by timmaxw in "The FTC sues to break up Amazon over an economy-wide “hidden tax”"]]></title><description><![CDATA[
<p>This writeup has a lot more details: <a href="https://www.wired.com/story/amazon-antitrust-lawsuit-cuts-to-core-of-identity/" rel="nofollow noreferrer">https://www.wired.com/story/amazon-antitrust-lawsuit-cuts-to...</a><p>DC AG Karl Racine filed a lawsuit over this in May 2021. The judge threw it out, supposedly for lack of evidence that it actually raised prices: <a href="https://www.jurist.org/news/2022/03/dc-trial-court-dismisses-amazon-antitrust-lawsuit/" rel="nofollow noreferrer">https://www.jurist.org/news/2022/03/dc-trial-court-dismisses...</a> I can't find details; it's unclear what the evidence or lack thereof was.<p>CA AG Rob Bonta filed another lawsuit over the same issue in Sept 2022. Some juicy quotes here (although only one side of the story): <a href="https://oag.ca.gov/news/press-releases/attorney-general-bonta-reveals-additional-evidence-antitrust-violations-lawsuit" rel="nofollow noreferrer">https://oag.ca.gov/news/press-releases/attorney-general-bont...</a> The CA lawsuit is set to go to trial in 2026.</p>
]]></description><pubDate>Wed, 04 Oct 2023 16:57:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=37768086</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=37768086</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37768086</guid></item><item><title><![CDATA[New comment by timmaxw in "I applied to 250 jobs and timed how long each one took"]]></title><description><![CDATA[
<p>> People have families to feed.<p>People would submit fewer applications, but each individual application would have a higher chance of success, because everyone else would _also_ be submitting fewer applications. The number of job openings is the same either way, so the same number of people get hired in the end, right?</p>
]]></description><pubDate>Wed, 04 Oct 2023 02:35:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=37760200</link><dc:creator>timmaxw</dc:creator><comments>https://news.ycombinator.com/item?id=37760200</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37760200</guid></item></channel></rss>