Repeated-game analysis of restaking for verifiable inference, showing single-shot slashing is optimistic and history matters.

LLM inference gets zkSNARKed at operator granularity, because apparently GPUs weren't opaque enough.

Can Freivalds plus code proximity tests make matrix multiplication checks SNARK-friendly? LAMP says yes, with O(tk) relation size.