Decoded
Feed

A Contract-Grade Verifier for LLM-Generated GPU Kernels, and a Native Blackwell Backward for the Gated-Linear-Recurrence Family

arXiv:2608.12700LGARDC13 aug 20261 min readHN ×2PDF

Most LLM-written GPU kernels marked correct still break on NaNs, shapes or repeat runs.

39.5%

Accepted kernels broken beyond tolerance

These kernels already passed their source system's own correctness harness.

How it works

  1. Loose correctness test

    Kernel benchmarks accept output close to a reference on a few random inputs at one shape.

  2. Twelve adversarial gates

    A verifier probes NaNs, new shapes, repeat runs, precisions and accumulators. Several gates use exact matching, no tolerance.

  3. Gap is large

    Of 2,638 accepted kernels, 62.1% violate a contract. KernelBench passes 1,487 the verifier rejects, versus 14 reversed.

runsame inputscomparepass/failAcceptedkernelsAdversarialinput probesfp32referenceTwelvecontract gatesPer-kernelverdictrunsame inputscomparepass/failAcceptedkernelsAdversarialinput probesfp32referenceTwelvecontract gatesPer-kernelverdict
From the paper