@Lhree: [Revised] From Toy to Instrument: Seven Years of Verifpal (Nadim Kobeissi) https://ia.cr/2026/1654
Summary
This paper presents the revised analysis engine for Verifpal, a symbolic protocol verifier, detailing its formal specification, proofs, and evaluation against other tools like ProVerif and Tamarin.
View Cached Full Text
Cached at: 09/25/26, 06:45 PM
[Revised] From Toy to Instrument: Seven Years of Verifpal (Nadim Kobeissi) https://ia.cr/2026/1654
From Toy to Instrument: Seven Years of Verifpal
Source: https://eprint.iacr.org/2026/1654
Paper 2026/1654
From Toy to Instrument: Seven Years of Verifpal
Abstract
Symbolic protocol verifiers must make a difficult tradeoff: their models and counterexamples should be accessible to protocol designers, but their results must still have a precise meaning. Verifpal addresses the first goal with a compact modeling language and source-level attack explanations. Its original analysis engine, introduced in 2019, had only a preliminary account of its guarantees. This paper presents and evaluates the replacement engine. The engine searches backward from a violated security query to candidate attacker actions. It then runs every session and peer configuration of the protocol together as one execution under those actions, in which each injected value must be derivable from what that same execution has already disclosed, and evaluates the query on that execution. We specify this process from the term algebra and primitive registry through knowledge deduction, bounded sessions, peer configurations, execution, and counterexample presentation. We also give a single-history reference semantics, prove that every execution the engine judges is a history of that semantics, prove termination under the engine’s search bounds, and state exactly what each result category establishes. Our evaluation combines targeted regression models, mutation analysis, corpus measurements, and comparisons with ProVerif, Tamarin, and Scyther. It shows that the engine can express and find attacks that require several sessions, different peer assignments, or staged compromise, while exposing the implementation choices that limit its search. The result is an auditable account of Verifpal as a bounded counterexample finder: every reported attack is an explicit protocol execution, but a passing query is not an unbounded proof, and no report is a machine-checked certificate.
BibTeX
@misc{cryptoeprint:2026/1654,
author = {Nadim Kobeissi},
title = {From Toy to Instrument: Seven Years of Verifpal},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1654},
year = {2026},
url = {https://eprint.iacr.org/2026/1654}
}
Similar Articles
Verification of Adaptive Agentic Controllers through Finite Rule Revision
This paper presents a bounded verification protocol for adaptive agentic controllers using finite symbolic rules, diagnostic predicates, and held-out re-evaluation, demonstrating the method on an inventory-control benchmark.
The Verifier Tax: Horizon-Dependent Safety–Success Tradeoffs in Tool-Using LLM Agents [R]
This paper presents a safety evaluation framework for tool-using LLM agents, introducing the concept of the 'Verifier Tax'—a horizon-dependent tradeoff between safety and task completion. It proposes a two-tier verification architecture and uses Tau-bench scenarios to demonstrate how verification can reduce unsafe successes but also decrease task completion as task horizon increases.
Palomar: A registry of Lean verified mathematics
Palomar is a new registry for Lean verified mathematics proofs, designed to help validate formal proofs using mechanical checks and AI-assisted methods.
@dabit3: if you’re not following @imjaredz you should change that now
This article presents Demonstrandum, a verification-first multi-agent AI mathematics pipeline that produces mechanically checkable artifacts, including refutations and proofs of conjectures with Lean 4 kernel verification.
@omarsar0: NEW AI paper worth bookmarking. This is something I called early, and this paper confirms it: verification has emerged …
This paper from Stanford, NVIDIA, and UC Berkeley introduces LLM-as-a-Verifier, a training-free verification framework that uses continuous scoring from LLM logits to improve accuracy across coding, robotics, and medical domains, achieving state-of-the-art results on multiple benchmarks.