AI Slop Code Risk Monitor

Project-OSRM/osrm-backend

SlopCodeMonitor badge for Project-OSRM/osrm-backend Adjusted legacy signal; badge bands: 25 / 50 / 75 (different from dashboard bands).

Open Source Routing Machine - C++ backend

2.2 Low pattern signal View on GitHub

Open-Source Code Quality, Security and Technical Debt Review

This report summarizes scanner evidence for Project-OSRM/osrm-backend, a C++ project with 8,187 GitHub stars. SynthScan examined 160,504 lines of code across 880 source files, recording 341 pattern matches distributed across 7 syntactic categories. The legacy adjusted pattern signal is 2.2 (Low pattern signal); it is not an authorship estimate.

Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.

2.2
Adjusted Signal
2.2
Raw Pattern Score
100%
Time Factor
2026-10-30
Last Push
8.2K
Stars
C++
Language
160.5K
Lines of Code
880
Files
341
Pattern Hits
2026-10-31
Scan Date
0.00
HC Hit Rate

Risk Review · Payload v1

Use each vector to guide manual verification of the underlying findings.

Payload schema: 1.0.0 · Engine: 2.0.0 · Scoring: heuristic-density-v1 · Scan date: 2026-10-31.

Cognitive Ownership Risk 10.1/100 · LOW

Can maintainers explain intent, assumptions, and trade-offs? 325 finding(s).

Hallucinated Dependency & Supply Chain Risk 0.4/100 · LOW

Are imports declared and package/API names verified? 13 finding(s).

Agent Over-Engineering Ratio 1.7/100 · LOW

Are wrappers, guards, and repeated structures necessary? 44 finding(s).

PR Review Velocity Impact 10.4/100 · LOW

Which changes need focused human review? 341 finding(s).

What These Metrics Mean

Adjusted Signal
Legacy pattern score normalized per 1,000 scanned lines and multiplied by the repository-level time factor. It is not an estimate of AI authorship.
Raw Pattern Score
Sum of severity- and context-weighted pattern findings before applying the time factor.
Time Factor
A coarse multiplier based on repository last-push metadata. It does not identify when individual code was written.
Pattern Hits
Count of configured pattern findings. Review each location and surrounding code before acting.
HC Hit Rate
High- and critical-severity findings per scanned file. Severity is a configured detector weight, not proof of a vulnerability or authorship.
Lines / Files
Scan coverage denominators used by the legacy normalized score.

Pattern-Signal History

This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.

Severity Breakdown

Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.

CRITICAL 0HIGH 0MEDIUM 6LOW 335

Directory Score Breakdown

This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.

Pattern Findings

The scanner identified 341 distinct pattern matches across 7 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.

Reading the findings table: The Severity column indicates the configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.

