AI Slop Code Risk Monitor

typedb/typedb

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

TypeDB: Built for systems, not records

0.3 Low pattern signal View on GitHub

Open-Source Code Quality, Security and Technical Debt Review

This report summarizes scanner evidence for typedb/typedb, a Rust project with 4,495 GitHub stars. SynthScan examined 190,482 lines of code across 675 source files, recording 49 pattern matches distributed across 3 syntactic categories. The legacy adjusted pattern signal is 0.3 (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.3
Adjusted Signal
0.3
Raw Pattern Score
100%
Time Factor
2026-10-29
Last Push
4.5K
Stars
Rust
Language
190.5K
Lines of Code
675
Files
49
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 1.4/100 · LOW

Can maintainers explain intent, assumptions, and trade-offs? 49 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 1.4/100 · LOW

Which changes need focused human review? 49 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 3LOW 46

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 49 distinct pattern matches across 3 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 Block45 hits · 45 pts
SeverityFileLineSnippetContext
LOWir/translation/function.rs321 if let Some(mismatch_index) = mismatching_index_opt {COMMENT
LOWir/translation/constraints.rs561// constraints: &mut ConstraintsBuilder<'_, '_>,COMMENT
LOWir/tests/pattern.rs121 let Stage::Match(match_) = stages.first().unwrap() else { unreachable!() };COMMENT
LOWir/tests/pipeline.rs21 },COMMENT
LOWencoding/graph/thing/vertex_attribute.rs681/// String encoding scheme uses 17 bytes:COMMENT
LOWserver/parameters/config.rs321 /// #[derive(Deserialize)]COMMENT
LOWserver/parameters/cli.rs21 /// Server listen address for gRPC connections (e.g., 0.0.0.0:1729)COMMENT
LOWserver/parameters/cli.rs41 /// Server advertise address for HTTP connections (e.g., http://127.0.0.1:8000)COMMENT
LOWserver/parameters/cli.rs61 /// The amount of seconds generated authentication tokens will remain valid, specified in seconds.COMMENT
LOWserver/parameters/cli.rs101 #[arg(long = "diagnostics.reporting.metrics")]COMMENT
LOWstorage/isolation_manager.rs361 f,COMMENT
LOWstorage/tests/test_isolation.rs621// fn isolation_manager_reads_evicted_from_disk() {COMMENT
LOWstorage/tests/test_isolation.rs641// snapshot_i.commit(&mut CommitProfile::disabled()).unwrap();COMMENT
LOWstorage/benches/bench_mvcc_storage.rs141 {COMMENT
LOW.cargo/config.toml21# codegen-units = 1COMMENT
LOWcommon/logger/result.rs21 E: fmt::Debug;COMMENT
LOWcommon/logger/log_panic.rs1// Licensed to the Apache Software Foundation (ASF) under oneCOMMENT
LOWcommon/logger/log_panic.rs21//!COMMENT
LOWcommon/logger/log_panic.rs41/// # #[allow(clippy::needless_doctest_main)]COMMENT
LOWcommon/logger/log_panic.rs61///COMMENT
LOWcommon/concurrency/tokio_task.rs21/// - When shutdown is observed, the tracker:COMMENT
LOWconcept/type_/type_manager.rs3201 // snapshot,COMMENT
LOWconcept/type_/type_manager/validation/validation.rs241 Ok(())COMMENT
LOWconcept/type_/type_manager/validation/validation.rs261// for capability in capabilities.into_iter().chain(not_stored_set_capabilities.iter().filter(|(_, is_set)| **is_setCOMMENT
LOWconcept/type_/type_manager/validation/validation.rs281//COMMENT
LOW…_/type_manager/validation/operation_time_validation.rs2181 // pub(crate) fn validate_relation_type_does_not_acquire_cascade_constraint_to_lose_instances_with_new_supertype(COMMENT
LOW…_/type_manager/validation/operation_time_validation.rs2201 // AnnotationCategory::Cascade,COMMENT
LOW…_/type_manager/validation/operation_time_validation.rs2221 // Self::has_instances_of_type(snapshot, thing_manager, type_.clone())COMMENT
LOW…_/type_manager/validation/operation_time_validation.rs3041 return Ok(());COMMENT
LOW.factory/automation.yml101 bazel test --config=ci $(bazel query 'kind(rust_test, //server/tests/...)') --test_output=streamedCOMMENT
LOWexecutor/tests/efficiency.rs1221 // 2 seeks: each of the 2 comparison check filters get the value of the Attribute repeatedly...COMMENT
LOWexecutor/tests/efficiency.rs1361 // open initial iterators: 2 seeks... HasReverse[age 10] finds Person 1. Has[unbound] finds Person 1 and attributesCOMMENT
LOWexecutor/tests/efficiency.rs1381 // => advance both iterators: 2 advances... run out of answers in HasReverse. Finished!COMMENT
LOWexecutor/instruction/isa_reverse_executor.rs301 ) -> Result<(), Box<ConceptReadError>> {COMMENT
LOWexecutor/instruction/isa_reverse_executor.rs321 // Ok(Some(Ordering::Greater))COMMENT
LOWexecutor/instruction/iterator.rs441 ) -> Result<Option<Ordering>, Box<ConceptReadError>> {COMMENT
LOWcompiler/transformation/relation_index.rs21 BlockAnnotations, ConstraintTypeAnnotations, IndexedRelationAnnotations, TypeAnnotations,COMMENT
LOWcompiler/transformation/transform.rs41 // - function inlining v1: if a function does not have recursion or sort/offset/limit, we could inline the function COMMENT
LOWcompiler/tests/transformation.rs381// TODO: we just want to add with an exclusitivity constraintCOMMENT
LOWcompiler/tests/transformation.rs401// let snapshot = storage.clone().open_snapshot_write();COMMENT
LOWcompiler/tests/transformation.rs421// run_test_relation_index_transformation_not_applied_attribute(snapshot, &type_manager)COMMENT
LOWcompiler/tests/transformation.rs441// type_manager,COMMENT
LOWcompiler/annotation/inference/match_inference.rs761 //COMMENT
LOWcompiler/annotation/inference/match_inference.rs781 // &BTreeMap::from([COMMENT
LOWtool/release/create_notes.sh1#!/usr/bin/env bashCOMMENT
AI Slop Vocabulary3 hits · 9 pts
SeverityFileLineSnippetContext
MEDIUM…ype_/type_manager/validation/commit_time_validation.rs80// the updated schema with the finalised snapshot is much-much-much simpler and more robustCOMMENT
MEDIUMexecutor/read/immediate_executor.rs170/// To avoid missing cartesian outputs when multiple variables are unbound, the executor can leverage aCOMMENT
MEDIUMexecutor/tests/efficiency.rs1487 // however, seeking through that iterator to search for a specific person with the required Has should also leverCOMMENT
TODO Padding1 hit · 2 pts
SeverityFileLineSnippetContext
LOWstorage/snapshot/buffer.rs117// TODO: implement our own alternative to BTreeMap, whichCOMMENT