Repository Analysis

bitshifter/glam-rs

A simple and fast linear algebra library for games and graphics

4.1 Likely human-written View on GitHub

Analysis Overview

This report presents the forensic synthetic code analysis of bitshifter/glam-rs, a Rust project with 2,020 GitHub stars. SynthScan v2.0 examined 256,483 lines of code across 288 source files, recording 1099 pattern matches distributed across 1 syntactic category. The overall adjusted score of 4.1 places this repository in the Likely human-written band.

The scanner applied 160+ deterministic lexical heuristics, multi-line block detectors, abstract syntax tree depth profilers, and a cross-file Jaccard similarity matrix to construct a statistically normalised synthetic code estimate. All matches are individually weighted by severity coefficient and contextual multiplier before summation, and the resulting headline score is temporally discounted to account for the repository's development history relative to the commercial emergence of large language model coding tooling (November 2022 onward).

4.1

Adjusted Score

4.1

Raw Score

100%

Time Factor

2026-08-09

Last Push

2.0K

Stars

Rust

Language

256.5K

Lines of Code

288

Files

1.1K

Pattern Hits

2026-08-09

Scan Date

0.00

HC Hit Rate

What These Metrics Mean

Adjusted Score: Primary synthetic code indicator. Raw score normalised per 1,000 lines of code and multiplied by the temporal discount factor. This is the definitive comparative metric — use it to rank repositories by AI authorship density.
Raw Score: The unmodified sum of all severity-weighted, context-multiplied pattern match scores before temporal discounting. Reflects the absolute signal strength independent of when the repository was last active.
Time Factor: The temporal discount multiplier (0–100%) applied to the raw score. Repositories last updated before ChatGPT's launch (Nov 2022) receive a 5% factor. Full signal is only assigned to repositories active in the post-adoption era (Jan 2024+).
Pattern Hits: Total count of individual pattern matches across all files and categories. A high hit count with a low score may indicate a very large codebase with isolated AI snippets; a low count with a high score indicates dense, concentrated AI signatures.
HC Hit Rate: High+Critical pattern hits per file, averaged across the repository. This orthogonal signal catches repositories where a few files are densely packed with high-severity AI tells — a strong indicator even when the normalised score appears moderate due to codebase size.
Lines of Code / Files: Total lines and files analysed. The scanner examines 94 file extensions. These denominators are used to normalise the score, enabling fair comparison between repositories of vastly different sizes.

Score History

Longitudinal tracking requires multiple scan runs. Once this repository is re-scanned after new commits land, this chart will visualise how the synthetic code signal evolves over time — enabling you to detect whether AI authorship is growing, stabilising, or being actively corrected by human engineers.

No multi-scan history yet — run the scanner again to build trend data.

Severity Breakdown

Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.

CRITICAL 0HIGH 0MEDIUM 0LOW 1099

Directory Score Breakdown

This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.

Pattern Findings

