AI Slop Code Risk Monitor

trekhleb/javascript-algorithms

Name: trekhleb/javascript-algorithms — JavaScript Code Quality & Security Review | AI Slop Code Risk Monitor
Creator: AI Slop Code Risk Monitor

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

📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings

0.7 Low pattern signal View on GitHub

Open-Source Code Quality, Security and Technical Debt Review

This report summarizes scanner evidence for trekhleb/javascript-algorithms, a JavaScript project with 196,714 GitHub stars. SynthScan examined 55,593 lines of code across 623 source files, recording 37 pattern matches distributed across 4 syntactic categories. The legacy adjusted pattern signal is 0.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.

0.7

Adjusted Signal

0.7

Raw Pattern Score

100%

Time Factor

2026-07-26

Last Push

196.7K

Stars

JavaScript

Language

55.6K

Lines of Code

623

Files

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 2.5/100 · LOW

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

Hallucinated Dependency & Supply Chain Risk 1.2/100 · LOW

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

Agent Over-Engineering Ratio 1.6/100 · LOW

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

PR Review Velocity Impact 3.3/100 · LOW

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

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 37 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.

Hyper-Verbose Identifiers18 hits · 18 pts

Severity	File	Line	Snippet	Context
LOW	…nary-search-tree/__test__/BinarySearchTreeNode.test.js	209	function removeNotExistingElementFromTree() {	CODE
LOW	…algorithms/tree/depth-first-search/depthFirstSearch.js	43	export function depthFirstSearchRecursive(node, callbacks) {	CODE
LOW	…thms/linked-list/reverse-traversal/reverseTraversal.js	11	function reverseTraversalRecursive(node, callback) {	CODE
LOW	…lgorithms/graph/depth-first-search/depthFirstSearch.js	48	function depthFirstSearchRecursive(graph, currentVertex, previousVertex, callbacks) {	CODE
LOW	…thms/graph/eulerian-path/__test__/eulerianPath.test.js	8	function findEulerianPathInNotEulerianGraph() {	CODE
LOW	…/detect-cycle/detectUndirectedCycleUsingDisjointSet.js	8	export default function detectUndirectedCycleUsingDisjointSet(graph) {	CODE
LOW	…algorithms/graph/hamiltonian-cycle/hamiltonianCycle.js	56	function hamiltonianCycleRecursive({	CODE
LOW	…ly-connected-components/stronglyConnectedComponents.js	8	function getVerticesSortedByDfsFinishTime(graph) {	CODE
LOW	…ly-connected-components/stronglyConnectedComponents.js	119	export default function stronglyConnectedComponents(graph) {	CODE
LOW	…ath/euclidean-algorithm/euclideanAlgorithmIterative.js	7	export default function euclideanAlgorithmIterative(originalA, originalB) {	CODE
LOW	…h/fourier-transform/inverseDiscreteFourierTransform.js	16	export default function inverseDiscreteFourierTransform(	CODE
LOW	…ourier-transform/__test__/fastFourierTransform.test.js	10	function sequencesApproximatelyEqual(sequence1, sequence2, delta) {	CODE
LOW	…ommon-subsequence/longestCommonSubsequenceRecursive.js	9	export default function longestCommonSubsequenceRecursive(string1, string2) {	CODE
LOW	…orithms/sets/combinations/combineWithoutRepetitions.js	6	export default function combineWithoutRepetitions(comboOptions, comboLength) {	CODE
LOW	…st-common-supersequence/shortestCommonSupersequence.js	9	export default function shortestCommonSupersequence(set1, set2) {	CODE
LOW	…creasing-subsequence/dpLongestIncreasingSubsequence.js	8	export default function dpLongestIncreasingSubsequence(sequence) {	CODE
LOW	…ithms/sets/permutations/permutateWithoutRepetitions.js	5	export default function permutateWithoutRepetitions(permutationOptions) {	CODE
LOW	…gular-expression-matching/regularExpressionMatching.js	11	export default function regularExpressionMatching(string, pattern) {	CODE

Fake / Example Data10 hits · 13 pts

Severity	File	Line	Snippet	Context
LOW	…graphy/polynomial-hash/__test__/PolynomialHash.test.js	10	const text = 'Lorem Ipsum is simply dummy text of the printing and '	CODE
LOW	…graphy/polynomial-hash/__test__/PolynomialHash.test.js	11	+ 'typesetting industry. Lorem Ipsum has been the industry\'s standard '	CODE
LOW	…/polynomial-hash/__test__/SimplePolynomialHash.test.js	8	const text = 'Lorem Ipsum is simply dummy text of the printing and '	CODE
LOW	…/polynomial-hash/__test__/SimplePolynomialHash.test.js	9	+ 'typesetting industry. Lorem Ipsum has been the industry\'s standard '	CODE
LOW⚡	…lgorithms/string/rabin-karp/__test__/rabinKarp.test.js	19	const text = 'Lorem Ipsum is simply dummy text of the printing and '	CODE
LOW⚡	…lgorithms/string/rabin-karp/__test__/rabinKarp.test.js	20	+ 'typesetting industry. Lorem Ipsum has been the industry\'s standard '	CODE
LOW⚡	…lgorithms/string/rabin-karp/__test__/rabinKarp.test.js	26	+ 'containing Lorem Ipsum passages, and more recently with desktop'	CODE
LOW⚡	…lgorithms/string/rabin-karp/__test__/rabinKarp.test.js	32	expect(rabinKarp(text, 'versions of Lorem Ipsum.')).toBe(549);	CODE
LOW⚡	…lgorithms/string/rabin-karp/__test__/rabinKarp.test.js	33	expect(rabinKarp(text, 'versions of Lorem Ipsum:')).toBe(-1);	CODE
LOW⚡	…lgorithms/string/rabin-karp/__test__/rabinKarp.test.js	34	expect(rabinKarp(text, 'Lorem Ipsum passages, and more recently with')).toBe(446);	CODE

Over-Commented Block7 hits · 7 pts

Severity	File	Line	Snippet	Context
LOW	…st/reverse-traversal/__test__/reverseTraversal.test.js	21	});	COMMENT
LOW	src/algorithms/graph/floyd-warshall/floydWarshall.js	41	});	COMMENT
LOW	src/algorithms/math/bits/fullAdder.js	41	// The operands of all bitwise operators are converted to signed	COMMENT
LOW	src/algorithms/uncategorized/n-queens/nQueensBitwise.js	21	// Keeps track of the number of valid solutions.	COMMENT
LOW	src/algorithms/uncategorized/n-queens/nQueensBitwise.js	41	// queen there.	COMMENT
LOW	src/algorithms/string/z-algorithm/zAlgorithm.js	21	// Prefix: ab.......	COMMENT
LOW	src/algorithms/string/z-algorithm/zAlgorithm.js	61	// Calculate corresponding Z box shift. Because we want to copy the values	COMMENT

Verbosity Indicators2 hits · 3 pts

Severity	File	Line	Snippet	Context
LOW	…algorithms/graph/hamiltonian-cycle/hamiltonianCycle.js	68	// Now we need to check if it is cycle or not.	COMMENT
LOW	…gular-expression-matching/regularExpressionMatching.js	107	* we need to check if there was a match for the pattern and for the	COMMENT