Expand description
One graph as several kernels, for graphs too large for one shader (a traced contact step’s adjoint is hundreds of thousands of nodes, which shader compilers take minutes and tens of GB to optimize, or reject).
Structs§
- Split
Kernels - WGSL kernels that together compute a graph’s outputs, run in order over
the same environments: each reads
inputs(n_inputsper environment) and a per-environmentscratch(n_scratchfloats), and the last writesoutputs. Bindings: 0inputs(read), 1scratch(read_write), 2outputs(read_write), 3 the uniformcount; entry pointmain.