[2606.15762] Snyk VulnBench JS 1.0: Can LLMs Find the Same Bugs Twice?

-->

Computer Science > Cryptography and Security

arXiv:2606.15762 (cs)

[Submitted on 14 Jun 2026]

Title:Snyk VulnBench JS 1.0: Can LLMs Find the Same Bugs Twice?

Authors:Liran Tal, Johannes Kloos, Arsenii Rudich, Stephen Thoemmes, Manoj Nair<br>View a PDF of the paper titled Snyk VulnBench JS 1.0: Can LLMs Find the Same Bugs Twice?, by Liran Tal and 4 other authors

View PDF<br>HTML (experimental)

Abstract:We ran 300 repeated vulnerability-finding scans to measure how repeatable agentic large language model (LLM) security review is on the same JavaScript code, prompt, and benchmark harness. The headline result is that LLM security findings were unevenly repeatable: reference-matched findings were stable, but extra model reports varied heavily from run to run. Across 250 model runs, 80 of 161 unique unmatched findings appeared in only one of five identical repetitions, while only 22 appeared in all five. By contrast, when Claude matched a Snyk Code reference finding, the behavior was much more stable: 134 of 158 unique reference-matched findings appeared in all five repetitions. The benchmark also shows complementarity. Models consistently found familiar, high-signal exploit shapes, and in one case surfaced a likely Snyk Code product gap. Snyk Code static application security testing (SAST) was deterministic and better at systematically enumerating repeated data-flow sinks. The results support combining agentic LLM review with deterministic SAST rather than treating either technique as a replacement for the other.

Comments:<br>12 pages, 9 figures

Subjects:

Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Software Engineering (cs.SE)

Cite as:<br>arXiv:2606.15762 [cs.CR]

(or<br>arXiv:2606.15762v1 [cs.CR] for this version)

https://doi.org/10.48550/arXiv.2606.15762

Focus to learn more

arXiv-issued DOI via DataCite (pending registration)

Submission history<br>From: Liran Tal [view email]<br>[v1]<br>Sun, 14 Jun 2026 11:47:17 UTC (170 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled Snyk VulnBench JS 1.0: Can LLMs Find the Same Bugs Twice?, by Liran Tal and 4 other authors<br>View PDF<br>HTML (experimental)<br>TeX Source

view license

Current browse context:

cs.CR

next >

new<br>recent<br>| 2026-06

Change to browse by:

cs<br>cs.AI<br>cs.SE

References & Citations

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)