AI Slop Code RIsk Monitor

bitshifter/glam-rs

A simple and fast linear algebra library for games and graphics

4.6 Low pattern signal View on GitHub

Maintenance and Governance Review

This report summarizes scanner evidence for bitshifter/glam-rs, a Rust project with 2,074 GitHub stars. SynthScan examined 256,663 lines of code across 301 source files, recording 1268 pattern matches distributed across 1 syntactic category. The legacy adjusted pattern signal is 4.6 (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.

4.6
Adjusted Signal
4.6
Raw Pattern Score
100%
Time Factor
2026-10-06
Last Push
2.1K
Stars
Rust
Language
256.7K
Lines of Code
301
Files
1.3K
Pattern Hits
2026-10-12
Scan Date
0.00
HC Hit Rate

Risk Review · v3

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

Cognitive Ownership Risk 20.6/100 · LOW

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

Hallucinated Dependency & Supply Chain Risk 0.0/100 · LOW

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

Agent Over-Engineering Ratio 0.0/100 · LOW

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

PR Review Velocity Impact 21.9/100 · LOW

Which changes need focused human review? 1268 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 0LOW 1268

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 1268 distinct pattern matches across 1 syntactic category. 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 Block1268 hits · 1183 pts
SeverityFileLineSnippetContext
LOWrelease-plz.toml1# Release-plz configuration for glam.COMMENT
LOWrelease-plz.toml21# glam releases are a git tag + crates.io publish; no GitHub release.COMMENT
LOWtools/msrv/src/lib.rs1// The MSRV check only needs to compile glam with the target feature set.COMMENT
LOWtests/support/as_macros.rs1#![allow(unused_macros)]COMMENT
LOW.github/workflows/bench-update.yml1name: Update bench baselinesCOMMENT
LOWsrc/float.rs1/// A trait for extending [`prim@f32`] and [`prim@f64`] with extra methods.COMMENT
LOWsrc/float.rs21 ///COMMENT
LOWsrc/float.rs41 /// `a` and `b` must not be equal, otherwise the result will be either infinite or `NAN`.COMMENT
LOWsrc/float.rs61COMMENT
LOWsrc/float.rs81 ///COMMENT
LOWsrc/neon.rs41// pub(crate) unsafe fn dot3_in_x(lhs: float32x4_t, rhs: float32x4_t) -> float32x4_t {COMMENT
LOWsrc/euler.rs1// Based on Ken Shoemake. 1994. Euler angle conversion. Graphics gems IV. Academic PressCOMMENT
LOWsrc/euler.rs21/// assert!(m_intrinsic.abs_diff_eq(n_intrinsic, 2e-6));COMMENT
LOWsrc/dcamera.rs1// Generated from camera_mod.rs.tera template. Edit the template, not the generated file.COMMENT
LOWsrc/dcamera.rs21//!COMMENT
LOWsrc/camera.rs1// Generated from camera_mod.rs.tera template. Edit the template, not the generated file.COMMENT
LOWsrc/camera.rs21//!COMMENT
LOWsrc/u64/u64vec2.rs121 /// Creates a new vector from an array.COMMENT
LOWsrc/u64/u64vec2.rs141 #[must_use]COMMENT
LOWsrc/u64/u64vec2.rs181COMMENT
LOWsrc/u64/u64vec2.rs221 ///COMMENT
LOWsrc/u64/u64vec2.rs281 ///COMMENT
LOWsrc/u64/u64vec2.rs301 /// `self` and `rhs`.COMMENT
LOWsrc/u64/u64vec2.rs321COMMENT
LOWsrc/u64/u64vec2.rs341 BVec2::new(self.x.le(&rhs.x), self.y.le(&rhs.y))COMMENT
LOWsrc/u64/u64vec2.rs361 }COMMENT
LOWsrc/u64/u64vec2.rs401COMMENT
LOWsrc/u64/u64vec2.rs441 /// Casts all elements of `self` to `u16`.COMMENT
LOWsrc/u64/u64vec3.rs141 /// # PanicsCOMMENT
LOWsrc/u64/u64vec3.rs261 }COMMENT
LOWsrc/u64/u64vec3.rs341 /// Returns the product of all elements of `self`.COMMENT
LOWsrc/u64/u64vec3.rs361 /// Returns a vector mask containing the result of a `!=` comparison for each element ofCOMMENT
LOWsrc/u64/u64vec3.rs381 }COMMENT
LOWsrc/u64/u64vec3.rs401 pub fn cmple(self, rhs: Self) -> BVec3 {COMMENT
LOWsrc/u64/u64vec3.rs421 self.dot(self)COMMENT
LOWsrc/u64/u64vec3.rs481COMMENT
LOWsrc/u64/u64vec3.rs521COMMENT
LOWsrc/u64/u64vec3.rs741 /// Returns a vector containing the saturating division of `self` and `rhs`.COMMENT
LOWsrc/u64/u64vec4.rs141 #[inline]COMMENT
LOWsrc/u64/u64vec4.rs161 ///COMMENT
LOWsrc/u64/u64vec4.rs241 /// Returns a vector containing the maximum values for each element of `self` and `rhs`.COMMENT
LOWsrc/u64/u64vec4.rs341 /// Returns the product of all elements of `self`.COMMENT
LOWsrc/u64/u64vec4.rs401 /// In other words this computes `[self.x > rhs.x, self.y > rhs.y, ..]` for allCOMMENT
LOWsrc/u64/u64vec4.rs441 self.z.lt(&rhs.z),COMMENT
LOWsrc/u64/u64vec4.rs541COMMENT
LOWsrc/u8/u8vec2.rs121 /// Creates a new vector from an array.COMMENT
LOWsrc/u8/u8vec2.rs141 #[must_use]COMMENT
LOWsrc/u8/u8vec2.rs181COMMENT
LOWsrc/u8/u8vec2.rs221 ///COMMENT
LOWsrc/u8/u8vec2.rs281 ///COMMENT
LOWsrc/u8/u8vec2.rs301 /// `self` and `rhs`.COMMENT
LOWsrc/u8/u8vec2.rs321COMMENT
LOWsrc/u8/u8vec2.rs341 BVec2::new(self.x.le(&rhs.x), self.y.le(&rhs.y))COMMENT
LOWsrc/u8/u8vec2.rs361 }COMMENT
LOWsrc/u8/u8vec2.rs401COMMENT
LOWsrc/u8/u8vec2.rs441 /// Casts all elements of `self` to `i32`.COMMENT
LOWsrc/u8/u8vec3.rs141 /// # PanicsCOMMENT
LOWsrc/u8/u8vec3.rs261 }COMMENT
LOWsrc/u8/u8vec3.rs341 /// Returns the product of all elements of `self`.COMMENT
LOWsrc/u8/u8vec3.rs361 /// Returns a vector mask containing the result of a `!=` comparison for each element ofCOMMENT
1208 more matches not shown…