Over-Commented Block270 hits · 270 pts
SeverityFileLineSnippetContext
LOWpyproject.toml121COMMENT
LOWtest/python/test_table.py61 # )COMMENT
LOWtest/python/test_table.py81 # destinations = [0,1],COMMENT
LOWtest/python/test_match.py181 # match_params = osrm.MatchParameters(COMMENT
LOWunit_tests/contractor/graph_contractor.cpp1#include "contractor/graph_contractor.hpp"COMMENT
LOWunit_tests/util/coordinate_calculation.cpp161 // | tCOMMENT
LOWunit_tests/util/fingerprint.cpp1#include "util/fingerprint.hpp"COMMENT
LOWunit_tests/util/entry_class.cpp21 BOOST_CHECK(entries.activate(0));COMMENT
LOWunit_tests/util/rectangle.cpp1#include "util/rectangle.hpp"COMMENT
LOWunit_tests/util/packed_vector.cpp1#include "util/packed_vector.hpp"COMMENT
LOWunit_tests/util/static_rtree.cpp1#include "util/static_rtree.hpp"COMMENT
LOWunit_tests/partitioner/cell_storage.cpp181 {9, 8}, // i i i iCOMMENT
LOWunit_tests/partitioner/cell_storage.cpp201 // 11 b b i iCOMMENT
LOWunit_tests/server/parameters_parser.cpp1#include "server/api/parameters_parser.hpp"COMMENT
LOWunit_tests/server/json_parameters_parser.cpp1#include "server/api/json_parameters_parser.hpp"COMMENT
LOWunit_tests/server/request_handler.cpp1#include "server/request_handler.hpp"COMMENT
LOWunit_tests/library/limits.cpp1#include <boost/test/unit_test.hpp>COMMENT
LOWunit_tests/library/route.cpp1#include <boost/test/unit_test.hpp>COMMENT
LOWunit_tests/library/tile.cpp1#include <boost/test/unit_test.hpp>COMMENT
LOWunit_tests/library/extract.cpp1#include <boost/test/unit_test.hpp>COMMENT
LOWunit_tests/updater/turn_id_uniqueness.cpp1#include "extractor/edge_based_edge.hpp"COMMENT
LOWunit_tests/extractor/restriction_graph.cpp401BOOST_AUTO_TEST_CASE(partially_nested_restriction)COMMENT
LOWunit_tests/extractor/car_profile_width_penalty.cpp1#include "extractor/extraction_node.hpp"COMMENT
LOWunit_tests/extractor/area/visibility_graph.cpp181//COMMENT
LOWunit_tests/extractor/area/util.cpp61COMMENT
LOWunit_tests/extractor/area/util.cpp101 // point carries a 1 nm (sub-resolution) perturbation. This is a DETERMINISTICCOMMENT
LOWunit_tests/extractor/area/util.cpp141// A segment that ends on, or passes through, the endpoint of another does not cross it.COMMENT
LOWunit_tests/extractor/area/util.cpp181 BOOST_CHECK(intersect(&a, &b, &g, &h));COMMENT
LOWunit_tests/extractor/area/area_mesher.cpp1#include "extractor/area/area_mesher.hpp"COMMENT
LOWexample/example.cpp1#include "osrm/match_parameters.hpp"COMMENT
LOWinclude/nodejs/node_osrm_support.hpp1#ifndef OSRM_BINDINGS_NODE_SUPPORT_HPPCOMMENT
LOWinclude/nodejs/node_osrm_support.hpp21#include <napi.h>COMMENT
LOWinclude/contractor/contracted_edge_container.hpp1#ifndef OSRM_CONTRACTOR_CONTRACTED_EDGE_CONTAINER_HPPCOMMENT
LOWinclude/util/dynamic_graph.hpp1#ifndef DYNAMICGRAPH_HPPCOMMENT
LOWinclude/util/bearing.hpp1#ifndef BEARING_HPPCOMMENT
LOWinclude/util/bearing.hpp61//COMMENT
LOWinclude/util/packed_vector.hpp1#ifndef PACKED_VECTOR_HPPCOMMENT
LOWinclude/util/browse_resistant_cache.hpp1#ifndef OSRM_UTIL_BROWSE_RESISTANT_CACHE_HPPCOMMENT
LOWinclude/util/isatty.hpp1#ifndef ISATTY_HPPCOMMENT
LOWinclude/util/graph_utils.hpp41 {COMMENT
LOWinclude/util/json_renderer.hpp1// based onCOMMENT
LOWinclude/util/static_rtree.hpp1#ifndef STATIC_RTREE_HPPCOMMENT
LOWinclude/util/static_rtree.hpp21COMMENT
LOWinclude/util/static_rtree.hpp421COMMENT
LOWinclude/util/opening_hours.hpp1#ifndef OSRM_OPENING_HOURS_HPPCOMMENT
LOWinclude/util/group_by.hpp1#ifndef OSRM_GROUP_BYCOMMENT
LOWinclude/util/static_graph.hpp1#ifndef STATIC_GRAPH_HPPCOMMENT
LOWinclude/util/debug.hpp1#ifndef OSRM_UTIL_DEBUG_HPP_COMMENT
LOWinclude/util/vector_view.hpp1#ifndef UTIL_VECTOR_VIEW_HPPCOMMENT
LOWinclude/util/indexed_data.hpp1#ifndef OSRM_INDEXED_DATA_HPPCOMMENT
LOWinclude/util/fingerprint.hpp1#ifndef FINGERPRINT_HCOMMENT
LOWinclude/util/geojson_debug_logger.hpp1#ifndef OSRM_GEOJSON_DEBUG_LOGGER_HPPCOMMENT
LOWinclude/util/tarjan_scc.hpp1#ifndef TARJAN_SCC_HPPCOMMENT
LOWinclude/util/timezones.hpp1#ifndef OSRM_TIMEZONES_HPPCOMMENT
LOWinclude/util/meminfo.hpp41#endifCOMMENT
LOWinclude/util/exception_utils.hpp1#ifndef EXCEPTION_UTILS_HPPCOMMENT
LOWinclude/util/hilbert_value.hpp1#ifndef HILBERT_VALUE_HPPCOMMENT
LOWinclude/util/hilbert_value.hpp21// state is of x and y are to result stateCOMMENT
LOWinclude/util/guidance/name_announcements.hpp1#ifndef OSRM_UTIL_GUIDANCE_NAME_ANNOUNCEMENT_HPP_COMMENT
LOWinclude/util/guidance/name_announcements.hpp161 (!from_name.empty() && from_ref.empty() && to_name.empty() && !to_ref.empty()) ||COMMENT
210 more matches not shown…
Hyper-Verbose Identifiers41 hits · 50 pts
SeverityFileLineSnippetContext
LOWtest/python/test_table.py99 def test_table_withoutwaypoints(self):CODE
LOWtest/python/test_table.py106 def test_table_fallbackspeeds(self):CODE
LOWtest/python/test_table.py117 def test_table_invalidfallbackspeeds(self):CODE
LOWtest/python/test_table.py131 def test_table_invalidscalefactor(self):CODE
LOW⚡test/python/test_trip.py26 def test_trip_geometrycompression(self):CODE
LOW⚡test/python/test_trip.py35 def test_trip_nogeometrycompression(self):CODE
LOW⚡test/python/test_trip.py42 def test_trip_speedannotations(self):CODE
LOWtest/python/test_trip.py64 def test_trip_severalannotations(self):CODE
LOW⚡test/python/test_match.py51 def test_match_no_geometrycompression(self):CODE
LOW⚡test/python/test_match.py58 def test_match_geometrycompression(self):CODE
LOW⚡test/python/test_match.py66 def test_match_speedannotations(self):CODE
LOWtest/python/test_match.py91 def test_match_severalannotations(self):CODE
LOW⚡test/python/test_match.py166 def test_match_invalidtimestamps(self):CODE
LOW⚡test/python/test_match.py172 def test_match_without_motorways(self):CODE
LOW⚡test/python/test_match.py180 # def test_match_invalidwaypoints_needtwo(self):COMMENT
LOW⚡test/python/test_match.py190 # def test_match_invalidwaypoints_needcoordindices(self):COMMENT
LOW⚡test/python/test_match.py200 # def test_match_invalidwaypoints_ordermatters(self):COMMENT
LOW⚡test/python/test_match.py209 def test_match_invalidwaypoints_mustcorrespond(self):CODE
LOW⚡test/python/test_match.py216 def test_match_error_on_splittrace(self):CODE
LOWtest/python/test_index.py14 def test_throwifnecessarynotexist(self):CODE
LOWtest/python/test_index.py70 def test_datasetnamenotstring(self):CODE
LOWtest/python/test_route.py68 def test_route_geometrycompression(self):CODE
LOWtest/python/test_route.py89 def test_route_speedannotations(self):CODE
LOWtest/python/test_route.py121 def test_route_severalannotations(self):CODE
LOWtest/python/test_route.py215 def test_route_validapproaches(self):CODE
LOWtest/python/test_route.py229 def test_route_invalidapproach(self):CODE
LOWtest/python/test_route.py233 def test_route_customlimitsmld(self):CODE
LOWtest/python/test_route.py256 def test_route_invalidwaypoints(self):CODE
LOWtest/python/test_nearest.py21 def test_nearest_numberofresults(self):CODE
LOWtest/python/test_nearest.py28 def test_nearest_validbearings(self):CODE
LOWtest/python/test_nearest.py48 def test_nearest_validapproaches(self):CODE
LOWtest/python/test_nearest.py57 def test_nearest_invalidapproach(self):CODE
LOWinclude/server/request_handler.hpp32class RequestHandlerCODE
LOWinclude/server/connection.hpp22class RequestHandler;CODE
LOWfeatures/lib/utils.js15function verifyExistenceOfBinaries(env) {CODE
LOWscripts/ci/post_benchmark_results.py43def collect_benchmark_results(base_folder, pr_folder):CODE
LOWscripts/ci/e2e_benchmark.py79def bootstrap_confidence_interval(data, num_samples=1000, confidence_level=0.95):CODE
LOWscripts/ci/e2e_benchmark.py89def calculate_confidence_interval(data, min_is_best=True):CODE
LOWscripts/ci/bench.js142function bootstrapConfidenceInterval(data, numSamples = 1000, confidenceLevel = 0.95) {CODE
LOWscripts/ci/bench.js166function calculateConfidenceInterval(data) {CODE
LOWscripts/debug/area_snapping_report.py169def two_entrances_at_the_bottom():CODE
Unused Imports13 hits · 13 pts
SeverityFileLineSnippetContext
LOWscripts/gdb_printers.py82CODE
LOWsrc/python/osrm/__init__.py2CODE
LOWsrc/python/osrm/__init__.py2CODE
LOWsrc/python/osrm/__init__.py2CODE
LOWsrc/python/osrm/__init__.py2CODE
LOWsrc/python/osrm/__init__.py2CODE
LOWsrc/python/osrm/__init__.py2CODE
LOWsrc/python/osrm/__init__.py2CODE
LOWsrc/python/osrm/__init__.py2CODE
LOWsrc/python/osrm/__init__.py2CODE
LOWsrc/python/osrm/__init__.py2CODE
LOWsrc/python/osrm/__init__.py2CODE
LOWsrc/python/osrm/__init__.py2CODE
AI Slop Vocabulary4 hits · 10 pts
SeverityFileLineSnippetContext
MEDIUMpackage-lock.json12025 "resolved": "https://registry.npmjs.org/robust-predicates/-/robust-predicates-3.0.3.tgz",CODE
MEDIUMpackage-lock.json12610 "resolved": "https://registry.npmjs.org/robust-predicates/-/robust-predicates-2.0.4.tgz",CODE
MEDIUMfeatures/step_definitions/trip.js76 // trip order. This is robust against route-geometry details and stillCOMMENT
MEDIUMsrc/updater/updater.cpp490 // we utilize the via node (first on ways) to represent the turn restrictionCOMMENT
Deep Nesting9 hits · 9 pts
SeverityFileLineSnippetContext
LOWscripts/routed_benchmark.py75CODE
LOWscripts/routed_benchmark.py100CODE
LOWscripts/routed_benchmark.py159CODE
LOWscripts/contractor_benchmark.py34CODE
LOWscripts/contractor_benchmark.py83CODE
LOWscripts/ci/download_gps_traces.py7CODE
LOWscripts/ci/e2e_benchmark.py47CODE
LOWscripts/debug/area_snapping_report.py609CODE
LOWscripts/debug/area_mesh_stages.py96CODE
Excessive Try-Catch Wrapping3 hits · 5 pts
SeverityFileLineSnippetContext
MEDIUMscripts/ci/download_gps_traces.py40 print(f"Error fetching data for bbox {bbox_str}: {response.status_code} {response.text}", file=sys.sCODE
MEDIUMscripts/ci/download_gps_traces.py51 print(f"Error parsing GPX data: {e}", file=sys.stderr)CODE
LOWscripts/debug/area_snapping_report.py304 except Exception:CODE
Structural Annotation Overuse1 hit · 2 pts
SeverityFileLineSnippetContext
LOWinclude/util/static_rtree.hpp273 // Step 1 - create a vector of Hilbert Code/original position pairsCOMMENT