The scanner identified 1099 distinct pattern matches across 1 syntactic category. Each entry below represents a discrete location in the source code where the engine recorded a statistically significant AI authorship indicator. 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 diagnostic confidence level (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — comment-context matches receive a ×1.5 weight because LLMs systematically over-annotate. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier as dense clusters constitute far stronger evidence of synthetic authorship than isolated hits.

Over-Commented Block1099 hits · 1046 pts

Severity	File	Line	Snippet	Context
LOW	tests/support/as_macros.rs	1	#![allow(unused_macros)]	COMMENT
LOW	src/float.rs	1	/// A trait for extending [`prim@f32`] and [`prim@f64`] with extra methods.	COMMENT
LOW	src/float.rs	21	///	COMMENT
LOW	src/euler.rs	1	// Based on Ken Shoemake. 1994. Euler angle conversion. Graphics gems IV. Academic Press	COMMENT
LOW	src/euler.rs	21	/// assert!(m_intrinsic.abs_diff_eq(n_intrinsic, 2e-6));	COMMENT
LOW	src/dcamera.rs	1	// Generated from camera_mod.rs.tera template. Edit the template, not the generated file.	COMMENT
LOW	src/dcamera.rs	21	//!	COMMENT
LOW	src/camera.rs	1	// Generated from camera_mod.rs.tera template. Edit the template, not the generated file.	COMMENT
LOW	src/camera.rs	21	//!	COMMENT
LOW	src/u64/u64vec2.rs	121	/// Creates a new vector from an array.	COMMENT
LOW	src/u64/u64vec2.rs	221	///	COMMENT
LOW	src/u64/u64vec2.rs	281	pub fn element_sum(self) -> u64 {	COMMENT
LOW	src/u64/u64vec2.rs	301	pub fn cmpeq(self, rhs: Self) -> BVec2 {	COMMENT
LOW	src/u64/u64vec2.rs	321	#[inline]	COMMENT
LOW	src/u64/u64vec2.rs	341	/// In other words this computes `[self.x <= rhs.x, self.y <= rhs.y, ..]` for all	COMMENT
LOW	src/u64/u64vec2.rs	361	#[doc(alias = "magnitude2")]	COMMENT
LOW	src/u64/u64vec2.rs	381		COMMENT
LOW	src/u64/u64vec2.rs	421		COMMENT
LOW	src/u64/u64vec2.rs	461		COMMENT
LOW	src/u64/u64vec2.rs	681	/// Returns a vector containing the wrapping addition of `self` and signed vector `rhs`.	COMMENT
LOW	src/u64/u64vec3.rs	141	/// # Panics	COMMENT
LOW	src/u64/u64vec3.rs	261	z: if self.z > rhs.z { self.z } else { rhs.z },	COMMENT
LOW	src/u64/u64vec3.rs	341		COMMENT
LOW	src/u64/u64vec3.rs	361		COMMENT
LOW	src/u64/u64vec3.rs	381	BVec3::new(self.x.ge(&rhs.x), self.y.ge(&rhs.y), self.z.ge(&rhs.z))	COMMENT
LOW	src/u64/u64vec3.rs	401	#[must_use]	COMMENT
LOW	src/u64/u64vec3.rs	421	pub fn length_squared(self) -> u64 {	COMMENT
LOW	src/u64/u64vec3.rs	441	/// This will returns [`None`] if the result is greater than [`u64::MAX`].	COMMENT
LOW	src/u64/u64vec3.rs	741		COMMENT
LOW	src/u64/u64vec4.rs	141	/// Creates a new vector from an array.	COMMENT
LOW	src/u64/u64vec4.rs	161	#[must_use]	COMMENT
LOW	src/u64/u64vec4.rs	261	/// Component-wise clamping of values, similar to [`u64::clamp`].	COMMENT
LOW	src/u64/u64vec4.rs	341	#[must_use]	COMMENT
LOW	src/u64/u64vec4.rs	421	///	COMMENT
LOW	src/u64/u64vec4.rs	461	/// # Overflow	COMMENT
LOW	src/u8/u8vec2.rs	121	/// Creates a new vector from an array.	COMMENT
LOW	src/u8/u8vec2.rs	221	///	COMMENT
LOW	src/u8/u8vec2.rs	281	pub fn element_sum(self) -> u8 {	COMMENT
LOW	src/u8/u8vec2.rs	301	pub fn cmpeq(self, rhs: Self) -> BVec2 {	COMMENT
LOW	src/u8/u8vec2.rs	321	#[inline]	COMMENT
LOW	src/u8/u8vec2.rs	341	/// In other words this computes `[self.x <= rhs.x, self.y <= rhs.y, ..]` for all	COMMENT
LOW	src/u8/u8vec2.rs	361	#[doc(alias = "magnitude2")]	COMMENT
LOW	src/u8/u8vec2.rs	381		COMMENT
LOW	src/u8/u8vec2.rs	421		COMMENT
LOW	src/u8/u8vec2.rs	461		COMMENT
LOW	src/u8/u8vec2.rs	681	/// Returns a vector containing the wrapping addition of `self` and signed vector `rhs`.	COMMENT
LOW	src/u8/u8vec3.rs	141	/// # Panics	COMMENT
LOW	src/u8/u8vec3.rs	261	z: if self.z > rhs.z { self.z } else { rhs.z },	COMMENT
LOW	src/u8/u8vec3.rs	341		COMMENT
LOW	src/u8/u8vec3.rs	361		COMMENT
LOW	src/u8/u8vec3.rs	381	BVec3::new(self.x.ge(&rhs.x), self.y.ge(&rhs.y), self.z.ge(&rhs.z))	COMMENT
LOW	src/u8/u8vec3.rs	401	#[must_use]	COMMENT
LOW	src/u8/u8vec3.rs	421	pub fn length_squared(self) -> u8 {	COMMENT
LOW	src/u8/u8vec3.rs	441	/// This will returns [`None`] if the result is greater than [`u8::MAX`].	COMMENT
LOW	src/u8/u8vec3.rs	741		COMMENT
LOW	src/u8/u8vec4.rs	141	/// Creates a new vector from an array.	COMMENT
LOW	src/u8/u8vec4.rs	161	#[must_use]	COMMENT
LOW	src/u8/u8vec4.rs	261	/// Component-wise clamping of values, similar to [`u8::clamp`].	COMMENT
LOW	src/u8/u8vec4.rs	341	#[must_use]	COMMENT
LOW	src/u8/u8vec4.rs	421	///	COMMENT
1039 more matches not shown…