AI Slop Code Risk Monitor

google/highway

SlopCodeMonitor badge for google/highway Adjusted legacy signal; badge bands: 25 / 50 / 75 (different from dashboard bands).

Performance-portable, length-agnostic SIMD with runtime dispatch

4.2 Low pattern signal View on GitHub

Open-Source Code Quality, Security and Technical Debt Review

This report summarizes scanner evidence for google/highway, a C++ project with 5,950 GitHub stars. SynthScan examined 170,040 lines of code across 146 source files, recording 739 pattern matches distributed across 9 syntactic categories. The legacy adjusted pattern signal is 4.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.

4.2
Adjusted Signal
4.2
Raw Pattern Score
100%
Time Factor
2026-10-31
Last Push
6.0K
Stars
C++
Language
170.0K
Lines of Code
146
Files
739
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 19.0/100 · LOW

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

Hallucinated Dependency & Supply Chain Risk 0.0/100 · LOW

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

Agent Over-Engineering Ratio 0.1/100 · LOW

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

PR Review Velocity Impact 20.1/100 · LOW

Which changes need focused human review? 739 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 12LOW 727

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 739 distinct pattern matches across 9 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 Block698 hits · 634 pts
SeverityFileLineSnippetContext
LOWCMakeLists.txt1# Copyright 2019 Google LLCCOMMENT
LOWhwy/highway.h1// Copyright 2020 Google LLCCOMMENT
LOWhwy/highway.h21#include "hwy/detect_targets.h"COMMENT
LOWhwy/highway.h41// Shorthand for tags (defined in shared-inl.h) used to select overloads.COMMENT
LOWhwy/highway.h61//------------------------------------------------------------------------------COMMENT
LOWhwy/highway.h81#define HWY_STATIC_NAMESPACE N_WASMCOMMENT
LOWhwy/highway.h101#define HWY_STATIC_NAMESPACE N_NEON_WITHOUT_AESCOMMENT
LOWhwy/highway.h121#define HWY_STATIC_NAMESPACE N_AVX2COMMENT
LOWhwy/highway.h141// that target was not compiled.COMMENT
LOWhwy/highway.h161#define HWY_VISIT_WASM(VISITOR)COMMENT
LOWhwy/highway.h181#define HWY_CHOOSE_Z15(FUNC_NAME) &N_Z15::FUNC_NAMECOMMENT
LOWhwy/highway.h201#define HWY_VISIT_PPC9(VISITOR)COMMENT
LOWhwy/highway.h221#define HWY_CHOOSE_PPC10(FUNC_NAME) &N_PPC10::FUNC_NAMECOMMENT
LOWhwy/highway.h241#define HWY_CHOOSE_NEON_WITHOUT_AES(FUNC_NAME) nullptrCOMMENT
LOWhwy/highway.h261#if HWY_TARGETS & HWY_SVECOMMENT
LOWhwy/highway.h281#define HWY_CHOOSE_SVE_256(FUNC_NAME) nullptrCOMMENT
LOWhwy/highway.h301#if HWY_TARGETS & HWY_SSSE3COMMENT
LOWhwy/highway.h321#define HWY_CHOOSE_AVX2(FUNC_NAME) nullptrCOMMENT
LOWhwy/highway.h341#if HWY_TARGETS & HWY_AVX3_ZEN4COMMENT
LOWhwy/highway.h361#define HWY_CHOOSE_AVX10_2(FUNC_NAME) nullptrCOMMENT
LOWhwy/highway.h401 const FuncPtr* table;COMMENT
LOWhwy/highway.h481 HWY_CONCAT(FUNC_NAME, HighwayDispatchTable)COMMENT
LOWhwy/highway.h501// namespace skeleton {COMMENT
LOWhwy/highway.h521//COMMENT
LOWhwy/highway.h541 HWY_DISPATCH_TABLE(TABLE_NAME)[1] = {&HWY_STATIC_DISPATCH(FUNC_NAME)}COMMENT
LOWhwy/highway.h561// 1) An extra function parameter would be unacceptable because it changes theCOMMENT
LOWhwy/highway.h661COMMENT
LOWhwy/highway.h681COMMENT
LOWhwy/highway.h701COMMENT
LOWhwy/highway.h721#endifCOMMENT
LOWhwy/highway.h741#elif HWY_TARGET == HWY_WASM_EMU256COMMENT
LOWhwy/print-inl.h1// Copyright 2022 Google LLCCOMMENT
LOWhwy/print-inl.h21#include "hwy/print.h"COMMENT
LOWhwy/highway_export.h1// Pseudo-generated file to handle both cmake & bazel build system.COMMENT
LOWhwy/highway_export.h21#ifdef _WIN32COMMENT
LOWhwy/highway_export.h41#elseCOMMENT
LOWhwy/highway_export.h61#endifCOMMENT
LOWhwy/detect_compiler_arch.h1// Copyright 2020 Google LLCCOMMENT
LOWhwy/detect_compiler_arch.h21COMMENT
LOWhwy/detect_compiler_arch.h41#if defined(_MSC_VER) && !defined(__clang__)COMMENT
LOWhwy/detect_compiler_arch.h61#elseCOMMENT
LOWhwy/detect_compiler_arch.h81#if __has_builtin(__builtin_elementwise_fshl)COMMENT
LOWhwy/detect_compiler_arch.h101#elif __has_warning("-Wreserved-identifier")COMMENT
LOWhwy/detect_compiler_arch.h121#else // Anything older than 7.0 is not recommended for Highway.COMMENT
LOWhwy/detect_compiler_arch.h141 !HWY_COMPILER_ICXCOMMENT
LOWhwy/detect_compiler_arch.h161// Compiler features and C++ versionCOMMENT
LOWhwy/detect_compiler_arch.h181#ifdef __has_featureCOMMENT
LOWhwy/detect_compiler_arch.h201#if defined(__cpp_constexpr) && __cpp_constexpr >= 201304LCOMMENT
LOWhwy/detect_compiler_arch.h221#define HWY_IF_CONSTEXPR if constexprCOMMENT
LOWhwy/detect_compiler_arch.h241#if HWY_HAS_FEATURE(memory_sanitizer) || defined(MEMORY_SANITIZER) || \COMMENT
LOWhwy/detect_compiler_arch.h261COMMENT
LOWhwy/detect_compiler_arch.h281#define HWY_ATTR_NO_MSANCOMMENT
LOWhwy/detect_compiler_arch.h301#elseCOMMENT
LOWhwy/detect_compiler_arch.h321#endifCOMMENT
LOWhwy/detect_compiler_arch.h341#endifCOMMENT
LOWhwy/detect_compiler_arch.h361#if defined(__EMSCRIPTEN__) || defined(__wasm__) || defined(__WASM__)COMMENT
LOWhwy/detect_compiler_arch.h381#endifCOMMENT
LOWhwy/detect_compiler_arch.h401#define HWY_ARCH_S390X 0COMMENT
LOWhwy/detect_compiler_arch.h421#endifCOMMENT
LOWhwy/detect_compiler_arch.h441#elif HWY_ARCH_HEXAGONCOMMENT
638 more matches not shown…
AI Slop Vocabulary11 hits · 33 pts
SeverityFileLineSnippetContext
MEDIUMhwy/nanobenchmark.h20// prediction hit rates. Uses a robust estimator to summarize the measurements.COMMENT
MEDIUMhwy/nanobenchmark.h46// which is more robust to outliers and skewed data than the mean or median.COMMENT
MEDIUMhwy/auto_tune.h78 // - The minimum is not a robust estimator because there are also "luckyCOMMENT
MEDIUMhwy/auto_tune.h96 // - Trim the initial sample via MAD or skewness for a robust estimate of theCOMMENT
MEDIUMhwy/auto_tune.h153 // deviation, which is robust to almost half of the sample being outliers.COMMENT
MEDIUMhwy/robust_statistics.h82// Half Sample Mode estimator proposed by Bickel in "On a fast, robustCOMMENT
MEDIUMhwy/robust_statistics.h132// Returns a robust measure of variability.COMMENT
MEDIUMhwy/contrib/hash/phast-inl.h123 // Two vectors have higher throughput because they utilize all 16-bit lanesCOMMENT
MEDIUMhwy/contrib/btree/btree-inl.h179 // to utilize all 64 bits of the mask register, reducing the number ofCOMMENT
MEDIUMhwy/ops/rvv-inl.h5355// Definitely at least 128 bit: match x86 semantics (independent blocks). UsingCOMMENT
MEDIUMhwy/ops/rvv-inl.h5415// Definitely less than 128-bit only if there is a small cap; fractional LMULCOMMENT
Verbosity Indicators12 hits · 22 pts
SeverityFileLineSnippetContext
LOW⚡hwy/contrib/math/fast_math-inl.h46 // Step 1: Find the nearest integer multiple of pi:COMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h50 // Step 2: Cody-Waite multi-word range reduction:COMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h126 // Step 3: Extract sign and magnitude x_red = |ang_mod| in [0, pi/2].COMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h131 // Step 4: Compute dx = (pi/2 - x_red) without losing low-order bits near theCOMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h181 // Step 1: GetMantissa0p75_1p5(x) directly extracts y in [0.75, 1.50) in oneCOMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h184 // Step 2: GetExponent(x) returns the original exponent k, andCOMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h364 // Step 1: Reduce `x` modulo pi to:COMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h372 // Step 2: Rational approximation with an exact pole at x = pi/2.COMMENT
LOWhwy/contrib/math/fast_math-inl.h209 // Step 1: Compute shifted exponent e = k (if m < 1.5) or k + 1 (if mCOMMENT
LOWhwy/contrib/math/fast_math-inl.h237 // Step 2: Shift right by p bits and subtract bias to obtain integer e.COMMENT
LOWhwy/contrib/math/fast_math-inl.h250 // Step 3: Compute y = x / 2^e in [0.75, 1.50).COMMENT
LOWhwy/contrib/math/fast_math-inl.h410 // Step 3: Reconstruct signed tan(x) = num / den.COMMENT
Structural Annotation Overuse12 hits · 22 pts
SeverityFileLineSnippetContext
LOW⚡hwy/contrib/math/fast_math-inl.h46 // Step 1: Find the nearest integer multiple of pi:COMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h50 // Step 2: Cody-Waite multi-word range reduction:COMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h126 // Step 3: Extract sign and magnitude x_red = |ang_mod| in [0, pi/2].COMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h131 // Step 4: Compute dx = (pi/2 - x_red) without losing low-order bits near theCOMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h181 // Step 1: GetMantissa0p75_1p5(x) directly extracts y in [0.75, 1.50) in oneCOMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h184 // Step 2: GetExponent(x) returns the original exponent k, andCOMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h364 // Step 1: Reduce `x` modulo pi to:COMMENT
LOW⚡hwy/contrib/math/fast_math-inl.h372 // Step 2: Rational approximation with an exact pole at x = pi/2.COMMENT
LOWhwy/contrib/math/fast_math-inl.h209 // Step 1: Compute shifted exponent e = k (if m < 1.5) or k + 1 (if mCOMMENT
LOWhwy/contrib/math/fast_math-inl.h237 // Step 2: Shift right by p bits and subtract bias to obtain integer e.COMMENT
LOWhwy/contrib/math/fast_math-inl.h250 // Step 3: Compute y = x / 2^e in [0.75, 1.50).COMMENT
LOWhwy/contrib/math/fast_math-inl.h410 // Step 3: Reconstruct signed tan(x) = num / den.COMMENT
Decorative Section Separators1 hit · 3 pts
SeverityFileLineSnippetContext
MEDIUMCMakeLists.txt695# --------------------------------------------------------COMMENT
Example Usage Blocks2 hits · 3 pts
SeverityFileLineSnippetContext
LOWhwy/contrib/btree/btree-inl.h2274 // Example usage:COMMENT
LOWhwy/contrib/btree/btree-inl.h2338 // Example usage:COMMENT
Unused Imports1 hit · 1 pts
SeverityFileLineSnippetContext
LOWdocs/conf.py14CODE
AI Structural Patterns1 hit · 1 pts
SeverityFileLineSnippetContext
LOWdocs/mm-converter.py44CODE
Deep Nesting1 hit · 1 pts
SeverityFileLineSnippetContext
LOWdocs/mm-converter.py78CODE