<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: adamvenis</title><link>https://news.ycombinator.com/user?id=adamvenis</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 25 Apr 2026 13:04:26 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=adamvenis" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by adamvenis in "Finite Field Assembly: A Language for Emulating GPUs on CPU"]]></title><description><![CDATA[
<p>I think I get it. You're using the Ring isomorphism from the Chinese Remainder Theorem to do "parallel computation". This is the same principle as how boolean algebra on binary strings computes the pairwise results of each bit in parallel. Unfortunately, there's no free lunch - if you want to perform K operations on N-bit integers in parallel, you still need to work with (K * N)-bit-wide vectors, which is essentially what SIMD does anyway.</p>
]]></description><pubDate>Sat, 18 Jan 2025 01:05:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=42744846</link><dc:creator>adamvenis</dc:creator><comments>https://news.ycombinator.com/item?id=42744846</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42744846</guid></item></channel></rss>