<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: cpa</title><link>https://news.ycombinator.com/user?id=cpa</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 06 Aug 2026 23:21:44 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=cpa" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by cpa in "Pareto Front"]]></title><description><![CDATA[
<p>At $JOB, I use the Pareto frontier all the time.<p>If one option is at least as good on every relevant dimension and better on one, just pick it. That's not really a trade-off, and it shouldn't need escalation. Eg, if two SaaS tools cost the same and have similar support, but one fits your use case better, you choose that one. Otherwise, you just suck at your job!<p>The interesting decisions only start once you're already on the frontier, where getting more of one thing means giving up something else. If the better tool costs 50% more, now you're trading capability against cost, and that may need sign-off.<p>Basically, everyone should be able to get to the frontier on their own. Coordination and arbitration at higher levels of the org / between different departments should happen on the frontier, where the trade-offs involve several people or teams.</p>
]]></description><pubDate>Thu, 06 Aug 2026 15:00:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=49197670</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=49197670</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49197670</guid></item><item><title><![CDATA[New comment by cpa in "Umuganda"]]></title><description><![CDATA[
<p><a href="https://en.wikipedia.org/wiki/Corv%C3%A9e" rel="nofollow">https://en.wikipedia.org/wiki/Corv%C3%A9e</a></p>
]]></description><pubDate>Thu, 16 Jul 2026 13:37:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=48934385</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=48934385</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48934385</guid></item><item><title><![CDATA[New comment by cpa in "Why the Next Era of AI Is About Infrastructure, Not Just Models"]]></title><description><![CDATA[
<p>It's nice to be rich.</p>
]]></description><pubDate>Thu, 09 Jul 2026 21:11:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=48852437</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=48852437</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48852437</guid></item><item><title><![CDATA[New comment by cpa in "Geosql: A Claude/Codex skill for geospatial data"]]></title><description><![CDATA[
<p>This space is very active. I work at the French mapping agency, and we're currently building MCPs to work with our data.<p>See: <a href="https://github.com/ignfab/geocontext" rel="nofollow">https://github.com/ignfab/geocontext</a> (French)  
Beta MCP instance: <a href="https://geollm.beta.ign.fr/geocontext/mcp" rel="nofollow">https://geollm.beta.ign.fr/geocontext/mcp</a><p>Unrelated, but also take a look at the nice high-density LiDAR point data we have!  
<a href="https://visionneuse-lidarhd.ign.fr/?px=4441970.281583222&py=374682.8055641948&pz=4547296.947251096&qx=0.2607454059054861&qy=0.2836776999465366&qz=0.6793651702848728&qw=0.6245012099716316" rel="nofollow">https://visionneuse-lidarhd.ign.fr/?px=4441970.281583222&py=...</a></p>
]]></description><pubDate>Wed, 08 Jul 2026 17:14:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=48834534</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=48834534</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48834534</guid></item><item><title><![CDATA[New comment by cpa in "Ask HN: What is everyone in SF talking about?"]]></title><description><![CDATA[
<p>Something something AI</p>
]]></description><pubDate>Sun, 28 Jun 2026 14:15:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=48707469</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=48707469</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48707469</guid></item><item><title><![CDATA[New comment by cpa in "Is AI ruining our skills? Early results are in – and they're not good"]]></title><description><![CDATA[
<p><a href="https://terrytao.wordpress.com/career-advice/theres-more-to-mathematics-than-rigour-and-proofs/" rel="nofollow">https://terrytao.wordpress.com/career-advice/theres-more-to-...</a></p>
]]></description><pubDate>Fri, 19 Jun 2026 19:17:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=48602163</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=48602163</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48602163</guid></item><item><title><![CDATA[New comment by cpa in "All 9,300 Japanese train station, animated by the year it opened (1872–2026)"]]></title><description><![CDATA[
<p>Super cool!
I did something similar (in terms of visualisation) a few years back, a map of cities by their birthdate on wikipedia: <a href="https://cpa.github.io/wiki-cities-birthdates/" rel="nofollow">https://cpa.github.io/wiki-cities-birthdates/</a></p>
]]></description><pubDate>Wed, 10 Jun 2026 15:03:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=48477434</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=48477434</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48477434</guid></item><item><title><![CDATA[New comment by cpa in "Accelerate – Embedded language for high-performance array computations"]]></title><description><![CDATA[
<p>For those wondering what it's for: it's basically NumPy + a JIT compiler with standard Haskell syntax (you mostly just need to change the type signatures, not the code).<p>It can vectorize, parallelize on the CPU, or offload to the GPU automatically.<p>It's a very mature project, maybe 10+ years old.</p>
]]></description><pubDate>Sat, 16 May 2026 15:57:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=48161312</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=48161312</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48161312</guid></item><item><title><![CDATA[Google Knol]]></title><description><![CDATA[
<p>Article URL: <a href="https://en.wikipedia.org/wiki/Knol">https://en.wikipedia.org/wiki/Knol</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48113098">https://news.ycombinator.com/item?id=48113098</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 12 May 2026 19:19:13 +0000</pubDate><link>https://en.wikipedia.org/wiki/Knol</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=48113098</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48113098</guid></item><item><title><![CDATA[Show HN: Multiplayer Voronoi]]></title><description><![CDATA[
<p>A multiplayer hommage to Jean-Michel Sanejouand's Jeu de Topo (1963), a game with no winner or loser where partners arrange stones until both points of view are satisfied.<p>Here, stones become colored points in a game based on Voronoi diagrams. The original opposing points of view become each player's screen: everyone shares the same points, but phones, tablets, and browser windows frame the space differently, so each player is likely seeing a different Voronoi view.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47960061">https://news.ycombinator.com/item?id=47960061</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 30 Apr 2026 09:21:20 +0000</pubDate><link>https://voronoi.charlespierre.fr/</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=47960061</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47960061</guid></item><item><title><![CDATA[New comment by cpa in "Monad Tutorials Timeline"]]></title><description><![CDATA[
<p>Pretty cool!<p>I've spent a lot of time wrapping my head around monads; whenever I thought I "got it," I would come across some exotic monad that completely blew my mind. The best way to understand them is not to rely on analogies but just follow the rules—everybody says that, but it took me a while to truly realize it.<p>See, for example, the Tardis monad or the Cont monad: <a href="https://www.reddit.com/r/haskell/comments/446d13/exotic_monads/" rel="nofollow">https://www.reddit.com/r/haskell/comments/446d13/exotic_mona...</a></p>
]]></description><pubDate>Thu, 30 Apr 2026 06:55:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=47959103</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=47959103</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47959103</guid></item><item><title><![CDATA[New comment by cpa in "Men who stare at walls"]]></title><description><![CDATA[
<p>I thought it'd be the male version of <a href="https://www.thehairpin.com/women-laughing-alone-with-salad/" rel="nofollow">https://www.thehairpin.com/women-laughing-alone-with-salad/</a></p>
]]></description><pubDate>Mon, 27 Apr 2026 14:43:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=47922289</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=47922289</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47922289</guid></item><item><title><![CDATA[New comment by cpa in "Everything we like is a psyop?"]]></title><description><![CDATA[
<p>Top comment of a frontpage post, you're not doing that bad at marketing.</p>
]]></description><pubDate>Fri, 17 Apr 2026 06:34:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=47803056</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=47803056</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47803056</guid></item><item><title><![CDATA[New comment by cpa in "Trust signals as sparklines for Hacker News"]]></title><description><![CDATA[
<p>Interesting, but how is the trust signal measured? I couldn’t find this information</p>
]]></description><pubDate>Sat, 28 Mar 2026 07:45:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=47552464</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=47552464</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47552464</guid></item><item><title><![CDATA[New comment by cpa in "Owner of ICE detention facility sees big opportunity in AI man camps"]]></title><description><![CDATA[
<p>As member of OSCE, they have observers although it’s fairly light.<p><a href="https://odihr.osce.org/odihr/elections/usa/580111" rel="nofollow">https://odihr.osce.org/odihr/elections/usa/580111</a></p>
]]></description><pubDate>Mon, 09 Mar 2026 14:00:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=47309170</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=47309170</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47309170</guid></item><item><title><![CDATA[New comment by cpa in "The normalization of corruption in organizations (2003) [pdf]"]]></title><description><![CDATA[
<p>Another good read: <a href="https://www.scu.edu/ethics/focus-areas/business-ethics/resources/seven-signs-of-ethical-collapse/" rel="nofollow">https://www.scu.edu/ethics/focus-areas/business-ethics/resou...</a></p>
]]></description><pubDate>Fri, 27 Feb 2026 09:53:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=47178666</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=47178666</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47178666</guid></item><item><title><![CDATA[New comment by cpa in "Show HN: MOL – A programming language where pipelines trace themselves"]]></title><description><![CDATA[
<p>Pretty cool to have a first-class tracing mechanism. Obviously... it's a monad! Haskell has had a MonadTrace monad for a long time, that can be switched on or off depending on your environment.<p><a href="https://hackage.haskell.org/package/tracing-0.0.7.4/docs/Control-Monad-Trace-Class.html#t:MonadTrace" rel="nofollow">https://hackage.haskell.org/package/tracing-0.0.7.4/docs/Con...</a></p>
]]></description><pubDate>Sun, 15 Feb 2026 09:42:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=47022411</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=47022411</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47022411</guid></item><item><title><![CDATA[New comment by cpa in "Billing can be bypassed using a combo of subagents with an agent definition"]]></title><description><![CDATA[
<p>It reminds me of when I used to write lisp, where code is data. You can abuse reflection (and macros) to great effect, but you never feel safe.<p>See also: string interpolation and SQL injection, (unhygienic) C macros</p>
]]></description><pubDate>Sun, 08 Feb 2026 17:50:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=46936708</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=46936708</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46936708</guid></item><item><title><![CDATA[New comment by cpa in "Making geo joins faster with H3 indexes"]]></title><description><![CDATA[
<p>To add to sibling comment, if you have streaming data you have to update the whole index every time with r/kd trees whereas with H3 you just compute the bin, O(1) instead of O(log n).<p>Not rocket science but different tradeoffs, that’s what engineering is all about.</p>
]]></description><pubDate>Sat, 07 Feb 2026 12:47:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=46923428</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=46923428</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46923428</guid></item><item><title><![CDATA[New comment by cpa in "Making geo joins faster with H3 indexes"]]></title><description><![CDATA[
<p>The big reason is that H3 is data independant. You put your data in predefined bins and then join on them, whereas kd/r trees depend on the data and building the trees may become prohibitive or very hard (especially in distributed systems).</p>
]]></description><pubDate>Sat, 07 Feb 2026 10:10:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=46922679</link><dc:creator>cpa</dc:creator><comments>https://news.ycombinator.com/item?id=46922679</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46922679</guid></item></channel></rss>