AI Slop Code Risk Monitor

TheAlgorithms/Go

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

Algorithms and Data Structures implemented in Go for beginners, following best practices.

2.7 Low pattern signal View on GitHub

Open-Source Code Quality, Security and Technical Debt Review

This report summarizes scanner evidence for TheAlgorithms/Go, a Go project with 18,243 GitHub stars. SynthScan examined 34,383 lines of code across 513 source files, recording 87 pattern matches distributed across 4 syntactic categories. The legacy adjusted pattern signal is 2.7 (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.7
Adjusted Signal
2.7
Raw Pattern Score
100%
Time Factor
2026-08-03
Last Push
18.2K
Stars
Go
Language
34.4K
Lines of Code
513
Files
87
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.8/100 · LOW

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

Hallucinated Dependency & Supply Chain Risk 2.3/100 · LOW

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

Agent Over-Engineering Ratio 0.0/100 · LOW

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

PR Review Velocity Impact 11.9/100 · LOW

Which changes need focused human review? 87 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 87

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 87 distinct pattern matches across 4 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 Block65 hits · 65 pts
SeverityFileLineSnippetContext
LOWCONTRIBUTING.md81// description containing links, references,COMMENT
LOWstrings/bom/bom.go1package bomCOMMENT
LOWstrings/bom/bom.go21// log.Fatal("Not enough arguments. Two string arguments separated by spaces are required!")COMMENT
LOWstrings/bom/bom.go41// if err != nil {COMMENT
LOWstrings/bom/bom.go61COMMENT
LOWstrings/bom/bom.go81// prettyPrint(current, j, n, pos, t, oracle)COMMENT
LOWstrings/bom/bom.go101// fmt.Printf("\n\nElapsed %f secs\n", elapsed.Seconds())COMMENT
LOWstrings/bom/bom.go121// }COMMENT
LOWstrings/bom/bom.go141// createTransition(k, o, m+1, oracle)COMMENT
LOWstrings/bom/bom.go161// }COMMENT
LOWstrings/bom/bom.go181// // Returns ending state for transition σ(fromState,overChar), -1 if there is none.COMMENT
LOWstrings/bom/bom.go201COMMENT
LOWstrings/bom/bom.go221// }COMMENT
LOWstrings/genetic/genetic.go21// Value shows how close this species to the desired target, where 1 means,COMMENT
LOWstrings/guid/guid.go1// guid.goCOMMENT
LOWdynamic/abbreviation.go1// File: abbreviation.goCOMMENT
LOWdynamic/binomialcoefficient.go1// binomialcoefficient.goCOMMENT
LOWdynamic/traprainwater.go1// filename: traprainwater.goCOMMENT
LOWsort/simplesort.go1// simplesort.goCOMMENT
LOWgraph/kosaraju.go1// kosaraju.goCOMMENT
LOWgraph/depthfirstsearch.go61}COMMENT
LOWgraph/depthfirstsearch.go81// start := 1COMMENT
LOWgraph/kahn.go1// Kahn's algorithm computes a topological ordering of a directed acyclic graph (DAG).COMMENT
LOWgraph/unionfind.go1// Union Find Algorithm or Dynamic Connectivity algorithm, often implemented with the helpCOMMENT
LOWgraph/coloring/doc.go1// Package coloring provides implementation of different graph coloringCOMMENT
LOWother/nested/nestedbrackets.go1// Package nested provides functions for testingCOMMENT
LOWcipher/xor/xor.go1// Package xor is an encryption algorithm that operates the exclusive disjunction(XOR)COMMENT
LOWcipher/rsa/rsa.go1// rsa.goCOMMENT
LOWmath/pronicnumber.go1// pronicnumber.goCOMMENT
LOWmath/binomialcoefficient.go1// binomialcoefficient.goCOMMENT
LOWmath/liouville.go1// liouville.goCOMMENT
LOWmath/aliquotsum.go1// aliquotsum.goCOMMENT
LOWmath/perfectnumber.go1// perfectnumber.goCOMMENT
LOWmath/mobius.go1// mobius.goCOMMENT
LOWmath/pascal/pascaltriangle.go1// pascaltriangle.goCOMMENT
LOWmath/binary/sqrt.go1// sqrt.goCOMMENT
LOWmath/binary/arithmeticmean.go1// arithmeticmean.goCOMMENT
LOWmath/binary/abs.go1// abs.goCOMMENT
LOWmath/binary/checkisnumberpoweroftwo.go1// checkisnumberpoweroftwo.goCOMMENT
LOWmath/binary/reversebits.go1// reversebits.goCOMMENT
LOWmath/matrix/strassenmatrixmultiply.go1// filename: strassenmatrixmultiply.goCOMMENT
LOWmath/prime/twin.go1// twin.goCOMMENT
LOWmath/prime/millerrabintest.go1// This file implements two versions of the Miller-Rabin primality test.COMMENT
LOWmath/prime/millerrabintest.go141 // witnesses 2, 3, and 5 can determine theCOMMENT
LOWsearch/interpolation.go1package searchCOMMENT
LOWsearch/jump.go1// jump.goCOMMENT
LOWsqrt/sqrtdecomposition.go1// Package sqrt contains algorithms and data structures that contains a √n in their complexityCOMMENT
LOWcompression/huffmancoding.go1// huffman.goCOMMENT
LOWconversion/base64.go1// base64.goCOMMENT
LOWconversion/rgbhex.go1// rgbhex.goCOMMENT
LOWconversion/rgbhex.go21 // 00000000 00000000 <11011011> =COMMENT
LOWconversion/rgbhex.go41// RGBToHEX does exactly the opposite of HEXToRGB:COMMENT
LOWconversion/inttoroman.go21// IntToRoman converts an integer value to a roman numeral string. An error isCOMMENT
LOWchecksum/crc8.go1// crc8.goCOMMENT
LOWstructure/doc.go1// Package structure is a subpackage that is dedicated toCOMMENT
LOWstructure/circularqueue/circularqueuearray.go1// circularqueuearray.goCOMMENT
LOWstructure/tree/btree.go201 node.keys[j] = node.keys[j+1]COMMENT
LOWstructure/tree/btree.go261 // Case 2: key exists in a non-leaf nodeCOMMENT
LOWstructure/tree/btree.go301 }COMMENT
LOWstructure/linkedlist/doubly.go1package linkedlistCOMMENT
5 more matches not shown…
Fake / Example Data16 hits · 16 pts
SeverityFileLineSnippetContext
LOWhashing/sha256/sha256_test.go18 {"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna CODE
LOWhashing/sha256/sha256_test.go18 {"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna CODE
LOWhashing/sha256/sha256_test.go39 {"Lorem ipsum", "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore eCODE
LOWhashing/sha256/sha256_test.go39 {"Lorem ipsum", "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore eCODE
LOWcompression/huffmancoding_test.go36 `Lorem ipsum dolor sit amet, consectetur adipiscing elit,CODE
LOWcompression/huffmancoding_test.go36 `Lorem ipsum dolor sit amet, consectetur adipiscing elit,CODE
LOWconversion/base64_test.go15 {"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna CODE
LOWconversion/base64_test.go15 {"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna CODE
LOWconversion/base64_test.go37 {"Lorem ipsum", "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore eCODE
LOWconversion/base64_test.go37 {"Lorem ipsum", "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore eCODE
LOWconversion/base64_test.go59 {"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna CODE
LOWconversion/base64_test.go59 {"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna CODE
LOWconversion/base64_test.go81 {"Lorem ipsum", "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore eCODE
LOWconversion/base64_test.go81 {"Lorem ipsum", "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore eCODE
LOWconversion/base64_test.go102 {"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna CODE
LOWconversion/base64_test.go102 {"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna CODE
Verbosity Indicators3 hits · 7 pts
SeverityFileLineSnippetContext
LOW⚡graph/kosaraju.go19 // Step 1: Perform DFS and fill stack based on finish times.COMMENT
LOW⚡graph/kosaraju.go26 // Step 2: Create a transposed graph.COMMENT
LOW⚡graph/kosaraju.go29 // Step 3: Perform DFS on the transposed graph in the order defined by the stack.COMMENT
Structural Annotation Overuse3 hits · 7 pts
SeverityFileLineSnippetContext
LOW⚡graph/kosaraju.go19 // Step 1: Perform DFS and fill stack based on finish times.COMMENT
LOW⚡graph/kosaraju.go26 // Step 2: Create a transposed graph.COMMENT
LOW⚡graph/kosaraju.go29 // Step 3: Perform DFS on the transposed graph in the order defined by the stack.COMMENT