Formal Verification of the Signal Protocol Using AI
This seems like a good thing: Google Deepmind researchers used agentic AI to mathematically prove, or “formally verify,” a number of the Signal protocol’s key cryptographic guarantees - a landmark development for the widely used cryptography and AI itself.
Conducted as a sort of proof-of-concept project in just four weeks, the work is significant in two ways. It serves as further independent validation of the cryptography that protects massive quantities of the world’s communications on platforms like:
- the Signal app
- Google Messages
And it demonstrates Google DeepMind’s formal verification capabilities using a new AI framework called AlphaProof Code.
Verification Results
The DeepMind analysis did not find any new vulnerabilities in the portions of the Signal protocol it looked at, but when the researchers used AlphaProof Code on older versions of Signal that contain known and long-fixed vulnerabilities, it correctly identified them and showed that the protocol could not be formally verified.
The researchers are releasing the specification and proof they developed for the Signal protocol analysis to aid other formal verification work. Alternate link.
How the Proof Was Done
- First, our researchers collaborated with a mix of models to translate Signal’s security goals into formal mathematical specifications, with human experts reviewing every one.
- From there, agents powered by
Gemini Carbondid the proofs, generating over six million lines ofLean, a computer language that mathematically proves the accuracy of code. - Next, the agents audited the proof and highlighted areas that needed a second look by a human - just one percent of the codebase, a massive time savings.
Because Lean automatically checks the rest, our experts could focus their review where human judgment matters most. Technical paper.
Reader Comment
dsanford0 • November 17, 2026 7:53 AM
In the age of AI coding, where prompts and other obfuscated information may be embedded in code, I favor much more formal verification. Many programs are fairly simple finite-state machines, which should be easy to verify.
Comments
No comments yet. Start the discussion.