Parameters
The same form as posting a job.
Fixed point with 12 fraction bits, at most 16,384 pixels, the whole image inside −2 … 2. One byte per pixel: the escape count.
Output and check
Run the template to see its output here.
The two templates
Fractal render
Mandelbrot escape counts, one byte per pixel, computed with 32-bit integers in fixed point (12 fraction bits). Checked by recomputing randomly picked 16 × 16 tiles: sampled, so pixels outside the picked tiles are not checked unless you ask for a full recompute. Any wrong pixel is provable on chain: the contract recomputes it (at most 255 iterations).
Matrix multiply
C = A × B over 32-bit unsigned integers (mod 2³²), with A and B generated from a seed. Checked with Freivalds' algorithm: 20 random rounds, each O(n²); a wrong C slips through with probability at most 2⁻²⁰. A wrong cell is provable on chain: the contract recomputes one dot product.