<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>AVX2 on Shai Asher</title><link>https://slow-is-smooth.io/tags/avx2/</link><description>Recent content in AVX2 on Shai Asher</description><generator>Hugo</generator><language>en-gb</language><lastBuildDate>Mon, 22 Sep 2025 07:03:20 +0000</lastBuildDate><atom:link href="https://slow-is-smooth.io/tags/avx2/index.xml" rel="self" type="application/rss+xml"/><item><title>SIMD-Optimized Bloom Filter in Go: An In-Depth Exploration</title><link>https://slow-is-smooth.io/blog/simd-optimized-bloom-filter-in-go-an-in-depth-exploration/</link><pubDate>Mon, 22 Sep 2025 07:03:20 +0000</pubDate><guid>https://slow-is-smooth.io/blog/simd-optimized-bloom-filter-in-go-an-in-depth-exploration/</guid><description>&lt;p&gt;&lt;strong&gt;Project Repository:&lt;/strong&gt; &lt;a href="https://github.com/shaia/BloomFilter"&gt;https://github.com/shaia/BloomFilter&lt;/a&gt;&lt;/p&gt;&#10;&lt;h3 id="from-go-to-assembly"&gt;From Go to Assembly&lt;/h3&gt;&#10;&lt;p&gt;When we think of Go, we think of concurrency, simplicity, and &amp;ldquo;good enough&amp;rdquo; performance. But what happens when &amp;ldquo;good enough&amp;rdquo; isn&amp;rsquo;t good enough? What happens when you need to squeeze every last drop of performance out of the CPU for a critical, hot-path operation?&lt;/p&gt;</description></item><item><title>Solving the Pandigital Puzzle with AVX2 SIMD Acceleration.</title><link>https://slow-is-smooth.io/blog/solving-the-pandigital-puzzle-with-avx2-simd-acceleration/</link><pubDate>Mon, 21 Jul 2025 12:53:38 +0000</pubDate><guid>https://slow-is-smooth.io/blog/solving-the-pandigital-puzzle-with-avx2-simd-acceleration/</guid><description>&lt;h2 id="using-avx2-simd-instructions-in-c-to-accelerate-the-search-for-the-largest-1-9-pandigital-concatenated-product"&gt;Using AVX2 SIMD instructions in C++ to accelerate the search for the largest 1-9 pandigital concatenated product.&lt;/h2&gt;&#10;&lt;p&gt;If you&amp;rsquo;ve ever tackled &lt;strong&gt;Project Euler Problem 38&lt;/strong&gt;, you&amp;rsquo;re likely familiar with the hunt for the largest 1-to-9 pandigital number that can be formed by concatenating the product of an integer with &lt;code&gt;(1, 2, ..., n)&lt;/code&gt;.&lt;/p&gt;</description></item></channel></rss>