You certainly can prove that a system is cryptographically or otherwise sound. There is an entire field of formal verification. Proving that an implementation i

You certainly can prove that a system is cryptographically or otherwise sound. There is an entire field of formal verification. Proving that an implementation is correct is often more difficult, but not impossible.