my latest blog post "auto-research with codex: how I achieved a 212x faster…
- Source
- x.com
- Date

my latest blog post "auto-research with codex: how I achieved a 212x faster kernel over baseline with codex in GPU Mode's qr_v2 problem" is up now. in this post, i talk about my approach towards auto-kerneling on the QR decomposition problem. https://t.co/tKwV9xMDC8

Context
Sankalp's GPU optimization experiment gave OpenAI's Codex a concrete feedback loop: revise code, check mathematical correctness, then measure execution time. The task was a specified form of QR factorization, a way of decomposing matrices. The GPU Mode competition supplied correctness checks and timing feedback across test cases, allowing repeated revisions to be judged against a fixed target. Experiment account
The announcement claimed a 212× speedup over the baseline; the linked article reports 232× against a torch.geqrf baseline. Both concern this particular kernel task. The transferable idea is the test-and-measure workflow that makes candidate improvements checkable.
videoAutoresearch Made Our Models 3x Faster — Tejas Bhakta, MorphAI Engineer
videoWe Let Claude Code and Codex Race Human Researchers — Elie Bakouch, Prime IntellectAI Engineer
articleKernelArc: A Multi-Agent Framework for GPU Kernel OptimizationJoyjit Kundu, Ben Stoffelen, Kaili Wang, Peter Vrancx, Ludovic Denoyer
Checking sign-in…
Loading comments…