AI Slop Code Risk Monitor

typesense/typesense

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

Open Source alternative to Algolia + Pinecone and an Easier-to-Use alternative to ElasticSearch ⚡ 🔍 ✨ Fast, typo tolerant, in-memory fuzzy Search Engine for building delightful search experiences

1.5 Low pattern signal View on GitHub

Open-Source Code Quality, Security and Technical Debt Review

This report summarizes scanner evidence for typesense/typesense, a C++ project with 27,067 GitHub stars. SynthScan examined 303,999 lines of code across 383 source files, recording 592 pattern matches distributed across 6 syntactic categories. The legacy adjusted pattern signal is 1.5 (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.

1.5
Adjusted Signal
1.5
Raw Pattern Score
100%
Time Factor
2026-10-30
Last Push
27.1K
Stars
C++
Language
304.0K
Lines of Code
383
Files
592
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 6.8/100 · LOW

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

Hallucinated Dependency & Supply Chain Risk 0.2/100 · LOW

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

Agent Over-Engineering Ratio 0.4/100 · LOW

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

PR Review Velocity Impact 9.3/100 · LOW

Which changes need focused human review? 592 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 1LOW 591

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 592 distinct pattern matches across 6 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 Block539 hits · 368 pts
SeverityFileLineSnippetContext
LOWdocker/patches/brpc_cmakelists.txt1# Licensed to the Apache Software Foundation (ASF) under oneCOMMENT
LOWtest/collection_join_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/collection_curation_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/art_test.cpp1#include <fcntl.h>COMMENT
LOWtest/natural_language_search_model_manager_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/core_api_utils_test.cpp1#include "collection.h"COMMENT
LOWtest/collection_all_fields_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/batched_indexer_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/collection_specific_more_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/collection_vector_search_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/raft_server_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/union_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/http_client_pool_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/collection_manager_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/filter_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/filter_test.cpp3121 computed_by_probe = filter_iterator._get_computed_by_probe();COMMENT
LOWtest/api_acl_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/collection_test.cpp1#include <gtest/gtest.h>COMMENT
LOWtest/collection_test.cpp4861 auto search_res = search_res_op.get();COMMENT
LOWinclude/index.h1#pragma onceCOMMENT
LOWinclude/index.h21#include "match_score.h"COMMENT
LOWinclude/app_metrics.h1#pragma onceCOMMENT
LOWinclude/string_utils.h1#pragma onceCOMMENT
LOWinclude/json.hpp21#include <algorithm> // all_of, find, for_eachCOMMENT
LOWinclude/json.hpp41// SPDX-License-Identifier: MITCOMMENT
LOWinclude/json.hpp61 #if defined(NLOHMANN_JSON_VERSION_MAJOR) && defined(NLOHMANN_JSON_VERSION_MINOR) && defined(NLOHMANN_JSON_VERSION_PACOMMENT
LOWinclude/json.hpp81 #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS _diagCOMMENT
LOWinclude/json.hpp141#endifCOMMENT
LOWinclude/json.hpp161#include <array> // arrayCOMMENT
LOWinclude/json.hpp181COMMENT
LOWinclude/json.hpp201COMMENT
LOWinclude/json.hpp221// __ _____ _____ _____COMMENT
LOWinclude/json.hpp321// __ _____ _____ _____COMMENT
LOWinclude/json.hpp341 #undef JSON_HEDLEY_STRINGIFY_EXCOMMENT
LOWinclude/json.hpp361 #undef JSON_HEDLEY_CONCAT3_EXCOMMENT
LOWinclude/json.hpp381 #undef JSON_HEDLEY_VERSION_DECODE_MINORCOMMENT
LOWinclude/json.hpp401#endifCOMMENT
LOWinclude/json.hpp421#endifCOMMENT
LOWinclude/json.hpp441#if defined(JSON_HEDLEY_INTEL_VERSION_CHECK)COMMENT
LOWinclude/json.hpp461 #define JSON_HEDLEY_INTEL_CL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_INTEL_CL_VERSION >= JSON_HEDLEY_VERSION_ECOMMENT
LOWinclude/json.hpp481COMMENT
LOWinclude/json.hpp501 #define JSON_HEDLEY_SUNPRO_VERSION_CHECK(major,minor,patch) (0)COMMENT
LOWinclude/json.hpp521 #undef JSON_HEDLEY_ARM_VERSIONCOMMENT
LOWinclude/json.hpp541#if defined(__ibmxl__)COMMENT
LOWinclude/json.hpp561#if \COMMENT
LOWinclude/json.hpp581COMMENT
LOWinclude/json.hpp601#if defined(__TI_COMPILER_VERSION__) && defined(__MSP430__)COMMENT
LOWinclude/json.hpp621#if defined(JSON_HEDLEY_TI_ARMCL_VERSION_CHECK)COMMENT
LOWinclude/json.hpp641 #define JSON_HEDLEY_TI_CL6X_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL6X_VERSION >= JSON_HEDLEY_VERSION_ENCCOMMENT
LOWinclude/json.hpp661COMMENT
LOWinclude/json.hpp681#if defined(_CRAYC)COMMENT
LOWinclude/json.hpp701#if defined(__IAR_SYSTEMS_ICC__)COMMENT
LOWinclude/json.hpp721#if defined(__TINYC__)COMMENT
LOWinclude/json.hpp741#if defined(JSON_HEDLEY_DMC_VERSION_CHECK)COMMENT
LOWinclude/json.hpp761 #define JSON_HEDLEY_COMPCERT_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_COMPCERT_VERSION >= JSON_HEDLEY_VERSION_ECOMMENT
LOWinclude/json.hpp781COMMENT
LOWinclude/json.hpp821 #undef JSON_HEDLEY_GCC_VERSION_CHECKCOMMENT
LOWinclude/json.hpp841COMMENT
LOWinclude/json.hpp861 #undef JSON_HEDLEY_HAS_CPP_ATTRIBUTECOMMENT
LOWinclude/json.hpp881 (!defined(JSON_HEDLEY_MSVC_VERSION) || JSON_HEDLEY_MSVC_VERSION_CHECK(19,20,0))COMMENT
479 more matches not shown…
Hyper-Verbose Identifiers25 hits · 27 pts
SeverityFileLineSnippetContext
LOWbenchmark/src/global.ts132function restartTypesenseServerFresh(): ResultAsync<NodeConfig[], ErrorWithMessage> {CODE
LOWbenchmark/src/benchmarks/search.ts222function transformParamsToQueryString(params: SearchParams): string {CODE
LOWbenchmark/src/benchmarks/search.ts329function instantSearchQueriesForSearchPhrase(searchPhrase: string): string[] {CODE
LOWtests/src/global-typesense-manager.ts96function restartTypesenseServerFresh(): ResultAsync<NodeConfig[], ErrorWithMessage> {CODE
LOW⚡…/tests/reference_cluster_follower_node_restart.test.ts106function getTailFitmentCountPerMarket(): number {CODE
LOW⚡…/tests/reference_cluster_follower_node_restart.test.ts110function getExpectedProductCountPerMarket(): number {CODE
LOW⚡…/tests/reference_cluster_follower_node_restart.test.ts114function getExpectedVehicleCountPerMarket(): number {CODE
LOW⚡…/tests/reference_cluster_follower_node_restart.test.ts118function getExpectedFitmentCountPerMarket(market: MarketConfig): number {CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts314async function pollClusterHealthAndStats(nodes: MultiNodeConfig[], label: string): Promise<NodeDiagnosticsSnapshot[]> {CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts424async function waitForAppliedIndexAtLeast(node: MultiNodeConfig, index: number, timeoutMs: number): Promise<StatusResponCODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts453async function waitForConfigurationWithout(nodes: MultiNodeConfig[], removed: MultiNodeConfig, logSizes: number[],CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts463function seedLocalSnapshotFromLeader(leaderNode: MultiNodeConfig, followerNode: MultiNodeConfig) {CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts480function getLoggedInFlightRequestCount(node: MultiNodeConfig, verb: "Serialized" | "Restored", fromOffset: number): numbCODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts491async function waitForInFlightSnapshotLog(node: MultiNodeConfig, verb: "Serialized" | "Restored", fromOffset: number,CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts604function getVehicleIndexForNonTargetFitment(market: MarketConfig, productIndex: number, fitmentIndex: number): number {CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts737function getExistingNonTargetProductIndex(market: MarketConfig, ordinal: number): number {CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts817async function startOverlappingReferenceImports(leader: MultiNodeConfig): Promise<HeldImport[]> {CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts862function assertHeldImportSucceeded(response: string, label: string) {CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts891async function executeReferenceJoinSearch(market: MarketConfig, node: MultiNodeConfig): Promise<SearchExecution> {CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts979async function assertAllJoinQueriesSucceed(nodes: MultiNodeConfig[]) {CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts990async function waitForRestoredCollectionsToLoad(node: MultiNodeConfig, timeoutMs: number) {CODE
LOW…/tests/reference_cluster_follower_node_restart.test.ts1026async function assertRestoredReferenceSchemas(node: MultiNodeConfig) {CODE
LOWapi_tests/tests/nested_curly_filter.test.ts204async function highLoadSearchWithTimeout(filterBy: string, timeoutMs: number) {CODE
LOWapi_tests/src/request.ts116export async function waitForSingleAnalyticsFlush() {CODE
LOWapi_tests/src/request.ts130export async function waitForMultiAnalyticsFlush() {CODE
Verbosity Indicators7 hits · 15 pts
SeverityFileLineSnippetContext
LOW⚡include/parasort.h99// Step 1: Pick np*sf random elements from the input array.COMMENT
LOW⚡include/parasort.h104// Step 2: Count how many elements go into each bucket.COMMENT
LOW⚡include/parasort.h113// Step 3: Create a mapping scheme to separate partitions.COMMENT
LOW⚡include/parasort.h118// Step 4: Map the input array into np separate partitions.COMMENT
LOW⚡include/parasort.h126// Step 5: Sort each partition in a separate thread.COMMENT
LOW⚡include/parasort.h133// Step 6: Copy the temporary container for the sorted array into the input array.COMMENT
LOWsrc/collection.cpp5927 // we need to check if `array_i`exists within match_indices vec.COMMENT
Fake / Example Data14 hits · 14 pts
SeverityFileLineSnippetContext
LOWtest/collection_join_test.cpp2479 {"name": "dummy_id", "type": "string"}CODE
LOWtest/collection_join_test.cpp2501 search_op = coll->search("s", {"product_name"}, "$Dummy(dummy_id:=customer_a)", {}, {}, {0},CODE
LOWtest/collection_join_test.cpp10109 "display_name": "placeholder"CODE
LOWtest/collection_faceting_test.cpp4054 "name": "Acme Corp"CODE
LOWtest/collection_faceting_test.cpp4110 ASSERT_EQ("Acme Corp", result["facet_counts"][0]["counts"][0]["value"].get<std::string>());CODE
LOWtest/core_api_utils_test.cpp1874 {"name": "dummy_id", "type": "string"}CODE
LOWtest/collection_vector_search_test.cpp4224 const std::string long_text = "Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremqueCODE
LOWtest/collection_vector_search_test.cpp4224 const std::string long_text = "Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremqueCODE
LOWtest/collection_nested_fields_test.cpp333 "company_name": "Acme Corp",CODE
LOWtest/collection_nested_fields_test.cpp2737 "company_name": "Acme Corp",CODE
LOWtest/collection_manager_test.cpp1181 "api_key": "dummy-key",CODE
LOWtest/collection_test.cpp3550 {"Acme Corp", "Mexico", "Canadoo", "300"}CODE
LOWtest/collection_test.cpp5511 doc1["email"] = "bob.saget@example.org";CODE
LOWapi_tests/tests/documents.test.ts92 company_name: "Acme Corp",CODE
Structural Annotation Overuse6 hits · 14 pts
SeverityFileLineSnippetContext
LOW⚡include/parasort.h99// Step 1: Pick np*sf random elements from the input array.COMMENT
LOW⚡include/parasort.h104// Step 2: Count how many elements go into each bucket.COMMENT
LOW⚡include/parasort.h113// Step 3: Create a mapping scheme to separate partitions.COMMENT
LOW⚡include/parasort.h118// Step 4: Map the input array into np separate partitions.COMMENT
LOW⚡include/parasort.h126// Step 5: Sort each partition in a separate thread.COMMENT
LOW⚡include/parasort.h133// Step 6: Copy the temporary container for the sorted array into the input array.COMMENT
Self-Referential Comments1 hit · 3 pts
SeverityFileLineSnippetContext
MEDIUM.github/actions/bazel-setup/action.yml36 # Define the compilerCOMMENT