{
  "video_id": "reddit_1u09rah",
  "channel_slug": "programming",
  "channel_handle": "r/programming",
  "title": "Why Compiler Engineers Rarely Use Strassen's Algorithm for Fast Matrix Multiplications",
  "url": "https://www.reddit.com/r/programming/comments/1u09rah/why_compiler_engineers_rarely_use_strassens/",
  "external_url": "https://leetarxiv.substack.com/p/why-compilers-rarely-use-strassens-algorithm",
  "upload_date": "20260608",
  "published_at": "2026-06-08T14:36:19+00:00",
  "transcript": "\n\n--- Top Comments ---\n\n\n[129 upvotes] > Only Haskell-lovers (that’s a slur in my books) know how to vectorize Strassen’s algorithm.\n\nHaskell out here catchin strays\n\n[84 upvotes] The Strassen version is pretty poorly written. A production version would use an optimized base case higher than 1x1, reduce or avoid dynamic memory allocation at each step, and use multiply-accumulation to reduce the number of temporaries needed. For an algorithm like this, loads and stores alone account for a significant amount of the practical cost.\n\nIt is true that a complex algorithm like Strassen loses to more direct algorithms at smaller sizes until the asymptotic scaling catches up. This applies similarly to FFTs, where split-radix isn't always faster than radix-4 due to the more complex and less regular control/data flow, despite the operation count advantage. But it'd be interesting to see how the cutover shifts with a better implementation.\n\n[41 upvotes] Why would *compiler engineers* care about matrix multiplication?",
  "transcript_chars": 1020,
  "ingested_at": "2026-06-09T01:30:20.340981+00:00",
  "source": "reddit",
  "yt_meta": {
    "score": 109,
    "upvote_ratio": 0.87,
    "num_comments": 36,
    "author": "DataBaeBee",
    "is_self": false
  }
}