<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fintech on MacWorks</title><link>https://macworks.dev/tags/fintech/</link><description>Recent content in Fintech on MacWorks</description><generator>Hugo</generator><language>en</language><atom:link href="https://macworks.dev/tags/fintech/index.xml" rel="self" type="application/rss+xml"/><item><title>2026-05-27</title><link>https://macworks.dev/docs/week/hackernews/hackernews-2026-05-27/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://macworks.dev/docs/week/hackernews/hackernews-2026-05-27/</guid><description>&lt;h1 id="hacker-news--2026-05-27"&gt;Hacker News — 2026-05-27&lt;a class="anchor" href="#hacker-news--2026-05-27"&gt;#&lt;/a&gt;&lt;/h1&gt;
&lt;h2 id="top-story"&gt;Top Story&lt;a class="anchor" href="#top-story"&gt;#&lt;/a&gt;&lt;/h2&gt;
&lt;p&gt;&lt;strong&gt;&lt;a href="https://www.thonking.ai/p/strangely-matrix-multiplications"&gt;Matrix Multiplications on GPUs Run Faster When Given &amp;ldquo;Predictable&amp;rdquo; Data&lt;/a&gt;&lt;/strong&gt;
Matrix multiplications are supposed to be fully deterministic, executing the same number of operations and memory accesses regardless of the tensor&amp;rsquo;s contents. Yet, initializing matrices with zeros or ones yields measurably faster performance than using normally distributed random data. The culprit is dynamic switching power: predictable data minimizes transistor state flips, reducing power consumption and preventing the GPU&amp;rsquo;s Voltage Regulator Module from aggressively throttling clock frequencies under heavy load.&lt;/p&gt;</description></item></channel></rss>