Prove the kernel contract before timing

Design a qualification matrix for a candidate kernel, including tails, strides, numerical error, input mutation and output ownership. Demonstrate that the evaluator rejects broken candidates before using its timings.

18 MIN · PREMIUM