Vulnerability Abundance: A formal proof of infinite vulnerabilities in code
Eireann Leverett, Jeroen van der Ham-de Vos

TL;DR
This paper proves that a single C program can generate infinitely many vulnerabilities, formalizes the concept of vulnerability abundance, and discusses its implications for software security and cyber-risk analysis.
Contribution
It provides a formal proof of infinite vulnerabilities in a program, introduces vulnerability abundance, and connects theoretical results with practical security considerations.
Findings
A single C program admits infinitely many CVE-assignable vulnerabilities.
Vulnerability abundance varies with programming language and software popularity.
Fewer than 6% of CVEs are exploited in the wild, influenced by vulnerability abundance and market share.
Abstract
We present a constructive proof that a single C program, the \emph{Vulnerability Factory}, admits a countably infinite set of distinct, independently CVE-assignable software vulnerabilities. We formalise the argument using elementary set theory, verify it against MITRE's CVE Numbering Authority counting rules, sketch a model-checking analysis that corroborates unbounded vulnerability generation, and provide a Turing-machine characterisation that situates the result within classical computability theory. We then contextualise this result within the long-running debate on whether undiscovered vulnerabilities in software are \emph{dense} or \emph{sparse}, and introduce the concept of \emph{vulnerability abundance}: a quantitative analogy to chemical elemental abundance that describes the proportional distribution of vulnerability classes across the global software corpus. Because different…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
