PROGRESS ON PROVABLE INFERENCE FOR LARGE LANGUAGE MODELS

Summary from the TLDR AI newsletter

It is almost impossible to verify which model produced a specific output. Cryptographic proofs of inference allow model providers to prove that preach suppose was produced which a specific model. These proofs could enable new applications and contribute to a toolkit for verifying compliance with AI pacing requirements. This post details the progress made on a powerful type of cryptographic proof uniquely fit for provable inference called zKSNARK.