I built the first open-source FP8 linear solver in Python — 2-3x faster than cuBLAS

SHARVESWAR .M — Sun, 15 Mar 2026 12:11:54 +0000

I Built the First Open-Source FP8 Linear

Solver in Python

I'm a second-year CS student. Last week I
published ssBlast — an open-source Python
library that solves large linear systems
2-3x faster than CuBLAS using FP8 precision
on consumer NVIDIA GPUs.

Here's exactly how it works and why it's fast.

The Problem

Solving Ax = b (where A is a huge matrix)
is one of the most common operations in
scientific computing:

Weather prediction: 1,000,000 unknowns
Airplane simulation: 500,000 unknowns
Drug discovery: 100,000 unknowns

CPU solvers take hours. GPU solvers are
faster, but existing tools either don't
support FP8 or require C++ expertise.

Why FP8 is Faster

Floating point numbers store digits:

FP64 = 8 bytes per number (very precise)
FP32 = 4 bytes per number
FP16 = 2 bytes per number
FP8 = 1 byte per number (rough)

Less bytes = less memory to read from GPU
= faster computation.

FP64: 128 MB for 4000×4000 matrix
FP8: 16 MB for same matrix (8x less!)

RTX 4050 FP8 Tensor Cores = ~330 TFLOPS
RTX 4050 FP64 Cores = ~20 TFLOPS

The Problem With FP8

FP8 can only store values from -448 to +448.

Real matrix values can be 95,000 or -200,000.
Storing them directly in FP8 = overflow = garbage.

Existing solution (bad):

Pick one global scale factor for entire matrix.
Problem: tiles with small values lose precision.
Tiles with large values still overflow.

ssBlast solution (novel):

Per-tile scaling. Each 32×32 tile gets its OWN
scale factor:

scale = max(abs(tile)) / 447.0
scaled_tile = tile / scale

now all values fit in ±447

After multiply:
result = dot(scaled_A, scaled_B) * scale_A * scale_B

This means:
✅ Every tile uses full FP8 range
✅ No global clipping
✅ Computed in-kernel (zero CPU overhead)

The 5-Layer Architecture

ssBlast has 5 layers, each with one job:

Layer 1: Detect GPU
cp.cuda.runtime.getDeviceProperties(0)
RTX 4050 → cc=8.9 → FP8 tier

Layer 2: Select precision plan
FP8 tier → use Triton kernel
FP16 tier → use CuPy cuBLAS
FP32 tier → use CuPy cuBLAS

Layer 3: Dispatch to correct path

Layer 4: FP8 Triton kernel (THE NOVEL PART)
Per-tile scaling + tl.dot + Tensor Cores

Layer 5: Iterative refinement
Corrects FP8 rough answer → FP64 accuracy

The Triton Kernel (~80 lines)

@triton.autotune(
configs=[
triton.Config({BLOCK_M:128,BLOCK_N:128},
num_warps=8),
triton.Config({BLOCK_M:64,BLOCK_N:64},
num_warps=4),
], key=["M","N","K"]
)
@triton.jit
def _fp8_scaled_gemm_kernel(...):
# Each GPU block handles one output tile
acc = tl.zeros((BLOCK_M, BLOCK_N),
dtype=tl.float32)

for k in range(0, K, BLOCK_K):
# Load tiles
a_tile = tl.load(A_ptr + ...)
b_tile = tl.load(B_ptr + ...)

# Per-tile scale (THE NOVEL PART)
a_scale = tl.max(tl.abs(a_tile)) / 447.0
b_scale = tl.max(tl.abs(b_tile)) / 447.0

# Safety: avoid divide by zero
a_scale = tl.where(a_scale==0, 1.0, a_scale)
b_scale = tl.where(b_scale==0, 1.0, b_scale)

# Scale to FP8 range
a_scaled = a_tile / a_scale
b_scaled = b_tile / b_scale

# Tensor Core multiply (auto FP8 on RTX 40xx)
product = tl.dot(a_scaled.to(tl.float16),
                 b_scaled.to(tl.float16),
                 out_dtype=tl.float32)

# Unscale
acc += product * a_scale * b_scale

# Store FP64
tl.store(C_ptr + ..., acc.to(tl.float64))

Benchmark Results

Tested on RTX 4050 Laptop, CUDA 12.6, WSL2:

Matrix	SciPy CPU	CuPy FP64	ssBlast	Speedup
1000×1000	0.025s	0.026s	0.020s	1.3x
2000×2000	0.128s	0.121s	0.050s	2.4x
4000×4000	0.713s	0.542s	0.188s	2.9x
8000×8000	4.041s	2.066s	1.021s	2.0x
10000×10000	6.701s	4.026s	1.920s	2.1x

All FP64-accurate (error < 1e-11).
Best for n ≥ 2000.

How to Use It

pip install ssblast

from ssblast import solve
import cupy as cp

A = cp.random.randn(4000, 4000)
b = cp.random.randn(4000)

x = solve(A, b)

FP64 accurate ✅

2.9x faster than CuPy ✅

Works on any NVIDIA GPU:
RTX 40xx → FP8 (fastest)
RTX 30xx → FP16
RTX 20xx → FP16
GTX 10xx → FP32
No GPU → scipy CPU

What I Learned

Triton requires Linux (WSL2 works!)
Small matrices (<2000) = overhead > benefit
Iterative refinement is the key to FP64 accuracy
Per-tile scaling is simple but powerful
Publishing to PyPI is easier than I thought

Links

GitHub: github.com/Sharveswar007/SSBLAST
PyPI: pypi.org/project/ssblast

43/43 tests passing. MIT license.

Questions welcome in comments! 🚀

DEV Community: SHARVESWAR .M