Anthropic Open Source FlashProve - a provable inference tool In essence, they proposed a prototype of an open cryptographic protocol through which any examiner without access to the scales could verify that the answer was given exactly by the model declared by the vendor. Such a thing is necessary, for example, to check that the routing service does not replace the model cheaper, or that the model in the company's circuit has not been replaced by attackers. It works like this: the provider publishes a digital printout of its scales in advance, and then attaches a proof file to each answer. The match between this file and the seal means the authenticity of the model, and it can be tested on a normal computer without GPU and weight. The proof weighs about 19 MB per 1024 token request, and verification takes about 17 seconds. Obviously, this is still several times more expensive than normal hashing, but, for comparison, the previous result was about 14 hours of verification and 93 GB proof. The algorithm is based on the zkSNARK method. This has been known for quite some time, but the advantage of Anthropic is that they were able to optimize it for practical speeds in a model with parameters up to 400V. By the way, the article says that Claude mainly dealt with acceleration and optimization. Maybe it's not far from text source detector.

Anthropic Open Source FlashProve - a provable inference tool In essence, they proposed a prototype of an open cryptographic protocol through which any examiner without access to the scales could verify that the answer was given exactly by the model declared by the vendor. Such a thing is necessary, for example, to check that the routing service does not replace the model cheaper, or that the model in the company's circuit has not been replaced by attackers. It works like this: the provider publishes a digital printout of its scales in advance, and then attaches a proof file to each answer. The match between this file and the seal means the authenticity of the model, and it can be tested on a normal computer without GPU and weight. The proof weighs about 19 MB per 1024 token request, and verification takes about 17 seconds. Obviously, this is still several times more expensive than normal hashing, but, for comparison, the previous result was about 14 hours of verification and 93 GB proof. The algorithm is based on the zkSNARK method. This has been known for quite some time, but the advantage of Anthropic is that they were able to optimize it for practical speeds in a model with parameters up to 400V. By the way, the article says that Claude mainly dealt with acceleration and optimization. Maybe it's not far from text source detector.