Skip to content
Sagan

Paper

Bit-Exact AI Inference Verification Without Performance Tradeoffs

Unreadunread

AI summary

arXiv:2606. 00279v1 Announce Type: new Abstract: Verifying claims about AI workloads is a pre- requisite for credible AI governance of covert adversaries (who comply with monitoring only when detection likelihood is high), yet the ap- parent non-determinism of GPU floating-point arithmetic forces auditors to accept approximate output matches.