How a Rust program becomes a provable guest: target specs, the atomics problem, the one LLVM pass the whole field converged on, and four toolchain strategies — pinned across six zkVMs.
The instruction set as an object of proof: ISA edge cases, the hardware-vs-prover cost inversion, arithmetization across four zkVMs, and an opcode-by-opcode encyclopedia.
Round polynomials as shadows and slices of one surface, a transcript as a walk from the cube's centre to a random point, and the secant that makes a protocol necessary. Eight live figures.
