Close the operation, not the line: a closure savings formula for maintaining a cryptographic-inventory scanner

For seven weeks, the fix list of the open-source post-quantum readiness scanner qrp-mcp kept growing. Its items were found in public discussions and in our own probes, many of them probes we ran deliberately to find gaps, and the rate did not fall. We drew the fix list (438 items, 1 October – 17 November 2026) as a network. Linked by shared tags, the items form dense communities: Louvain modularity is 0.56, against 0.22 for the same network rewired with node degrees kept. Relabelled by cryptographic operation and ecosystem, they fall into 121 families. Our first explanation, that families keep growing for weeks, did not survive a shuffled-date control: 31% of detection rows join their (operation, ecosystem) family more than a week after its first row, against 46% with shuffled dates. Gaps arrive in batches when we run a probe. We model maintenance as reports that each reveal one spelling of an operation, and give the expected number of gaps under three policies: fixing the reported line, closing the operation's documented spellings at its first report (reactive), and closing them from the documentation before any report (proactive). The first and last are classical occupancy expectations; the reactive term is the part we derive. Two consequences follow: if spellings are static and fixes permanent, closure never yields more gaps than line fixing, on every sequence of reports, not only in expectation; and the price of waiting for the first report, reactive against proactive, is at most one expected gap per family. We describe changes to qrp-mcp, built on a development branch and not yet released: a catalogue of documented spellings per (operation, ecosystem) kept as tests, and an output section that states which pairs are closed against their catalogue. A maintainer loop re-reads the documentation and proposes new spellings, which enter the scanner only with a source and a test.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24336931
Primary Topic
Software Engineering Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Close the operation, not the line: a closure savings formula for maintaining a cryptographic-inventory scanner

Stanimir Tenev
1 links
Zenodo (CERN European Organization for Nuclear Research)
Software Engineering Research
article

Close the operation, not the line: a closure savings formula for maintaining a cryptographic-inventory scanner

Stanimir Tenev
article en

Abstract

For seven weeks, the fix list of the open-source post-quantum readiness scanner qrp-mcp kept growing. Its items were found in public discussions and in our own probes, many of them probes we ran deliberately to find gaps, and the rate did not fall. We drew the fix list (438 items, 1 October – 17 November 2026) as a network. Linked by shared tags, the items form dense communities: Louvain modularity is 0.56, against 0.22 for the same network rewired with node degrees kept. Relabelled by cryptographic operation and ecosystem, they fall into 121 families. Our first explanation, that families keep growing for weeks, did not survive a shuffled-date control: 31% of detection rows join their (operation, ecosystem) family more than a week after its first row, against 46% with shuffled dates. Gaps arrive in batches when we run a probe. We model maintenance as reports that each reveal one spelling of an operation, and give the expected number of gaps under three policies: fixing the reported line, closing the operation's documented spellings at its first report (reactive), and closing them from the documentation before any report (proactive). The first and last are classical occupancy expectations; the reactive term is the part we derive. Two consequences follow: if spellings are static and fixes permanent, closure never yields more gaps than line fixing, on every sequence of reports, not only in expectation; and the price of waiting for the first report, reactive against proactive, is at most one expected gap per family. We describe changes to qrp-mcp, built on a development branch and not yet released: a catalogue of documented spellings per (operation, ecosystem) kept as tests, and an output section that states which pairs are closed against their catalogue. A maintainer loop re-reads the documentation and proposes new spellings, which enter the scanner only with a source and a test.

Zenodo (CERN European Organization for Nuclear Research)
Software Engineering Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon