Sparse Matrix-Vector Multiplication that works at 30–90% sparsity
Get picks like this daily. Today's launch numbers, the top launches, AI and tech news, and a daily opportunity pick, straight to your inbox.
Want to reach these readers? Sponsor an issue.
To get benefits from sparsity, you usually need to have very sparse matrices, impose some structure on the sparsity pattern or have specialized hardware. None of it is the case if you want to rune pruned LLMs on consumer devices. I wanted to see how far can you push it on a GPU and ended up with this. Blog: https://www.grizzlytech.dev/blog/macko-spmv Paper: https://arxiv.org/abs/2511.13061 Code (example with torch): https://github.com/vlejd/macko_spmv
HN · launched Nov 25, 2025 · 7 upvotes (top 62%) · 1 view
Niche: specialized algorithms and computing libraries · 230 launches, 3 in the last 7 days ▼ -80% · Explore this niche →
Category and tags
- Horizontal
- Model & infra
- Developer
- Not AI
- Hobby / open-source project
Visit website ↗ Source listing ↗
More like this: all 230 launches in specialized algorithms and computing libraries →
Could you build this?
No Engineering sparse matrix-vector multiplication that outperforms dense kernels at intermediate 30-90% sparsity requires deep mathematical formulation and manual GPU hardware microarchitecture optimization.
What it would actually take: The architecture relies on custom CUDA or Triton GPU kernels targeting modern tensor or compute cores with specialized compression formats (such as blocked CSR, sliced ELLPACK, or custom bitmasks). The hard problem is eliminating warp divergence and coalescing irregular memory access patterns when sparsity is too low for traditional sparse BLAS to win over dense GEMM. Requires advanced GPU performance engineering, assembly/PTX-level optimization, and deep numerical linear algebra expertise.
Discussion
5 comments analyzed.
Competitors mentioned: cuBLAS, Quantization (fp16 to fp8)
Concerns raised: Unstructured sparsity lacks efficient GPU kernel support, Structured sparsity degrades model quality, Quantization provides easier speedup than sparsity, Limited applicability outside 30-90% sparsity range, Block sparsity creates worst-case scenarios
Feature requests: Support for use cases beyond 30-90% sparsity, Guidance on wider adoption of sparse neural approaches
Competitors
Other products that read as similar to this one : 92 launches clear the similarity bar, closest 8 shown.
Attention rank: #59 of 93 (itself plus its competitors, highest first, normalized so YC and Product Hunt are compared fairly).
Launched 24 days after the earliest competitor.
- sparse-memory-lm · github · 2026-10-03 · 10 upvotes · similarity 0.49
- Spectra Super Intelligence · ph · 2026-10-17 · 1 upvotes · similarity 0.39
- RunMat · hn · 2025-12-02 · 21 upvotes · similarity 0.38
- Minimal LLM Post-Training Experiments on an 8GB GPU (SFT, DPO, GRPO) · hn · 2026-08-01 · 21 upvotes · similarity 0.38
- Axiom · hn · 2026-02-02 · 5 upvotes · similarity 0.37
- The Hessian of tall-skinny networks is easy to invert · hn · 2026-01-15 · 31 upvotes · similarity 0.37
- EdgeVec · hn · 2025-12-12 · 7 upvotes · similarity 0.37
- minimax-h3-tensorfold-rtx · github · 2026-10-03 · 10 upvotes · similarity 0.37
The niche, labels, vibe code rating and competitor comparison on this page are analysis by Nicheloom. If you use them, please credit nicheloom.com. How you may use our data.