Public report of zylon-ai/private-gpt, published 25 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 25 October 2026, 02:28 UTC · Survey ID cd_b00ad84ca6a6446bb26c26e65d63f1f3
zylon-ai/private-gpt
Measured 25 October 2026, 02:24 UTC, at code version 0f6a2de
Regression: 1 dimension fell since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreAt riskDown 6 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 89,461 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 0.9 person-years · Weakest lens: Accessibility, 48
Findings by how serious they are
61 critical537 serious140 minor
19 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
25 October 2026, 02:24 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
64of 68 dimensions measured by tools. The other 4 are advisory notes from an AI model, which explain the code but don't count towards the score.
718of 738 findings point to an exact file and line, so you can open each one in the code. The other 20 concern the repository as a whole, such as missing documentation.
68dimensions across 8 lenses, read from 89,461 lines of product code in 2 projects.
zylon-ai/private-gpt scores 56 out of 100, but it is rated At risk while a critical security finding is open; the score itself is unchanged.
The weakest lens counts most in the score, and here that is Accessibility, which scores 48 and is rated Weak. Its Visual & motion safety dimension scores 1 out of 10, and until that reaches 4, Accessibility can't be rated higher than Adequate. The first actions are to resolve the 1 No ADRs found finding(s) in ADR Quality and to keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1, and if Accessibility rose to 70, the score would rise from 56 to about 62.
61 findings are critical: 33 in Static Analysis (SAST), 23 in Dependency Vulnerabilities, two in Forms & labels, one in ARIA correctness, one in IaC & Container Security and one in Secret Scanning.
Watchdog couldn't measure 18 dimensions in this code, among them Code Coverage, Test Reliability and Navigability, so they are left out of the score. The product code is 89,461 lines, which would take an estimated 0.9 person-years, around €140,000, to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Visual & motion safety · Focus outline removed in CSS without a :focus replacement REDACTED
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 45 findings
These 45 critical or serious findings were in the previous survey, on 11 October 2026, and are gone from this one.
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · Medium CVE: [GHSA redacted] REDACTED
Supply-chain Provenance & Signing · PR-triggered workflow without a permissions block
Supply-chain Provenance & Signing · Workflow holding a long-lived secret is unscoped
Exception handling · Swallowed exception (caught, then discarded) private_gpt/server/chat/interceptors/skills_validation_interceptor.py
Exception handling · Swallowed exception (caught, then discarded) REDACTED
Exception handling · Swallowed exception (caught, then discarded) private_gpt/server/ingest/uri_loader.py
Exception handling · Swallowed exception (caught, then discarded) private_gpt/server/utils/artifact_input.py
Exception handling · Swallowed exception (caught, then discarded) private_gpt/server/utils/artifact_input.py
Exception handling · Swallowed exception (caught, then discarded) private_gpt/server/utils/artifact_input.py
Rebuild cost: about €140,000 · Estimate
Cost to rebuild
€45,000 to €230,000, for 756 to 2,398 hours of work, about 0.9 person-years for 1 to 2 engineers
Difficulty of the problem
Low, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.8 at a score of 56. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 89,461 lines of product code
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 4 points · Low effort · ADR Quality
2
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
Raises the score by about 4 points · Medium effort · A11y enforcement
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €140,000 to build again, about 0.9 person-years of work. Its weakest lens is Accessibility, at 48 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 4 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.3 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 53,456 lines over the last 90 days, which is about 216,794 lines a year. At that pace, the extra work comes to an estimated 10.8 to 72.3 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
554 modules, with 916 dependencies between them. Every module uses only modules listed above it, so there are no loops.
The table shows the 40 modules with the most connections; 514 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
components.chat.models.chat_config_models uses chat.input_models, so a change to chat.input_models can break components.chat.models.chat_config_models, while a change to components.chat.models.chat_config_models can't break chat.input_models.
Position
Below the diagonal: components.chat.models.chat_config_models uses a module listed above it, which is the healthy direction.
components.chat.models.chat_config_models uses settings.settings, so a change to settings.settings can break components.chat.models.chat_config_models, while a change to components.chat.models.chat_config_models can't break settings.settings.
Position
Below the diagonal: components.chat.models.chat_config_models uses a module listed above it, which is the healthy direction.
components.code_execution.base uses settings.settings, so a change to settings.settings can break components.code_execution.base, while a change to components.code_execution.base can't break settings.settings.
Position
Below the diagonal: components.code_execution.base uses a module listed above it, which is the healthy direction.
components.embedding.embedding_component uses settings.settings, so a change to settings.settings can break components.embedding.embedding_component, while a change to components.embedding.embedding_component can't break settings.settings.
Position
Below the diagonal: components.embedding.embedding_component uses a module listed above it, which is the healthy direction.
components.ingest.parse_component uses components.ingest.utils, so a change to components.ingest.utils can break components.ingest.parse_component, while a change to components.ingest.parse_component can't break components.ingest.utils.
Position
Below the diagonal: components.ingest.parse_component uses a module listed above it, which is the healthy direction.
components.ingest.parse_component uses settings.settings, so a change to settings.settings can break components.ingest.parse_component, while a change to components.ingest.parse_component can't break settings.settings.
Position
Below the diagonal: components.ingest.parse_component uses a module listed above it, which is the healthy direction.
components.llm.factories.base uses settings.settings, so a change to settings.settings can break components.llm.factories.base, while a change to components.llm.factories.base can't break settings.settings.
Position
Below the diagonal: components.llm.factories.base uses a module listed above it, which is the healthy direction.
components.llm.llm_component uses settings.settings, so a change to settings.settings can break components.llm.llm_component, while a change to components.llm.llm_component can't break settings.settings.
Position
Below the diagonal: components.llm.llm_component uses a module listed above it, which is the healthy direction.
components.readers.base_reader uses components.ingest.utils, so a change to components.ingest.utils can break components.readers.base_reader, while a change to components.readers.base_reader can't break components.ingest.utils.
Position
Below the diagonal: components.readers.base_reader uses a module listed above it, which is the healthy direction.
components.sandbox.base uses settings.settings, so a change to settings.settings can break components.sandbox.base, while a change to components.sandbox.base can't break settings.settings.
Position
Below the diagonal: components.sandbox.base uses a module listed above it, which is the healthy direction.
components.skills.services.skill_service uses components.skills.models.skill_entities, so a change to components.skills.models.skill_entities can break components.skills.services.skill_service, while a change to components.skills.services.skill_service can't break components.skills.models.skill_entities.
Position
Below the diagonal: components.skills.services.skill_service uses a module listed above it, which is the healthy direction.
components.skills.services.skill_service uses settings.settings, so a change to settings.settings can break components.skills.services.skill_service, while a change to components.skills.services.skill_service can't break settings.settings.
Position
Below the diagonal: components.skills.services.skill_service uses a module listed above it, which is the healthy direction.
server.chat.interceptors.chat_interceptor_service uses components.prompts.prompt_builder, so a change to components.prompts.prompt_builder can break server.chat.interceptors.chat_interceptor_service, while a change to server.chat.interceptors.chat_interceptor_service can't break components.prompts.prompt_builder.
Position
Below the diagonal: server.chat.interceptors.chat_interceptor_service uses a module listed above it, which is the healthy direction.
server.chat.interceptors.chat_interceptor_service uses settings.settings, so a change to settings.settings can break server.chat.interceptors.chat_interceptor_service, while a change to server.chat.interceptors.chat_interceptor_service can't break settings.settings.
Position
Below the diagonal: server.chat.interceptors.chat_interceptor_service uses a module listed above it, which is the healthy direction.
server.files.file_service uses settings.settings, so a change to settings.settings can break server.files.file_service, while a change to server.files.file_service can't break settings.settings.
Position
Below the diagonal: server.files.file_service uses a module listed above it, which is the healthy direction.
components.code_execution.code_execution_component uses settings.settings, so a change to settings.settings can break components.code_execution.code_execution_component, while a change to components.code_execution.code_execution_component can't break settings.settings.
Position
Below the diagonal: components.code_execution.code_execution_component uses a module listed above it, which is the healthy direction.
components.code_execution.code_execution_component uses components.code_execution.base, so a change to components.code_execution.base can break components.code_execution.code_execution_component, while a change to components.code_execution.code_execution_component can't break components.code_execution.base.
Position
Below the diagonal: components.code_execution.code_execution_component uses a module listed above it, which is the healthy direction.
components.engines.chat.models.chat_state uses components.chat.models.chat_config_models, so a change to components.chat.models.chat_config_models can break components.engines.chat.models.chat_state, while a change to components.engines.chat.models.chat_state can't break components.chat.models.chat_config_models.
Position
Below the diagonal: components.engines.chat.models.chat_state uses a module listed above it, which is the healthy direction.
components.readers.factories.base uses settings.settings, so a change to settings.settings can break components.readers.factories.base, while a change to components.readers.factories.base can't break settings.settings.
Position
Below the diagonal: components.readers.factories.base uses a module listed above it, which is the healthy direction.
components.readers.factories.base uses components.readers.base_reader, so a change to components.readers.base_reader can break components.readers.factories.base, while a change to components.readers.factories.base can't break components.readers.base_reader.
Position
Below the diagonal: components.readers.factories.base uses a module listed above it, which is the healthy direction.
components.tools.builders.summary_builder uses chat.extensions.context_filter, so a change to chat.extensions.context_filter can break components.tools.builders.summary_builder, while a change to components.tools.builders.summary_builder can't break chat.extensions.context_filter.
Position
Below the diagonal: components.tools.builders.summary_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.summary_builder uses components.prompts.prompt_builder, so a change to components.prompts.prompt_builder can break components.tools.builders.summary_builder, while a change to components.tools.builders.summary_builder can't break components.prompts.prompt_builder.
Position
Below the diagonal: components.tools.builders.summary_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.summary_builder uses settings.settings, so a change to settings.settings can break components.tools.builders.summary_builder, while a change to components.tools.builders.summary_builder can't break settings.settings.
Position
Below the diagonal: components.tools.builders.summary_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.summary_builder uses components.chat.models.chat_config_models, so a change to components.chat.models.chat_config_models can break components.tools.builders.summary_builder, while a change to components.tools.builders.summary_builder can't break components.chat.models.chat_config_models.
Position
Below the diagonal: components.tools.builders.summary_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.summary_builder uses components.llm.llm_component, so a change to components.llm.llm_component can break components.tools.builders.summary_builder, while a change to components.tools.builders.summary_builder can't break components.llm.llm_component.
Position
Below the diagonal: components.tools.builders.summary_builder uses a module listed above it, which is the healthy direction.
components.tools.processors.base uses components.chat.models.chat_config_models, so a change to components.chat.models.chat_config_models can break components.tools.processors.base, while a change to components.tools.processors.base can't break components.chat.models.chat_config_models.
Position
Below the diagonal: components.tools.processors.base uses a module listed above it, which is the healthy direction.
components.tools.remote_execution uses components.chat.models.chat_config_models, so a change to components.chat.models.chat_config_models can break components.tools.remote_execution, while a change to components.tools.remote_execution can't break components.chat.models.chat_config_models.
Position
Below the diagonal: components.tools.remote_execution uses a module listed above it, which is the healthy direction.
components.tools.tool_pipeline uses components.chat.models.chat_config_models, so a change to components.chat.models.chat_config_models can break components.tools.tool_pipeline, while a change to components.tools.tool_pipeline can't break components.chat.models.chat_config_models.
Position
Below the diagonal: components.tools.tool_pipeline uses a module listed above it, which is the healthy direction.
components.vector_store.vector_store_component uses settings.settings, so a change to settings.settings can break components.vector_store.vector_store_component, while a change to components.vector_store.vector_store_component can't break settings.settings.
Position
Below the diagonal: components.vector_store.vector_store_component uses a module listed above it, which is the healthy direction.
components.vector_store.vector_store_component uses components.embedding.embedding_component, so a change to components.embedding.embedding_component can break components.vector_store.vector_store_component, while a change to components.vector_store.vector_store_component can't break components.embedding.embedding_component.
Position
Below the diagonal: components.vector_store.vector_store_component uses a module listed above it, which is the healthy direction.
components.engines.chat.async_chat_engine uses components.chat.models.chat_config_models, so a change to components.chat.models.chat_config_models can break components.engines.chat.async_chat_engine, while a change to components.engines.chat.async_chat_engine can't break components.chat.models.chat_config_models.
Position
Below the diagonal: components.engines.chat.async_chat_engine uses a module listed above it, which is the healthy direction.
components.engines.chat.async_chat_engine uses components.llm.llm_component, so a change to components.llm.llm_component can break components.engines.chat.async_chat_engine, while a change to components.engines.chat.async_chat_engine can't break components.llm.llm_component.
Position
Below the diagonal: components.engines.chat.async_chat_engine uses a module listed above it, which is the healthy direction.
components.engines.chat.async_chat_engine uses components.engines.chat.models.chat_state, so a change to components.engines.chat.models.chat_state can break components.engines.chat.async_chat_engine, while a change to components.engines.chat.async_chat_engine can't break components.engines.chat.models.chat_state.
Position
Below the diagonal: components.engines.chat.async_chat_engine uses a module listed above it, which is the healthy direction.
components.engines.chat.models.chat_interceptor_context uses components.engines.chat.models.chat_state, so a change to components.engines.chat.models.chat_state can break components.engines.chat.models.chat_interceptor_context, while a change to components.engines.chat.models.chat_interceptor_context can't break components.engines.chat.models.chat_state.
Position
Below the diagonal: components.engines.chat.models.chat_interceptor_context uses a module listed above it, which is the healthy direction.
components.node_store.node_store_component uses settings.settings, so a change to settings.settings can break components.node_store.node_store_component, while a change to components.node_store.node_store_component can't break settings.settings.
Position
Below the diagonal: components.node_store.node_store_component uses a module listed above it, which is the healthy direction.
components.node_store.node_store_component uses components.vector_store.vector_store_component, so a change to components.vector_store.vector_store_component can break components.node_store.node_store_component, while a change to components.node_store.node_store_component can't break components.vector_store.vector_store_component.
Position
Below the diagonal: components.node_store.node_store_component uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in components.engines.chat.interceptors.chat_interceptor uses a type in components.engines.chat.models.chat_interceptor_context.
components.engines.chat.interceptors.chat_interceptor uses components.engines.chat.models.chat_interceptor_context, so a change to components.engines.chat.models.chat_interceptor_context can break components.engines.chat.interceptors.chat_interceptor, while a change to components.engines.chat.interceptors.chat_interceptor can't break components.engines.chat.models.chat_interceptor_context.
Position
Below the diagonal: components.engines.chat.interceptors.chat_interceptor uses a module listed above it, which is the healthy direction.
components.engines.chat.resumable_runner uses settings.settings, so a change to settings.settings can break components.engines.chat.resumable_runner, while a change to components.engines.chat.resumable_runner can't break settings.settings.
Position
Below the diagonal: components.engines.chat.resumable_runner uses a module listed above it, which is the healthy direction.
components.engines.chat.resumable_runner uses components.chat.models.chat_config_models, so a change to components.chat.models.chat_config_models can break components.engines.chat.resumable_runner, while a change to components.engines.chat.resumable_runner can't break components.chat.models.chat_config_models.
Position
Below the diagonal: components.engines.chat.resumable_runner uses a module listed above it, which is the healthy direction.
components.engines.chat.resumable_runner uses components.engines.chat.models.chat_state, so a change to components.engines.chat.models.chat_state can break components.engines.chat.resumable_runner, while a change to components.engines.chat.resumable_runner can't break components.engines.chat.models.chat_state.
Position
Below the diagonal: components.engines.chat.resumable_runner uses a module listed above it, which is the healthy direction.
components.engines.chat.resumable_runner uses components.engines.chat.async_chat_engine, so a change to components.engines.chat.async_chat_engine can break components.engines.chat.resumable_runner, while a change to components.engines.chat.resumable_runner can't break components.engines.chat.async_chat_engine.
Position
Below the diagonal: components.engines.chat.resumable_runner uses a module listed above it, which is the healthy direction.
components.ingest.ingest_component uses components.ingest.utils, so a change to components.ingest.utils can break components.ingest.ingest_component, while a change to components.ingest.ingest_component can't break components.ingest.utils.
Position
Below the diagonal: components.ingest.ingest_component uses a module listed above it, which is the healthy direction.
components.ingest.ingest_component uses settings.settings, so a change to settings.settings can break components.ingest.ingest_component, while a change to components.ingest.ingest_component can't break settings.settings.
Position
Below the diagonal: components.ingest.ingest_component uses a module listed above it, which is the healthy direction.
components.ingest.ingest_component uses components.embedding.embedding_component, so a change to components.embedding.embedding_component can break components.ingest.ingest_component, while a change to components.ingest.ingest_component can't break components.embedding.embedding_component.
Position
Below the diagonal: components.ingest.ingest_component uses a module listed above it, which is the healthy direction.
components.ingest.ingest_component uses components.ingest.parse_component, so a change to components.ingest.parse_component can break components.ingest.ingest_component, while a change to components.ingest.ingest_component can't break components.ingest.parse_component.
Position
Below the diagonal: components.ingest.ingest_component uses a module listed above it, which is the healthy direction.
components.ingest.ingest_component uses components.llm.llm_component, so a change to components.llm.llm_component can break components.ingest.ingest_component, while a change to components.ingest.ingest_component can't break components.llm.llm_component.
Position
Below the diagonal: components.ingest.ingest_component uses a module listed above it, which is the healthy direction.
components.ingest.ingest_component uses components.node_store.node_store_component, so a change to components.node_store.node_store_component can break components.ingest.ingest_component, while a change to components.ingest.ingest_component can't break components.node_store.node_store_component.
Position
Below the diagonal: components.ingest.ingest_component uses a module listed above it, which is the healthy direction.
components.tools.builders.semantic_search_builder uses chat.extensions.context_filter, so a change to chat.extensions.context_filter can break components.tools.builders.semantic_search_builder, while a change to components.tools.builders.semantic_search_builder can't break chat.extensions.context_filter.
Position
Below the diagonal: components.tools.builders.semantic_search_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.semantic_search_builder uses components.prompts.prompt_builder, so a change to components.prompts.prompt_builder can break components.tools.builders.semantic_search_builder, while a change to components.tools.builders.semantic_search_builder can't break components.prompts.prompt_builder.
Position
Below the diagonal: components.tools.builders.semantic_search_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.semantic_search_builder uses settings.settings, so a change to settings.settings can break components.tools.builders.semantic_search_builder, while a change to components.tools.builders.semantic_search_builder can't break settings.settings.
Position
Below the diagonal: components.tools.builders.semantic_search_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.semantic_search_builder uses components.chat.models.chat_config_models, so a change to components.chat.models.chat_config_models can break components.tools.builders.semantic_search_builder, while a change to components.tools.builders.semantic_search_builder can't break components.chat.models.chat_config_models.
Position
Below the diagonal: components.tools.builders.semantic_search_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.semantic_search_builder uses components.embedding.embedding_component, so a change to components.embedding.embedding_component can break components.tools.builders.semantic_search_builder, while a change to components.tools.builders.semantic_search_builder can't break components.embedding.embedding_component.
Position
Below the diagonal: components.tools.builders.semantic_search_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.semantic_search_builder uses components.ingest.parse_component, so a change to components.ingest.parse_component can break components.tools.builders.semantic_search_builder, while a change to components.tools.builders.semantic_search_builder can't break components.ingest.parse_component.
Position
Below the diagonal: components.tools.builders.semantic_search_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.semantic_search_builder uses components.llm.llm_component, so a change to components.llm.llm_component can break components.tools.builders.semantic_search_builder, while a change to components.tools.builders.semantic_search_builder can't break components.llm.llm_component.
Position
Below the diagonal: components.tools.builders.semantic_search_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.semantic_search_builder uses components.vector_store.vector_store_component, so a change to components.vector_store.vector_store_component can break components.tools.builders.semantic_search_builder, while a change to components.tools.builders.semantic_search_builder can't break components.vector_store.vector_store_component.
Position
Below the diagonal: components.tools.builders.semantic_search_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.semantic_search_builder uses components.node_store.node_store_component, so a change to components.node_store.node_store_component can break components.tools.builders.semantic_search_builder, while a change to components.tools.builders.semantic_search_builder can't break components.node_store.node_store_component.
Position
Below the diagonal: components.tools.builders.semantic_search_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.semantic_search_builder uses components.ingest.ingest_component, so a change to components.ingest.ingest_component can break components.tools.builders.semantic_search_builder, while a change to components.tools.builders.semantic_search_builder can't break components.ingest.ingest_component.
Position
Below the diagonal: components.tools.builders.semantic_search_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.tabular_data_builder uses chat.extensions.context_filter, so a change to chat.extensions.context_filter can break components.tools.builders.tabular_data_builder, while a change to components.tools.builders.tabular_data_builder can't break chat.extensions.context_filter.
Position
Below the diagonal: components.tools.builders.tabular_data_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.tabular_data_builder uses chat.input_models, so a change to chat.input_models can break components.tools.builders.tabular_data_builder, while a change to components.tools.builders.tabular_data_builder can't break chat.input_models.
Position
Below the diagonal: components.tools.builders.tabular_data_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.tabular_data_builder uses settings.settings, so a change to settings.settings can break components.tools.builders.tabular_data_builder, while a change to components.tools.builders.tabular_data_builder can't break settings.settings.
Position
Below the diagonal: components.tools.builders.tabular_data_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.tabular_data_builder uses components.chat.models.chat_config_models, so a change to components.chat.models.chat_config_models can break components.tools.builders.tabular_data_builder, while a change to components.tools.builders.tabular_data_builder can't break components.chat.models.chat_config_models.
Position
Below the diagonal: components.tools.builders.tabular_data_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.tabular_data_builder uses components.embedding.embedding_component, so a change to components.embedding.embedding_component can break components.tools.builders.tabular_data_builder, while a change to components.tools.builders.tabular_data_builder can't break components.embedding.embedding_component.
Position
Below the diagonal: components.tools.builders.tabular_data_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.tabular_data_builder uses components.ingest.parse_component, so a change to components.ingest.parse_component can break components.tools.builders.tabular_data_builder, while a change to components.tools.builders.tabular_data_builder can't break components.ingest.parse_component.
Position
Below the diagonal: components.tools.builders.tabular_data_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.tabular_data_builder uses components.llm.llm_component, so a change to components.llm.llm_component can break components.tools.builders.tabular_data_builder, while a change to components.tools.builders.tabular_data_builder can't break components.llm.llm_component.
Position
Below the diagonal: components.tools.builders.tabular_data_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.tabular_data_builder uses components.vector_store.vector_store_component, so a change to components.vector_store.vector_store_component can break components.tools.builders.tabular_data_builder, while a change to components.tools.builders.tabular_data_builder can't break components.vector_store.vector_store_component.
Position
Below the diagonal: components.tools.builders.tabular_data_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.tabular_data_builder uses components.node_store.node_store_component, so a change to components.node_store.node_store_component can break components.tools.builders.tabular_data_builder, while a change to components.tools.builders.tabular_data_builder can't break components.node_store.node_store_component.
Position
Below the diagonal: components.tools.builders.tabular_data_builder uses a module listed above it, which is the healthy direction.
components.tools.builders.tabular_data_builder uses components.ingest.ingest_component, so a change to components.ingest.ingest_component can break components.tools.builders.tabular_data_builder, while a change to components.tools.builders.tabular_data_builder can't break components.ingest.ingest_component.
Position
Below the diagonal: components.tools.builders.tabular_data_builder uses a module listed above it, which is the healthy direction.
components.tools.tool_factories uses components.prompts.prompt_builder, so a change to components.prompts.prompt_builder can break components.tools.tool_factories, while a change to components.tools.tool_factories can't break components.prompts.prompt_builder.
Position
Below the diagonal: components.tools.tool_factories uses a module listed above it, which is the healthy direction.
components.tools.tool_factories uses settings.settings, so a change to settings.settings can break components.tools.tool_factories, while a change to components.tools.tool_factories can't break settings.settings.
Position
Below the diagonal: components.tools.tool_factories uses a module listed above it, which is the healthy direction.
components.tools.tool_factories uses components.embedding.embedding_component, so a change to components.embedding.embedding_component can break components.tools.tool_factories, while a change to components.tools.tool_factories can't break components.embedding.embedding_component.
Position
Below the diagonal: components.tools.tool_factories uses a module listed above it, which is the healthy direction.
components.tools.tool_factories uses components.ingest.parse_component, so a change to components.ingest.parse_component can break components.tools.tool_factories, while a change to components.tools.tool_factories can't break components.ingest.parse_component.
Position
Below the diagonal: components.tools.tool_factories uses a module listed above it, which is the healthy direction.
components.tools.tool_factories uses components.llm.llm_component, so a change to components.llm.llm_component can break components.tools.tool_factories, while a change to components.tools.tool_factories can't break components.llm.llm_component.
Position
Below the diagonal: components.tools.tool_factories uses a module listed above it, which is the healthy direction.
components.tools.tool_factories uses server.files.file_service, so a change to server.files.file_service can break components.tools.tool_factories, while a change to components.tools.tool_factories can't break server.files.file_service.
Position
Below the diagonal: components.tools.tool_factories uses a module listed above it, which is the healthy direction.
components.tools.tool_factories uses components.tools.builders.summary_builder, so a change to components.tools.builders.summary_builder can break components.tools.tool_factories, while a change to components.tools.tool_factories can't break components.tools.builders.summary_builder.
Position
Below the diagonal: components.tools.tool_factories uses a module listed above it, which is the healthy direction.
components.tools.tool_factories uses components.vector_store.vector_store_component, so a change to components.vector_store.vector_store_component can break components.tools.tool_factories, while a change to components.tools.tool_factories can't break components.vector_store.vector_store_component.
Position
Below the diagonal: components.tools.tool_factories uses a module listed above it, which is the healthy direction.
components.tools.tool_factories uses components.node_store.node_store_component, so a change to components.node_store.node_store_component can break components.tools.tool_factories, while a change to components.tools.tool_factories can't break components.node_store.node_store_component.
Position
Below the diagonal: components.tools.tool_factories uses a module listed above it, which is the healthy direction.
components.tools.tool_factories uses components.ingest.ingest_component, so a change to components.ingest.ingest_component can break components.tools.tool_factories, while a change to components.tools.tool_factories can't break components.ingest.ingest_component.
Position
Below the diagonal: components.tools.tool_factories uses a module listed above it, which is the healthy direction.
server.chat.chat_service uses chat.input_models, so a change to chat.input_models can break server.chat.chat_service, while a change to server.chat.chat_service can't break chat.input_models.
Position
Below the diagonal: server.chat.chat_service uses a module listed above it, which is the healthy direction.
server.chat.chat_service uses settings.settings, so a change to settings.settings can break server.chat.chat_service, while a change to server.chat.chat_service can't break settings.settings.
Position
Below the diagonal: server.chat.chat_service uses a module listed above it, which is the healthy direction.
server.chat.chat_service uses components.chat.models.chat_config_models, so a change to components.chat.models.chat_config_models can break server.chat.chat_service, while a change to server.chat.chat_service can't break components.chat.models.chat_config_models.
Position
Below the diagonal: server.chat.chat_service uses a module listed above it, which is the healthy direction.
server.chat.chat_service uses components.embedding.embedding_component, so a change to components.embedding.embedding_component can break server.chat.chat_service, while a change to server.chat.chat_service can't break components.embedding.embedding_component.
Position
Below the diagonal: server.chat.chat_service uses a module listed above it, which is the healthy direction.
server.chat.chat_service uses components.llm.llm_component, so a change to components.llm.llm_component can break server.chat.chat_service, while a change to server.chat.chat_service can't break components.llm.llm_component.
Position
Below the diagonal: server.chat.chat_service uses a module listed above it, which is the healthy direction.
server.chat.chat_service uses server.chat.interceptors.chat_interceptor_service, so a change to server.chat.interceptors.chat_interceptor_service can break server.chat.chat_service, while a change to server.chat.chat_service can't break server.chat.interceptors.chat_interceptor_service.
Position
Below the diagonal: server.chat.chat_service uses a module listed above it, which is the healthy direction.
server.chat.chat_service uses components.vector_store.vector_store_component, so a change to components.vector_store.vector_store_component can break server.chat.chat_service, while a change to server.chat.chat_service can't break components.vector_store.vector_store_component.
Position
Below the diagonal: server.chat.chat_service uses a module listed above it, which is the healthy direction.
server.chat.chat_service uses components.engines.chat.async_chat_engine, so a change to components.engines.chat.async_chat_engine can break server.chat.chat_service, while a change to server.chat.chat_service can't break components.engines.chat.async_chat_engine.
Position
Below the diagonal: server.chat.chat_service uses a module listed above it, which is the healthy direction.
server.chat.chat_service uses components.node_store.node_store_component, so a change to components.node_store.node_store_component can break server.chat.chat_service, while a change to server.chat.chat_service can't break components.node_store.node_store_component.
Position
Below the diagonal: server.chat.chat_service uses a module listed above it, which is the healthy direction.
server.chat.chat_service uses components.ingest.ingest_component, so a change to components.ingest.ingest_component can break server.chat.chat_service, while a change to server.chat.chat_service can't break components.ingest.ingest_component.
Position
Below the diagonal: server.chat.chat_service uses a module listed above it, which is the healthy direction.
server.content.content_service uses chat.extensions.context_filter, so a change to chat.extensions.context_filter can break server.content.content_service, while a change to server.content.content_service can't break chat.extensions.context_filter.
Position
Below the diagonal: server.content.content_service uses a module listed above it, which is the healthy direction.
server.content.content_service uses components.readers.nodes.tree_node, so a change to components.readers.nodes.tree_node can break server.content.content_service, while a change to server.content.content_service can't break components.readers.nodes.tree_node.
Position
Below the diagonal: server.content.content_service uses a module listed above it, which is the healthy direction.
server.content.content_service uses settings.settings, so a change to settings.settings can break server.content.content_service, while a change to server.content.content_service can't break settings.settings.
Position
Below the diagonal: server.content.content_service uses a module listed above it, which is the healthy direction.
server.content.content_service uses components.embedding.embedding_component, so a change to components.embedding.embedding_component can break server.content.content_service, while a change to server.content.content_service can't break components.embedding.embedding_component.
Position
Below the diagonal: server.content.content_service uses a module listed above it, which is the healthy direction.
server.content.content_service uses components.ingest.parse_component, so a change to components.ingest.parse_component can break server.content.content_service, while a change to server.content.content_service can't break components.ingest.parse_component.
Position
Below the diagonal: server.content.content_service uses a module listed above it, which is the healthy direction.
server.content.content_service uses components.llm.llm_component, so a change to components.llm.llm_component can break server.content.content_service, while a change to server.content.content_service can't break components.llm.llm_component.
Position
Below the diagonal: server.content.content_service uses a module listed above it, which is the healthy direction.
server.content.content_service uses components.vector_store.vector_store_component, so a change to components.vector_store.vector_store_component can break server.content.content_service, while a change to server.content.content_service can't break components.vector_store.vector_store_component.
Position
Below the diagonal: server.content.content_service uses a module listed above it, which is the healthy direction.
server.content.content_service uses components.node_store.node_store_component, so a change to components.node_store.node_store_component can break server.content.content_service, while a change to server.content.content_service can't break components.node_store.node_store_component.
Position
Below the diagonal: server.content.content_service uses a module listed above it, which is the healthy direction.
server.content.content_service uses components.ingest.ingest_component, so a change to components.ingest.ingest_component can break server.content.content_service, while a change to server.content.content_service can't break components.ingest.ingest_component.
Position
Below the diagonal: server.content.content_service uses a module listed above it, which is the healthy direction.
server.ingest.ingest_service uses settings.settings, so a change to settings.settings can break server.ingest.ingest_service, while a change to server.ingest.ingest_service can't break settings.settings.
Position
Below the diagonal: server.ingest.ingest_service uses a module listed above it, which is the healthy direction.
server.ingest.ingest_service uses components.embedding.embedding_component, so a change to components.embedding.embedding_component can break server.ingest.ingest_service, while a change to server.ingest.ingest_service can't break components.embedding.embedding_component.
Position
Below the diagonal: server.ingest.ingest_service uses a module listed above it, which is the healthy direction.
server.ingest.ingest_service uses components.ingest.parse_component, so a change to components.ingest.parse_component can break server.ingest.ingest_service, while a change to server.ingest.ingest_service can't break components.ingest.parse_component.
Position
Below the diagonal: server.ingest.ingest_service uses a module listed above it, which is the healthy direction.
server.ingest.ingest_service uses components.vector_store.vector_store_component, so a change to components.vector_store.vector_store_component can break server.ingest.ingest_service, while a change to server.ingest.ingest_service can't break components.vector_store.vector_store_component.
Position
Below the diagonal: server.ingest.ingest_service uses a module listed above it, which is the healthy direction.
server.ingest.ingest_service uses components.node_store.node_store_component, so a change to components.node_store.node_store_component can break server.ingest.ingest_service, while a change to server.ingest.ingest_service can't break components.node_store.node_store_component.
Position
Below the diagonal: server.ingest.ingest_service uses a module listed above it, which is the healthy direction.
server.ingest.ingest_service uses components.ingest.ingest_component, so a change to components.ingest.ingest_component can break server.ingest.ingest_service, while a change to server.ingest.ingest_service can't break components.ingest.ingest_component.
Position
Below the diagonal: server.ingest.ingest_service uses a module listed above it, which is the healthy direction.
server.primitives.semantic_search_service uses chat.extensions.context_filter, so a change to chat.extensions.context_filter can break server.primitives.semantic_search_service, while a change to server.primitives.semantic_search_service can't break chat.extensions.context_filter.
Position
Below the diagonal: server.primitives.semantic_search_service uses a module listed above it, which is the healthy direction.
server.primitives.semantic_search_service uses settings.settings, so a change to settings.settings can break server.primitives.semantic_search_service, while a change to server.primitives.semantic_search_service can't break settings.settings.
Position
Below the diagonal: server.primitives.semantic_search_service uses a module listed above it, which is the healthy direction.
server.primitives.semantic_search_service uses components.embedding.embedding_component, so a change to components.embedding.embedding_component can break server.primitives.semantic_search_service, while a change to server.primitives.semantic_search_service can't break components.embedding.embedding_component.
Position
Below the diagonal: server.primitives.semantic_search_service uses a module listed above it, which is the healthy direction.
server.primitives.semantic_search_service uses components.ingest.parse_component, so a change to components.ingest.parse_component can break server.primitives.semantic_search_service, while a change to server.primitives.semantic_search_service can't break components.ingest.parse_component.
Position
Below the diagonal: server.primitives.semantic_search_service uses a module listed above it, which is the healthy direction.
server.primitives.semantic_search_service uses components.llm.llm_component, so a change to components.llm.llm_component can break server.primitives.semantic_search_service, while a change to server.primitives.semantic_search_service can't break components.llm.llm_component.
Position
Below the diagonal: server.primitives.semantic_search_service uses a module listed above it, which is the healthy direction.
server.primitives.semantic_search_service uses components.vector_store.vector_store_component, so a change to components.vector_store.vector_store_component can break server.primitives.semantic_search_service, while a change to server.primitives.semantic_search_service can't break components.vector_store.vector_store_component.
Position
Below the diagonal: server.primitives.semantic_search_service uses a module listed above it, which is the healthy direction.
server.primitives.semantic_search_service uses components.node_store.node_store_component, so a change to components.node_store.node_store_component can break server.primitives.semantic_search_service, while a change to server.primitives.semantic_search_service can't break components.node_store.node_store_component.
Position
Below the diagonal: server.primitives.semantic_search_service uses a module listed above it, which is the healthy direction.
server.primitives.semantic_search_service uses components.ingest.ingest_component, so a change to components.ingest.ingest_component can break server.primitives.semantic_search_service, while a change to server.primitives.semantic_search_service can't break components.ingest.ingest_component.
Position
Below the diagonal: server.primitives.semantic_search_service uses a module listed above it, which is the healthy direction.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
54
High / Critical
A03:2025 — Software Supply Chain Failures
41
High / Critical
A02:2025 — Security Misconfiguration
3
High / Critical
A07:2025 — Authentication Failures
1
High / Critical
Roadmap
First, address visual and motion safety by ensuring visible focus styles, respecting reduced motion preferences, and fixing low-contrast colors. Next, enforce accessibility standards by integrating invariant checks into your test suite and gating merges in CI to prevent regressions. Finally, resolve the missing Architecture Decision Records by documenting significant design choices in a dedicated folder to improve long-term maintainability and ARIA correctness.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 61
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 537
Likely wrong, but not failing yet. It degrades
the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to
carry for two years either.
Minor — 140
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 19
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 64 of 68 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 4 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 68 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 718 of 738 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT READ here — but this repository measures it: a coverage step in CI (`pytest tests --cov private_gpt --cov-report term --cov-repor…`) shows that coverage is collected and tracked in your own CI. The built-in collector has no runner for this ecosystem (.py), so the analyzer could not read the number — a gap in the analyzer's language coverage, not an unmeasured repo. Not scored. To have the real number read, produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.py) and this repository declares a Python test suite (repository root, 217 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D12 Dependency Hygiene — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. This repository's 1 shipped Python distribution(s) across 1 manifest(s) WERE read; what went unanswered is the currency half, because it grades an EXACT pin against the newest release and every declaration here is a floor or a range — which installs the newest release it admits and so cannot be behind one. So pypi.org was never asked. This is a true statement about the repository, and the healthy one, NOT a gap on our side: no reader we could write would find a currency question here.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
AX1 Captive dependencies — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository's container is injector, whose lifetimes are not modelled yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via REDACTED (REDACTED). docker build failed (exit 1) — DEPRECATED: The legacy builder is deprecated and will be removed in a future release.
Install the buildx component to build images with BuildKit:
https://docs.docker.com/go/bui…; runtime evidence skipped.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'redis.asyncio.retry' is imported (private_gpt/arq/settings.py:4), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'redis.asyncio.retry' is imported (private_gpt/arq/settings.py:4), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'redis.asyncio.retry' is imported (private_gpt/arq/settings.py:4), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P8 Schema migrations — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. The schema may be created by a runner, a deploy script or a config file outside what this check reads, so an absence here is our blind spot rather than a missing migration strategy. The card abstains instead of scoring. You can widen what we reach: if the schema is created and evolved by a tool this check does not name, naming it lets us teach the detector to read it.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 7 further occurrence(s) are not listed individually; the score already reflects all 47.
X4 Structured logging — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 203 further occurrence(s) are not listed individually; the score already reflects all 243.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D22 Internal API Consistency: API-surface coherence is an LLM judgement over a sample of the public surface — consistency of intent across the whole API is approximated, not exhaustively verified.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
DM6 Domain ↔ infrastructure boundary: Infrastructure reached through a hand-rolled wrapper, a domain-named facade, reflection, or a string-keyed service locator resolves to a non-infra type and isn't seen; the body scan is symbol resolution over syntax, not full dataflow. A clean result means "no resolved infra reference in a domain body", not a proof of purity.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
The LLM boundary
LLM-set scores this run (4): D19, D21, D22, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
72 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was REDACTED.renderCodeExecToolUse at 132. A further 1 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being utils.dict_to_tree_node at 17 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: private_gpt/components/readers/nodes/utils.py (utils.dict_to_tree_node at 17). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 67 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with REDACTED.renderCodeExecToolUse (cyclomatic 132). — Refactoring it lifts Cyclomatic Complexity from 5.7 to about 6.5/10.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 146 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 2 bodies over 120 down to 120 or less in Cognitive Complexity — start with REDACTED.renderCodeExecToolUse (cognitive 168), EmailTextReader._extract_content_and_attachments (cognitive 148). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 2 together lifts Cognitive Complexity from 4.2 to about 4.7/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes9.0 / 10Stronggated by 25 serious findings✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 17 FileTooLong finding(s) in God Classes — start with REDACTED, settings.py, async_chat_engine.py. — One of this dimension's main actionable groups (17 warning-level).
Resolve the 4 FunctionTooLong finding(s) in God Classes — start with REDACTED (4). — One of this dimension's main actionable groups (4 warning-level).
Resolve the 4 TooManyMethods finding(s) in God Classes — start with async_chat_engine.py, tree_node.py, REDACTED. — One of this dimension's main actionable groups (4 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
125 duplicated block group(s) detected. A further 5 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 64 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 7 Duplicated block (15 lines × 2) finding(s) in Code Duplication — start with base_artifact_index.py, task_helper.py, async_chat_engine.py. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 7 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with async_chat_engine.py (2), condenser.py, utils.py. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 5 Duplicated block (19 lines × 2) finding(s) in Code Duplication — start with condenser.py, openairesponses.py, persistence_component.py. — One of this dimension's main actionable groups (5 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with tree_node.py, tool_service.py. — One of this dimension's main actionable groups (2 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution9.8 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
2060 test methods: 2015 unit, 9 integration, 0 BDD, 36 e2e. The Python suite contributes 2060 test function(s) across 217 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Enforce Secret Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 12 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 1 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (11 reached that way). Requirements it states ONLY under an extra, a PEP 735 dependency group, a Poetry dev group or a dev-named requirements file are excluded: pip does not install any of them for a consumer. ★ This repository commits no dependency lockfile that this pass reads, so each licence is the one PyPI publishes for the distribution's CURRENT release rather than for a pinned version.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Top hotspots: private_gpt/components/engines/chat/async_chat_engine.py (11×40=440); private_gpt/components/engines/chat/chat_engine.py (8×40=320); private_gpt/chat/input_models.py (5×27=135) Repeated repair below the complexity floor: private_gpt/components/engines/chat/resumable_runner.py (3 of 5 changes were fixes); private_gpt/components/tabular/pandasai_sandbox.py (3 of 4 changes were fixes); private_gpt/arq/enqueue.py (3 of 3 changes were fixes)
Resolve the 8 Hotspot finding(s) in Churn × Complexity Hotspots — start with async_chat_engine.py, chat_engine.py, input_models.py. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 4 Repeated repair finding(s) in Churn × Complexity Hotspots — start with resumable_runner.py, pandasai_sandbox.py, enqueue.py. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor7.3 / 10Strong✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
100 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is private_gpt/chat/input_models.py. Counted over 371 of the 710 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1 · ×2
Further sole-owners (lower concentration)
What to do
Resolve the 2 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (2 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
38 deducted task-comment markers across 89461 LoC (0.0/KLoC) → score 9.9. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 38 TodoComment finding(s) in Explicit Debt — start with REDACTED (5), patched_qdrant_store.py (5), vector_artifact_index.py (2). — One of this dimension's main actionable groups (38 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's root README and three fern/README.md files are clear, complete, and well-structured. The root README gives an overview of PrivateGPT as the open-source API layer that turns local models into production AI applications, links to tests, a live docs site, Discord, and Trendshift visibility; it also describes what the project does (the higher-level building blocks) and where to run it (via `OPENAI_API_BASE`). The fern/README.md documents the fern directory's role as the configuration and checked-in documentation pages for the root repository, with installation, navigation-update, and page-addition commands. Each README is self-contained and scoped to its own directory — no single document claims overview, install, or usage of the whole repo.
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
0 naming inconsistencies across 0 sampled symbols.
✓ On the Gold path — maintain.
Detailed fixes: d21_recommendation.md.
Do you agree with this assessment?
D22 · Internal API ConsistencyStrong◐ Sampled · advisory
What it measures: Whether the internal API surface is consistent and coherent.
Method: Judged by language model at low temperature over a sample of the public API surface (IsPackable or .Contracts types). Sampled, advisory; confidence discounted by model uncertainty.
4 API inconsistencies across a 400-member sample of 1390 exposed types.
Duplicate function names across different subsystems (Arq vs Celery) that likely serve similar purposes (exposing health status) but are in separate modules. While technically distinct namespaces, having `healthcheck.health` in two major backend modules creates confusion for consumers who might expect a unified health interface.
Two different modules (`arq.settings` and `tasks.chat.settings`) expose a function named `get_queue_name` with different signatures. One takes a queue string, the other takes settings. This suggests inconsistent abstraction levels for queue name resolution.
Duplicate function names `register_task_packages` in both `arq` and `celery` task registry modules. While they operate on different task queues, the identical naming implies a shared interface contract that doesn't exist (different underlying implementations).
Two methods with nearly identical names (`populated_or_error` vs `apopulated_or_error`) on the same class. The 'a' prefix typically denotes async in this codebase, but the naming convention is inconsistent with standard Python async patterns (usually `async def populated_or_error`).
What to do
Resolve the 1 Duplicate function names across different subsystems (Arq vs Celery)… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Two different modules (`arq.settings` and `tasks.chat.settings`) expose… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Duplicate function names `register_task_packages` in both `arq` and… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d22_recommendation.md · top locations in Appendix A, every location in findings.md.
1 of 2 build units (Python) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
54 finding(s): 0 critical, 33 high, 10 medium, 11 low. 24 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. Separately, one or more rules could not re-parse an embedded snippet in 3 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 8 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
No action in Static Analysis (SAST) — all 24 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (24 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 17 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (17). — One of this dimension's main actionable groups (17 issue-level).
Resolve the 3 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
Resolve the 2 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 1 High IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Medium IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Low IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
2 of 371 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is REDACTED. Counted over 371 of the 710 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Orphaned file · ×2REDACTED:1
Orphaned files with no living knowledge
✓ On the Gold path — maintain.
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 1 Change coupling finding(s) in Change Coupling — start with embedding_component.py. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 1 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives10.0 / 10Exemplary○ Nothing flagged
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
Do you agree with this assessment?
AC2 · Forms & labels7.4 / 10Strong✓ Tool-verified
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label. — REDACTED:3817
This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. — REDACTED:3821
What to do
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
aria-hidden="true" here hides the subtree from assistive tech, but a focusable descendant stays in the tab order — a keyboard user can land on a control screen readers can't see. Add inert, take the descendants out of the tab order (tabindex="-1"), or drop aria-hidden. — REDACTED:3848
What to do
Use valid, non-abstract roles, supply the ARIA state each role requires, and never put aria-hidden on a focusable element.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
`.nav-button` moves (`transition: background 150ms ease, border-color 150ms ease, transform 150ms ease, opacity 150ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:323
`.avatar-orb.loading` moves (`animation: breathe 1.65s ease-in-out infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:803
`.message` moves (`animation: messageIn 0.2s ease-out both`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:1033
`.thinking-text span` moves (`animation: dotPulse 1.2s ease-in-out infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:1099
`.stream-working::before` moves (`animation: spin 0.72s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:1132
`.thinking-block summary::before` moves (`transition: transform 0.15s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:1202
`.composer .compact-control` moves (`transition: color 160ms ease, background 160ms ease, border-color 160ms ease, transform 160ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:1497
`.composer .composer-circle` moves (`transition: width 220ms cubic-bezier(.2,.8,.2,1), min-width 220ms cubic-bezier(.2,.8,.2,1), padding 220ms cubic-bezier(.2,.8,.2,1), background 160ms ease, border-color 160ms ease, transform 160ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:1508
`.composer svg.composer-control-icon` moves (`transition: transform 200ms cubic-bezier(.2,.8,.2,1), opacity 160ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:1518
`.composer-control-label` moves (`transition: max-width 220ms cubic-bezier(.2,.8,.2,1), opacity 150ms ease, transform 220ms cubic-bezier(.2,.8,.2,1)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:1530
`.menu-action` moves (`transition: color 120ms ease, background 120ms ease, transform 120ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:1661
`.model-chevron` moves (`transition: transform 0.18s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:1718
`.effort-option` moves (`transition: color 120ms ease, background 120ms ease, transform 120ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:1863
`input[type="checkbox"]::after` moves (`transition: left 0.18s ease, background 0.18s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:2001
`.toast` moves (`animation: toastIn 0.18s ease-out both`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:2188
`.toast.loading::before` moves (`animation: toast-spin 0.8s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:2206
`.mini-button` moves (`transition: background 150ms ease, border-color 150ms ease, color 150ms ease, transform 100ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:2310
`.icon-button.send` moves (`transition: background 150ms ease, border-color 150ms ease, box-shadow 150ms ease, transform 150ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:2337
`.modal-backdrop.open .modal-card` moves (`animation: cardIn 0.18s ease-out both`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:2365
`.message-actions` moves (`transition: opacity 0.15s ease, transform 0.15s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:2381
`.code-exec-block summary::before` moves (`transition: transform 0.15s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:2483
`.step-pill` moves (`transition: border-color 150ms ease, background 150ms ease, transform 120ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:3230
`.advanced-panel .panel-chevron` moves (`transition: transform 0.2s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — REDACTED:3336
`.model-search-wrap .model-search` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — REDACTED:1811
What to do
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 6 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
What to do
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether singleton services avoid mutable shared instance state that concurrent callers would race on.
Method: Roslyn scan: singleton field mutations unguarded by lock or Interlocked, per type; syntax-based guard detection. Deterministic, traceable per field.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Do you agree with this assessment?
C2 · Access Controls7.0 / 10Strong✓ Tool-verified
Other · Security — Whether access is authorized by default — a framework authorization attribute/decorator or policy, or imperative guard methods (throw-on-violation) called from handlers.
Method: Roslyn scan: [Authorize] usage and authorization policies, plus imperative throw-on-violation guard methods detected via syntax. Deterministic.
Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) — this is NOT a claim that endpoints are unprotected. What's missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can't be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect.
What to do
Name the access rules — DRF permission classes, django-guardian or django-rules permissions, a casbin or oso policy, or roles and permissions declared once — and consult them where access is checked (permission_classes, @permission_required, Depends), so the rule set is reviewable and testable on its own.
Other · Domain Modelling — Whether the domain layer stays free of infrastructure dependencies — a domain aggregate fused to a persistence ORM (Django/SQLAlchemy) on its own declaration (active-record) couples the domain to infrastructure. The clean-architecture dependency rule.
Method: Roslyn (DDD-gated): domain-layer types scanned for infrastructure usage in member SIGNATURES and inside method/accessor BODIES — resolved calls and object-creations into EF/Marten/HTTP/Mongo/Redis/message-bus types (not just a namespace allowlist). Deterministic, symbol-resolved, exhaustive over domain-layer bodies, DDD-native.
Coverage: Domain layer identified by NAMESPACE heuristic; infrastructure then resolved by symbol in member SIGNATURES and method/accessor BODIES — rename the layer and the check evaporates.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
README advertises Kubernetes, but no Kubernetes manifest or chart exists — searched for: `kubernetes`, `k8s`, `helm`. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest and configuration files (package.json and other *.json, *.csproj, *.props, *.sln/*.slnx, *.yml, *.toml, *.config, tool configs such as eslint.config.js, REDACTED); the README's own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read — a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong. — README.md:253
README.md runs `powershell -ExecutionPolicy ByPass -c "irm https://astral.sh/uv/install.ps1`, but `https:/astral.sh/uv/install.ps1` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:74
fern/docs/pages/index.mdx links to `/providers/overview`, but `providers/overview` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/index.mdx:78
fern/docs/pages/api-guide/messages.mdx links to `/api-guide/messages-async`, but `api-guide/messages-async` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/api-guide/messages.mdx:187
fern/docs/pages/api-guide/skills.mdx names `SKILL.md`, but no file or folder `SKILL.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/api-guide/skills.mdx:27
fern/docs/pages/api-guide/tools.mdx links to `/tools/web-tools`, but `tools/web-tools` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/api-guide/tools.mdx:47
fern/docs/pages/configuration/advanced.mdx links to `/installation/local`, but `installation/local` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/configuration/advanced.mdx:19
fern/docs/pages/configuration/cli.mdx links to `/integrations/claude-code`, but `integrations/claude-code` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/configuration/cli.mdx:126
fern/docs/pages/getting-started/how-it-works.mdx links to `/configuration/settings`, but `configuration/settings` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/getting-started/how-it-works.mdx:31
fern/docs/pages/getting-started/how-it-works.mdx links to `/configuration/advanced`, but `configuration/advanced` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/getting-started/how-it-works.mdx:42
fern/docs/pages/getting-started/quickstart.mdx links to `/providers/overview`, but `providers/overview` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/getting-started/quickstart.mdx:9
fern/docs/pages/getting-started/quickstart.mdx links to `/providers/ollama`, but `providers/ollama` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/getting-started/quickstart.mdx:9
fern/docs/pages/getting-started/quickstart.mdx runs `powershell -ExecutionPolicy ByPass -c "irm https://astral.sh/uv/install.ps1`, but `https:/astral.sh/uv/install.ps1` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/getting-started/quickstart.mdx:35
fern/docs/pages/getting-started/quickstart.mdx links to `/providers/lmstudio`, but `providers/lmstudio` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/getting-started/quickstart.mdx:69
fern/docs/pages/getting-started/quickstart.mdx links to `/providers/llamacpp`, but `providers/llamacpp` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/getting-started/quickstart.mdx:84
fern/docs/pages/getting-started/quickstart.mdx links to `/providers/vllm`, but `providers/vllm` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/getting-started/quickstart.mdx:101
fern/docs/pages/getting-started/quickstart.mdx links to `/api-reference/api-reference`, but `api-reference/api-reference` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/getting-started/quickstart.mdx:139
fern/docs/pages/getting-started/quickstart.mdx links to `/tools/database-tools`, but `tools/database-tools` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/getting-started/quickstart.mdx:148
fern/docs/pages/getting-started/quickstart.mdx links to `/tools/web-tools`, but `tools/web-tools` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/getting-started/quickstart.mdx:148
fern/docs/pages/installation/docker.mdx links to `/providers/overview`, but `providers/overview` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/installation/docker.mdx:20
fern/docs/pages/installation/local.mdx links to `/installation/package`, but `installation/package` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/installation/local.mdx:8
fern/docs/pages/installation/local.mdx runs `powershell -c "irm https://astral.sh/uv/install.ps1`, but `https:/astral.sh/uv/install.ps1` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/installation/local.mdx:77
fern/docs/pages/installation/local.mdx links to `/configuration/advanced`, but `configuration/advanced` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/installation/local.mdx:124
fern/docs/pages/installation/package.mdx links to `/providers/overview`, but `providers/overview` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/installation/package.mdx:130
fern/docs/pages/installation/package.mdx links to `/installation/local`, but `installation/local` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/installation/package.mdx:131
fern/docs/pages/installation/package.mdx links to `/api-reference/api-reference`, but `api-reference/api-reference` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/installation/package.mdx:132
fern/docs/pages/integrations/claude-code.mdx links to `/configuration/cli#serve`, but `configuration/cli` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/integrations/claude-code.mdx:24
fern/docs/pages/integrations/claude-desktop.mdx links to `/configuration/cli#serve`, but `configuration/cli` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/integrations/claude-desktop.mdx:36
fern/docs/pages/integrations/claude-desktop.mdx links to `/configuration/advanced`, but `configuration/advanced` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/integrations/claude-desktop.mdx:85
fern/docs/pages/integrations/claude-office.mdx links to `/configuration/cli#serve`, but `configuration/cli` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/integrations/claude-office.mdx:37
fern/docs/pages/integrations/opencode.mdx links to `/configuration/cli#serve`, but `configuration/cli` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/integrations/opencode.mdx:24
fern/docs/pages/providers/api-route.mdx documents the environment variable `API_ROUTE_MODEL`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/providers/api-route.mdx:23
fern/docs/pages/providers/api-route.mdx links to `/installation/package`, but `installation/package` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/providers/api-route.mdx:80
fern/docs/pages/providers/overview.mdx links to `/configuration/advanced`, but `configuration/advanced` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/providers/overview.mdx:79
fern/docs/pages/reference/troubleshooting.mdx links to `/configuration/advanced`, but `configuration/advanced` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — fern/docs/pages/reference/troubleshooting.mdx:53
What to do
Reconcile the README with reality: README advertises Kubernetes, but no Kubernetes manifest or chart exists; README.md runs `powershell -ExecutionPolicy ByPass -c "irm https://astral.sh/uv/install.ps1`, but `https:/astral.sh/uv/install.ps1` does not exist; fern/docs/pages/index.mdx links to `/providers/overview`, but `providers/overview` does not exist; fern/docs/pages/api-guide/messages.mdx links to `/api-guide/messages-async`, but `api-guide/messages-async` does not exist; fern/docs/pages/api-guide/skills.mdx names `SKILL.md`, but no file or folder `SKILL.md` exists.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 19987 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
What to do
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
Dependabot is configured but does not watch `pip` — add that `package-ecosystem` entry to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.
Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception. (×2) — private_gpt/components/environment/environment.py:61, REDACTED:520
What to do
Task from `asyncio.get_running_loop().create_task` is not kept
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document1.6 / 10Critical✓ Tool-verified
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
`create_model_from_json_schema` is public, takes a document from its caller (line 390) and hands it to `_validate_json_schema_item`, which calls itself at line 101 (`_validate_json_schema_item`) with a piece of `schema` (and at line 108, line 115, line 133) — and nowhere in `_validate_json_schema_item` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_validate_json_schema_item` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — private_gpt/chat/schema_models.py:101
`create_model_from_json_schema` is public, takes a document from its caller (line 390) and hands it to `_resolve_json_type`, which calls itself at line 192 (`_resolve_json_type`) with a piece of `field_schema` (and at line 205, line 218, line 232) — and nowhere in `_resolve_json_type` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_resolve_json_type` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — private_gpt/chat/schema_models.py:192
`create_prompt_template` is public, takes a document from its caller (line 40) and hands it to `process_value`, which calls itself at line 50 (`process_value`) with a piece of `v` (and at line 53) — and nowhere in `process_value` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `process_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:50
`encode` is public and takes `obj: Any` from its caller, and it calls itself at line 50 (`self.encode`) with a piece of `obj` — and nowhere in `encode` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `encode` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — private_gpt/components/readers/nodes/table_node.py:50
`decode` is public and takes `obj: Any` from its caller, and it calls itself at line 74 (`self.decode`) with a piece of `obj` (and at line 76) — and nowhere in `decode` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `decode` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — private_gpt/components/readers/nodes/table_node.py:74
`from_partial_dict` is public and takes `node_dict: builtins.dict[str, Any]` from its caller, and it calls itself at line 84 (`self.from_partial_dict`) with a piece of `node_dict` — and nowhere in `from_partial_dict` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `from_partial_dict` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — private_gpt/components/readers/nodes/partial_node.py:84
`from_tool_output` is public and takes `tool_output: Any` from its caller, and it calls itself at line 84 (`from_tool_output`) with a piece of `tool_output` (and at line 121) — and nowhere in `from_tool_output` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `from_tool_output` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — private_gpt/events/models/_converters.py:84
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
`debug` at line 89 is called with an argument built by `{ name : "…" t "…" t / total * 100 "…" for name, t, _ in timings }` (line 94), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — private_gpt/components/readers/base_reader.py:89
What to do
In Python, put the construction behind the logger's own check (`if logger.isEnabledFor(logging.DEBUG):`), or pass the collection itself with a `%s` placeholder (`logger.debug("Items %s", items)`) so the logging module renders it only when the record is emitted. The placeholder alone is not the fix when the argument is still built first: it defers the formatting, not a `json.dumps`, a `join` or a comprehension in the argument, and an f-string defers nothing at all.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
`except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×36) — private_gpt/cli/commands/run.py:40, private_gpt/cli/commands/run.py:114, private_gpt/components/database/table_like_inspector.py:96, …
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×4) — private_gpt/components/database/table_like_inspector.py:132, private_gpt/components/llm/tokenizers/registry.py:70, private_gpt/components/llm/tokenizers/registry.py:76, …
What to do
Swallowed exception (caught, then discarded)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
`debug` at line 244 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/launcher.py:244
`info` at line 64 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/celery/task_helper.py:64
`critical` at line 23 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.critical("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.critical("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/celery/healthcheck.py:23
`critical` at line 43 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.critical("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.critical("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/celery/healthcheck.py:43
`debug` at line 39 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/celery/callback.py:39
`error` at line 80 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. (×3) — private_gpt/celery/callback.py:80, private_gpt/components/engines/citations/utils.py:80, private_gpt/components/ingest/transformations/slide_header_checker_transform.py:80
`info` at line 89 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/celery/tasks/ingestion/extraction_tasks.py:89
`debug` at line 103 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/celery/tasks/ingestion/extraction_tasks.py:103
`info` at line 212 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/celery/tasks/ingestion/extraction_tasks.py:212
`debug` at line 226 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/celery/tasks/ingestion/extraction_tasks.py:226
`info` at line 305 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/celery/tasks/ingestion/extraction_tasks.py:305
`error` at line 309 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/celery/tasks/ingestion/extraction_tasks.py:309
`debug` at line 88 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/broker/broker_component.py:88
`info` at line 92 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/broker/broker_component.py:92
`error` at line 101 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/broker/blocking_publisher.py:101
`error` at line 110 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. (×2) — private_gpt/components/broker/blocking_publisher.py:110, private_gpt/components/engines/citations/utils.py:110
`warning` at line 57 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/slide_header_checker_transform.py:57
`warning` at line 158 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/slide_header_checker_transform.py:158
`error` at line 184 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/slide_header_checker_transform.py:184
`warning` at line 81 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/sentence_tree_node_parser.py:81
`warning` at line 34 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/image_deduplication_transform.py:34
`info` at line 68 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/image_deduplication_transform.py:68
`info` at line 75 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/image_deduplication_transform.py:75
`info` at line 87 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/image_deduplication_transform.py:87
`warning` at line 114 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/image_deduplication_transform.py:114
`debug` at line 145 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/image_deduplication_transform.py:145
`warning` at line 149 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/image_deduplication_transform.py:149
`warning` at line 183 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/describe_image_transform.py:183
`error` at line 79 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/convert_image_to_full_slide_transform.py:79
`warning` at line 109 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/convert_image_to_full_slide_transform.py:109
`debug` at line 132 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/convert_image_to_full_slide_transform.py:132
`error` at line 134 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/convert_image_to_full_slide_transform.py:134
`debug` at line 172 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/ingest/transformations/convert_image_to_full_slide_transform.py:172
`warning` at line 86 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/llm/factories/base.py:86
`debug` at line 33 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/llm/tokenizers/models/model_downloader.py:33
`error` at line 36 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/llm/tokenizers/models/model_downloader.py:36
`debug` at line 47 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — private_gpt/components/llm/tokenizers/models/model_downloader.py:47
Statically assessed 13 of 55 WCAG 2.2 Level A/AA success criteria (24%; ≈26% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 42 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 4 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X6 Hand-rolled structured-format parsing — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 11 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 4 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: this repository stores data through 'redis.asyncio.retry' (private_gpt/arq/settings.py:4) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and MongoEngine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether its changes need an audit trail could not be established, and the trail's absence is not scored.
C4 Data Retention — Not assessed: this repository stores data through 'redis.asyncio.retry' (private_gpt/arq/settings.py:4) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, SQL schemas). Personal data may be written through raw SQL or a hosted backend, so whether a retention limit applies here could not be established, and its absence is not scored.
C5 Data-Subject Rights — Not assessed: this repository stores data through 'redis.asyncio.retry' (private_gpt/arq/settings.py:4) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether data-subject rights apply here could not be established, and their absence is not scored.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 44 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AX1 Captive dependencies — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX4 Dependency direction — not applicable to a transaction-script/CRUD architecture (the inward-dependency rule is for layered/clean styles)
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — DEPRECATED: The legacy builder is deprecated and will be removed in a future release.
Install the buildx component to build images with BuildKit:
https://docs.docker.com/go/bui…; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~59852 lines of test source are present (.py) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — the .py suite was found but not re-run
D12 Dependency Hygiene — Dependency currency not established — no declaration carries an exact pin to grade
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Aggregate roots were found in only one source directory (private_gpt), which is a layered codebase, not two contexts. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.py), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D5 Coupling — Not applicable — this Python build ships 1 production module(s), so there is no coupling BETWEEN modules to measure. (Its test and non-production modules are not part of the shipped graph.)
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P8 Schema migrations — SQLAlchemy is declared, but the schema-migration mechanism could not be identified. Our limit, not a verdict on this repository.
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not applicable: Python runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X16 Unfloored truncation loop — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X18 Disposal-pattern correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X2 Cancellation propagation — no C# was loaded; this repository's Python was read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X29 Per-element action decided by a fixed element — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
D30 · Dependency Vulnerabilities· High vulnerability · ×2
REDACTED
REDACTED
AC2 · Forms & labels· <textarea> without a programmatic label · ×1
<textarea> without a programmatic label REDACTED:3817— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
AC2 · Forms & labels· <input> without a programmatic label · ×1
<input> without a programmatic label REDACTED:3821— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC5 · ARIA correctness· aria-hidden hides a focusable element · ×1
aria-hidden hides a focusable element REDACTED:3848— aria-hidden="true" here hides the subtree from assistive tech, but a focusable descendant stays in the tab order — a keyboard user can land on a control screen readers can't see. Add inert, take the descendants out of the tab order (tabindex="-1"), or drop aria-hidden.
TodoComment private_gpt/artifact_index/vector_artifact_index.py:109— # TODO take this to the node store component — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/artifact_index/base_artifact_index.py:142— # TODO take this to the node store component — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/artifact_index/vector_artifact_index.py:114— # TODO pass the SummaryIndex as a parameter to avoid duplicating the dependency — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/components/chat/models/chat_config_models.py:362— # TODO: re-check when we had removed return_direct — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:25— # TODO: postgres support is not complete — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:34— # TODO: review this function (it is not finished) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:35— # TODO: review this function (it is not finished) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/components/database/inspector_interface.py:70— # TODO: SSL Certificates — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:792— # TODO: SSL Certificates — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:26— # TODO: Postgres support is not complete — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/components/engines/citations/utils.py:367— # TODO: Remove in the future — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/components/ingest/ingest_helper.py:79— # TODO: Disabled for now. Please re-enable — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/components/ingest/ingest_helper.py:89— # TODO: Give support to encrypted files — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/components/llm/discovery.py:67— # TODO: add link to dos — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:147— # TODO make it an optional field — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:189— # TODO expose the rest of params — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/components/llm/tokenizers/remote.py:57— # TODO: Try to tokenize a random text — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/components/llm/tokenizers/mistral.py:597— # TODO: Not supported yet as Mistral's multimodal tokenization is not finalized. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/components/memory/trimming_memory.py:85— # TODO: Replace with a default tokenizer function — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/components/model_discovery/providers/fallback.py:19— # TODO: add link — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment private_gpt/components/readers/nodes/image_node.py:37— # TODO: Disable image embeddings until we have a way to handle them — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:625— # TODO: review for add cursor support — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:678— # TODO: This code is for postgres support but now is not used — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:975— # TODO: TLDR strategy don't work well here, — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:1301— # TODO: need a review for postgres cursor support — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Swallowed exception (caught, then discarded) private_gpt/cli/commands/run.py:40— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/cli/commands/run.py:114— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/database/table_like_inspector.py:96— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/database/table_like_inspector.py:109— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:118— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:206— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:288— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:119— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:206— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:297— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/engines/citations/term_extractor.py:62— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/utils.py:42— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/utils.py:76— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/utils.py:88— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/utils.py:267— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/utils.py:283— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/utils.py:301— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/utils.py:308— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/utils.py:318— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/utils.py:325— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/utils.py:332— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/utils.py:339— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/transformations/image_deduplication_transform.py:220— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/ingest/transformations/describe_image_transform.py:241— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) private_gpt/components/llm/custom/openairesponses.py:237— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
+ 11 more in this group — see findings.md.
AC6 · Visual & motion safety· Animation without a prefers-reduced-motion guard · ×23
Animation without a prefers-reduced-motion guard REDACTED:323— `.nav-button` moves (`transition: background 150ms ease, border-color 150ms ease, transform 150ms ease, opacity 150ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:803— `.avatar-orb.loading` moves (`animation: breathe 1.65s ease-in-out infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:1033— `.message` moves (`animation: messageIn 0.2s ease-out both`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:1099— `.thinking-text span` moves (`animation: dotPulse 1.2s ease-in-out infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:1132— `.stream-working::before` moves (`animation: spin 0.72s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:1202— `.thinking-block summary::before` moves (`transition: transform 0.15s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:1497— `.composer .compact-control` moves (`transition: color 160ms ease, background 160ms ease, border-color 160ms ease, transform 160ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:1508— `.composer .composer-circle` moves (`transition: width 220ms cubic-bezier(.2,.8,.2,1), min-width 220ms cubic-bezier(.2,.8,.2,1), padding 220ms cubic-bezier(.2,.8,.2,1), background 160ms ease, border-color 160ms ease, transform 160ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:1518— `.composer svg.composer-control-icon` moves (`transition: transform 200ms cubic-bezier(.2,.8,.2,1), opacity 160ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:1530— `.composer-control-label` moves (`transition: max-width 220ms cubic-bezier(.2,.8,.2,1), opacity 150ms ease, transform 220ms cubic-bezier(.2,.8,.2,1)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:1661— `.menu-action` moves (`transition: color 120ms ease, background 120ms ease, transform 120ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:1718— `.model-chevron` moves (`transition: transform 0.18s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:1863— `.effort-option` moves (`transition: color 120ms ease, background 120ms ease, transform 120ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:2001— `input[type="checkbox"]::after` moves (`transition: left 0.18s ease, background 0.18s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:2188— `.toast` moves (`animation: toastIn 0.18s ease-out both`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:2206— `.toast.loading::before` moves (`animation: toast-spin 0.8s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:2310— `.mini-button` moves (`transition: background 150ms ease, border-color 150ms ease, color 150ms ease, transform 100ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:2337— `.icon-button.send` moves (`transition: background 150ms ease, border-color 150ms ease, box-shadow 150ms ease, transform 150ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:2365— `.modal-backdrop.open .modal-card` moves (`animation: cardIn 0.18s ease-out both`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:2381— `.message-actions` moves (`transition: opacity 0.15s ease, transform 0.15s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:2483— `.code-exec-block summary::before` moves (`transition: transform 0.15s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:3230— `.step-pill` moves (`transition: border-color 150ms ease, background 150ms ease, transform 120ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard REDACTED:3336— `.advanced-panel .panel-chevron` moves (`transition: transform 0.2s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
FileTooLong: REDACTED REDACTED— FileTooLong — 3350 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2850 over it, 6.70× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: settings/settings.py private_gpt/settings/settings.py— FileTooLong — 1774 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1274 over it, 3.55× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: chat/async_chat_engine.py private_gpt/components/engines/chat/async_chat_engine.py— FileTooLong — 1554 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1054 over it, 3.11× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: chat/input_models.py private_gpt/chat/input_models.py— FileTooLong — 1128 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 628 over it, 2.26× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1020 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 520 over it, 2.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: vector_store/patched_qdrant_store.py private_gpt/components/vector_store/patched_qdrant_store.py— FileTooLong — 938 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 438 over it, 1.88× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: chat/chat_engine.py private_gpt/components/engines/chat/chat_engine.py— FileTooLong — 884 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 384 over it, 1.77× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: multimodality/audio_handler.py private_gpt/components/multimodality/audio_handler.py— FileTooLong — 816 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 316 over it, 1.63× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: pptx2md/convert_slide_into_image.py private_gpt/components/readers/pptx2md/convert_slide_into_image.py— FileTooLong — 725 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 225 over it, 1.45× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: models/_content_blocks.py private_gpt/events/models/_content_blocks.py— FileTooLong — 676 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 176 over it, 1.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ingest/ingest_router.py private_gpt/server/ingest/ingest_router.py— FileTooLong — 616 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 116 over it, 1.23× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: strategies/condenser.py private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py— FileTooLong — 597 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 97 over it, 1.19× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: tokenizers/mistral.py private_gpt/components/llm/tokenizers/mistral.py— FileTooLong — 589 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 89 over it, 1.18× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: prompts/prompt_builder.py private_gpt/components/prompts/prompt_builder.py— FileTooLong — 520 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20 over it, 1.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: skills/skill_router.py private_gpt/server/skills/skill_router.py— FileTooLong — 520 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20 over it, 1.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: models/chat_config_models.py private_gpt/components/chat/models/chat_config_models.py— FileTooLong — 502 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2 over it, 1.00× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: multimodality/image_handler.py private_gpt/components/multimodality/image_handler.py— FileTooLong — 501 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1 over it, 1.00× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D30 · Dependency Vulnerabilities· Medium CVE · ×14
Hotspot: private_gpt/components/engines/chat/async_chat_engine.py private_gpt/components/engines/chat/async_chat_engine.py:1252— private_gpt/components/engines/chat/async_chat_engine.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in AsyncChatEngine._handle_stream_chunk at line 1252. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/components/engines/chat/async_chat_engine.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: private_gpt/components/engines/chat/chat_engine.py private_gpt/components/engines/chat/chat_engine.py:546— private_gpt/components/engines/chat/chat_engine.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in ChatLoopEngine._handle_stream_chunk at line 546. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/components/engines/chat/chat_engine.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: private_gpt/chat/input_models.py private_gpt/chat/input_models.py:1070— private_gpt/chat/input_models.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in MessageInput._convert_assistant_message at line 1070. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/chat/input_models.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: private_gpt/components/engines/chat/utils/tool_utils.py private_gpt/components/engines/chat/utils/tool_utils.py:133— private_gpt/components/engines/chat/utils/tool_utils.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in tool_utils.execute_tool_call at line 133. 2 of those changes were fix/bug commits, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/components/engines/chat/utils/tool_utils.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: private_gpt/components/tools/processors/text_editor_processor.py private_gpt/components/tools/processors/text_editor_processor.py:43— private_gpt/components/tools/processors/text_editor_processor.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TextEditorProcessor._build at line 43. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/components/tools/processors/text_editor_processor.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: private_gpt/components/chat/processors/chat_history/multimodality/multimodality_preprocessor.py private_gpt/components/chat/processors/chat_history/multimodality/multimodality_preprocessor.py:94— private_gpt/components/chat/processors/chat_history/multimodality/multimodality_preprocessor.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in multimodality_preprocessor.preprocess_multimodal_message at line 94. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/components/chat/processors/chat_history/multimodality/multimodality_preprocessor.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: private_gpt/server/chat/interceptors/extract_citation_interceptor.py private_gpt/server/chat/interceptors/extract_citation_interceptor.py:71— private_gpt/server/chat/interceptors/extract_citation_interceptor.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ExtractCitationInterceptor.intercept_event at line 71. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/server/chat/interceptors/extract_citation_interceptor.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: private_gpt/components/chat/processors/chat_history/memory/tldr_processor.py private_gpt/components/chat/processors/chat_history/memory/tldr_processor.py:89— private_gpt/components/chat/processors/chat_history/memory/tldr_processor.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in tldr_processor.condense_chat_history at line 89. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/components/chat/processors/chat_history/memory/tldr_processor.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Duplicated block (15 lines × 2) private_gpt/artifact_index/base_artifact_index.py:534— private_gpt/artifact_index/base_artifact_index.py:534-548 | private_gpt/artifact_index/base_artifact_index.py:634-648 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/artifact_index/base_artifact_index.py:534` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (15 lines × 2) private_gpt/celery/task_helper.py:72— private_gpt/celery/task_helper.py:72-86 | private_gpt/celery/task_helper.py:116-130 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `private_gpt/celery/task_helper.py:131` calls `revoke_task` and `private_gpt/celery/task_helper.py:87` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (15 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1692— private_gpt/components/engines/chat/async_chat_engine.py:1692-1706 | private_gpt/components/engines/chat/chat_engine.py:1039-1053 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/engines/chat/async_chat_engine.py:1692` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) private_gpt/components/ingestion/ingestion_scheduler.py:447— private_gpt/components/ingestion/ingestion_scheduler.py:447-461 | private_gpt/components/ingestion/ingestion_scheduler.py:497-511 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/ingestion/ingestion_scheduler.py:447` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) private_gpt/components/multimodality/audio_handler.py:525— private_gpt/components/multimodality/audio_handler.py:525-539 | private_gpt/components/multimodality/image_handler.py:137-151 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (15 lines × 2) private_gpt/components/tools/builders/semantic_search_builder.py:304— private_gpt/components/tools/builders/semantic_search_builder.py:304-318 | private_gpt/components/tools/builders/tabular_data_builder.py:320-334 — before extracting anything, compare `private_gpt/components/tools/builders/semantic_search_builder.py` and `private_gpt/components/tools/builders/tabular_data_builder.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) private_gpt/components/tools/processors/semantic_search_processor.py:31— private_gpt/components/tools/processors/semantic_search_processor.py:31-45 | private_gpt/components/tools/processors/tabular_data_processor.py:37-51 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/tools/processors/semantic_search_processor.py:31` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:547— private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:547-558 | private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:691-702 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (12 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1028— private_gpt/components/engines/chat/async_chat_engine.py:1028-1039 | private_gpt/components/engines/chat/chat_engine.py:349-360 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1906— private_gpt/components/engines/chat/async_chat_engine.py:1906-1917 | private_gpt/components/engines/chat/chat_engine.py:934-945 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) private_gpt/components/engines/citations/utils.py:70— private_gpt/components/engines/citations/utils.py:70-81 | private_gpt/components/engines/citations/utils.py:100-111 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) private_gpt/components/readers/pptx2md/pptx2md_reader.py:128— private_gpt/components/readers/pptx2md/pptx2md_reader.py:128-139 | private_gpt/components/readers/vision/convert_doc_into_image.py:129-140 — before extracting anything, compare `private_gpt/components/readers/pptx2md/pptx2md_reader.py` and `private_gpt/components/readers/vision/convert_doc_into_image.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 216 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (12 lines × 2) private_gpt/components/embedding/registry.py:54— private_gpt/components/embedding/registry.py:54-65 | private_gpt/components/llm/registry.py:65-76 — `private_gpt/components/embedding/registry.py` and `private_gpt/components/llm/registry.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 50 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/embedding/registry.py:54` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) REDACTED:20— REDACTED:20-32 | REDACTED:20-31 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 120 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×7
Recursive walk over a caller-supplied document has no depth cap private_gpt/chat/schema_models.py:101— `create_model_from_json_schema` is public, takes a document from its caller (line 390) and hands it to `_validate_json_schema_item`, which calls itself at line 101 (`_validate_json_schema_item`) with a piece of `schema` (and at line 108, line 115, line 133) — and nowhere in `_validate_json_schema_item` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_validate_json_schema_item` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap private_gpt/chat/schema_models.py:192— `create_model_from_json_schema` is public, takes a document from its caller (line 390) and hands it to `_resolve_json_type`, which calls itself at line 192 (`_resolve_json_type`) with a piece of `field_schema` (and at line 205, line 218, line 232) — and nowhere in `_resolve_json_type` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_resolve_json_type` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap REDACTED:50— `create_prompt_template` is public, takes a document from its caller (line 40) and hands it to `process_value`, which calls itself at line 50 (`process_value`) with a piece of `v` (and at line 53) — and nowhere in `process_value` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `process_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap private_gpt/components/readers/nodes/table_node.py:50— `encode` is public and takes `obj: Any` from its caller, and it calls itself at line 50 (`self.encode`) with a piece of `obj` — and nowhere in `encode` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `encode` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap private_gpt/components/readers/nodes/table_node.py:74— `decode` is public and takes `obj: Any` from its caller, and it calls itself at line 74 (`self.decode`) with a piece of `obj` (and at line 76) — and nowhere in `decode` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `decode` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap private_gpt/components/readers/nodes/partial_node.py:84— `from_partial_dict` is public and takes `node_dict: builtins.dict[str, Any]` from its caller, and it calls itself at line 84 (`self.from_partial_dict`) with a piece of `node_dict` — and nowhere in `from_partial_dict` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `from_partial_dict` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap private_gpt/events/models/_converters.py:84— `from_tool_output` is public and takes `tool_output: Any` from its caller, and it calls itself at line 84 (`from_tool_output`) with a piece of `tool_output` (and at line 121) — and nowhere in `from_tool_output` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `from_tool_output` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Duplicated block (19 lines × 2) private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:478— private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:478-496 | private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:624-642 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) private_gpt/components/llm/custom/openairesponses.py:311— private_gpt/components/llm/custom/openairesponses.py:311-329 | private_gpt/components/llm/custom/openairesponses.py:432-450 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) private_gpt/components/persistence/persistence_component.py:81— private_gpt/components/persistence/persistence_component.py:81-99 | private_gpt/components/persistence/persistence_component.py:107-125 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) private_gpt/components/prompts/prompt_builder.py:209— private_gpt/components/prompts/prompt_builder.py:209-227 | private_gpt/components/prompts/prompt_builder.py:244-262 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/prompts/prompt_builder.py:209` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (19 lines × 2) private_gpt/server/chat/interceptors/extract_citation_interceptor.py:92— private_gpt/server/chat/interceptors/extract_citation_interceptor.py:92-110 | private_gpt/server/chat/interceptors/extract_citation_interceptor.py:152-170 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/server/chat/interceptors/extract_citation_interceptor.py:92` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) private_gpt/components/embedding/registry.py:26— private_gpt/components/embedding/registry.py:26-42 | private_gpt/components/llm/registry.py:37-53 — `private_gpt/components/embedding/registry.py` and `private_gpt/components/llm/registry.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 50 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/embedding/registry.py:26` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `component` to `BaseEmbedding` in one and `LLMInstance` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (17 lines × 2) private_gpt/components/llm/discovery.py:79— private_gpt/components/llm/discovery.py:79-95 | private_gpt/components/llm/discovery.py:103-119 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17 lines × 2) private_gpt/components/llm/tokenizers/huggingface.py:162— private_gpt/components/llm/tokenizers/huggingface.py:162-178 | private_gpt/components/llm/tokenizers/mistral.py:552-568 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17 lines × 2) private_gpt/components/tools/builders/semantic_search_builder.py:133— private_gpt/components/tools/builders/semantic_search_builder.py:133-149 | private_gpt/components/tools/builders/tabular_data_builder.py:168-184 — before extracting anything, compare `private_gpt/components/tools/builders/semantic_search_builder.py` and `private_gpt/components/tools/builders/tabular_data_builder.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/tools/builders/semantic_search_builder.py:133` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17 lines × 2) private_gpt/server/chat/interceptors/document_file_interceptor.py:175— private_gpt/server/chat/interceptors/document_file_interceptor.py:175-191 | private_gpt/server/chat/interceptors/multimodal_interceptor.py:99-115 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/server/chat/interceptors/document_file_interceptor.py:175` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) REDACTED:193— REDACTED:193-208 | REDACTED:193-208 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 120 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (16 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:424— private_gpt/components/engines/chat/async_chat_engine.py:424-439 | private_gpt/components/engines/chat/async_chat_engine.py:655-670 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/engines/chat/async_chat_engine.py:424` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (16 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1714— private_gpt/components/engines/chat/async_chat_engine.py:1714-1729 | private_gpt/components/engines/chat/chat_engine.py:1061-1076 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/engines/chat/async_chat_engine.py:1714` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1986— private_gpt/components/engines/chat/async_chat_engine.py:1986-2001 | private_gpt/components/engines/chat/chat_engine.py:1154-1169 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `run` to `_Run` in one and `_LoopRun` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (16 lines × 2) private_gpt/components/llm/decorators/reasoning_budget.py:243— private_gpt/components/llm/decorators/reasoning_budget.py:243-258 | private_gpt/components/llm/decorators/reasoning_budget.py:371-386 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/llm/decorators/reasoning_budget.py:243` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) private_gpt/components/code_execution/sandbox_session.py:198— private_gpt/components/code_execution/sandbox_session.py:198-206 | private_gpt/components/code_execution/sandbox_session.py:266-274 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) private_gpt/components/ingest/transformations/markdown_to_tree_transform.py:311— private_gpt/components/ingest/transformations/markdown_to_tree_transform.py:311-319 | private_gpt/components/ingest/transformations/markdown_to_tree_transform.py:321-329 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) REDACTED:306— REDACTED:306-314 | REDACTED:328-336 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) private_gpt/server/skills/skill_router.py:554— private_gpt/server/skills/skill_router.py:554-562 | private_gpt/server/skills/skill_router.py:615-623 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `private_gpt/server/skills/skill_router.py:550` calls `Query` and `private_gpt/server/skills/skill_router.py:612` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) private_gpt/events/event_folding.py:70— private_gpt/events/event_folding.py:70-78 | private_gpt/server/chat/chat_service.py:104-112 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Repeated repair: private_gpt/components/engines/chat/resumable_runner.py private_gpt/components/engines/chat/resumable_runner.py:409— private_gpt/components/engines/chat/resumable_runner.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is ResumableChatRunner._tool_name at line 409), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(chat): stop long chats from stalling the chat worker during condensation (#2407)”; “fix: extended thinking (#2333)”; “fix: context stack (#2323)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/components/engines/chat/resumable_runner.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: private_gpt/components/tabular/pandasai_sandbox.py private_gpt/components/tabular/pandasai_sandbox.py:523— private_gpt/components/tabular/pandasai_sandbox.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is PandasAISandboxAdapter.get_file_content at line 523), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(chat): Claude Code/OpenCode correctness and /v1/messages latency (prefix cache 48→95%, overhead 2.7→0.3 s) (#2400)”; “fix: tabular sandbox (#2359)”; “fix(tabular): force-close sandbox after analysis to avoid leaks (#2357)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/components/tabular/pandasai_sandbox.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: private_gpt/arq/enqueue.py private_gpt/arq/enqueue.py:29— private_gpt/arq/enqueue.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is enqueue._get_pool at line 29), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(chat): Claude Code/OpenCode correctness and /v1/messages latency (prefix cache 48→95%, overhead 2.7→0.3 s) (#2400)”; “fix: worker health (#2358)”; “fix: prepare stable version (#2318)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/arq/enqueue.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: private_gpt/server/chat/interceptors/system_prompt_interceptor.py private_gpt/server/chat/interceptors/system_prompt_interceptor.py:42— private_gpt/server/chat/interceptors/system_prompt_interceptor.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 3 (its worst body is SystemPromptRequestInterceptor.intercept at line 42), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(chat): Claude Code/OpenCode correctness and /v1/messages latency (prefix cache 48→95%, overhead 2.7→0.3 s) (#2400)”; “fix(chat): stop long chats from stalling the chat worker during condensation (#2407)”; “fix: prepare stable version (#2318)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 10:54:01 +02:00' --until='2026-10-23 10:54:01 +02:00' --full-history --no-merges -- private_gpt/server/chat/interceptors/system_prompt_interceptor.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
FunctionTooLong: REDACTED.inlineMarkdown REDACTED:6467— FunctionTooLong — inlineMarkdown runs 1386 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1286 over it, 13.86× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: REDACTED.renderCodeExecToolUse REDACTED:5829— FunctionTooLong — renderCodeExecToolUse runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: REDACTED.bindEvents REDACTED:7881— FunctionTooLong — bindEvents runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: REDACTED.requestAssistant REDACTED:7013— FunctionTooLong — requestAssistant runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
TooManyMethods: AsyncChatEngine private_gpt/components/engines/chat/async_chat_engine.py:323— TooManyMethods — 47 methods. The bar is 30 methods; this is 17 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: TreeNode private_gpt/components/readers/nodes/tree_node.py:49— TooManyMethods — 41 methods. The bar is 30 methods; this is 11 over it, 1.37× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DatabaseQueryGenerator REDACTED:266— TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: PromptBuilderService private_gpt/components/prompts/prompt_builder.py:56— TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (14 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1544— private_gpt/components/engines/chat/async_chat_engine.py:1544-1557 | private_gpt/components/engines/chat/chat_engine.py:845-858 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `handler` to `_EventHandler` in one and `_LoopEventHandler` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (14 lines × 2) private_gpt/components/ingest/page_quality.py:74— private_gpt/components/ingest/page_quality.py:74-87 | private_gpt/components/ingest/page_quality.py:100-115 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/ingest/page_quality.py:100` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (14 lines × 2) private_gpt/components/prompts/prompt_builder.py:362— private_gpt/components/prompts/prompt_builder.py:362-375 | private_gpt/components/prompts/prompt_builder.py:451-464 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) private_gpt/server/skills/skill_router.py:401— private_gpt/server/skills/skill_router.py:401-414 | private_gpt/server/skills/skill_router.py:474-487 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1633— private_gpt/components/engines/chat/async_chat_engine.py:1633-1642 | private_gpt/components/engines/chat/chat_engine.py:980-989 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `run` to `_Run` in one and `_LoopRun` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (10 lines × 2) private_gpt/components/text_processing/engine.py:91— private_gpt/components/text_processing/engine.py:91-100 | private_gpt/components/text_processing/engine.py:105-114 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 2) private_gpt/components/database/inspector_interface.py:65— private_gpt/components/database/inspector_interface.py:65-74 | REDACTED:787-796 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) private_gpt/components/embedding/registry.py:75— private_gpt/components/embedding/registry.py:75-84 | private_gpt/components/llm/registry.py:86-95 — `private_gpt/components/embedding/registry.py` and `private_gpt/components/llm/registry.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 50 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/embedding/registry.py:75` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) private_gpt/chat/schema_models.py:265— private_gpt/chat/schema_models.py:265-272 | private_gpt/chat/schema_models.py:306-313 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) private_gpt/components/engines/citations/format.py:110— private_gpt/components/engines/citations/format.py:110-117 | private_gpt/components/engines/citations/format.py:293-300 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) private_gpt/components/tools/builders/semantic_search_builder.py:82— private_gpt/components/tools/builders/semantic_search_builder.py:82-89 | private_gpt/components/tools/tool_factories.py:58-65 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note what the matched lines are: every one of them assigns one field to another, so the block is a hand-written mapper between two data shapes rather than behaviour with a helper inside it. Extracting one shared function only works if both sites map the SAME pair of types in the same direction — check that first, because inverse or differently-typed mappers have no single function they can both call. Where they do not, the moves that exist are a generated or reflective mapper, a common embedded/base type the fields live on once, or accepting the run and covering it with a test that fails when a field is added to one side only.
Duplicated block (8 lines × 2) private_gpt/components/tools/builders/tabular_data_builder.py:116— private_gpt/components/tools/builders/tabular_data_builder.py:116-123 | private_gpt/components/tools/tool_factories.py:98-105 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note what the matched lines are: every one of them assigns one field to another, so the block is a hand-written mapper between two data shapes rather than behaviour with a helper inside it. Extracting one shared function only works if both sites map the SAME pair of types in the same direction — check that first, because inverse or differently-typed mappers have no single function they can both call. Where they do not, the moves that exist are a generated or reflective mapper, a common embedded/base type the fields live on once, or accepting the run and covering it with a test that fails when a field is added to one side only.
Swallowed exception (empty catch) private_gpt/components/database/table_like_inspector.py:132— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) private_gpt/components/llm/tokenizers/registry.py:70— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) private_gpt/components/llm/tokenizers/registry.py:76— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) private_gpt/components/streaming/stream/stream_processor.py:147— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Duplicated block (20 lines × 2) private_gpt/artifact_index/base_artifact_index.py:562— private_gpt/artifact_index/base_artifact_index.py:562-581 | private_gpt/artifact_index/base_artifact_index.py:662-681 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/artifact_index/base_artifact_index.py:562` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (20 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1565— private_gpt/components/engines/chat/async_chat_engine.py:1565-1584 | private_gpt/components/engines/chat/chat_engine.py:949-968 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `run` to `_Run` in one and `_LoopRun` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (20 lines × 2) private_gpt/components/engines/chat/models/chat_loop_state.py:121— private_gpt/components/engines/chat/models/chat_loop_state.py:121-140 | private_gpt/components/engines/chat/models/chat_state.py:142-161 — before extracting anything, compare `private_gpt/components/engines/chat/models/chat_loop_state.py` and `private_gpt/components/engines/chat/models/chat_state.py` as WHOLE FILES: 97% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (18 lines × 2) private_gpt/components/llm/decorators/reasoning_budget.py:148— private_gpt/components/llm/decorators/reasoning_budget.py:148-165 | private_gpt/components/llm/decorators/reasoning_budget.py:204-221 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind `fn` to `Callable[..., ChatResponse]` in one and `Callable[..., ChatResponseGen]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (18 lines × 2) private_gpt/components/llm/decorators/reasoning_budget.py:275— private_gpt/components/llm/decorators/reasoning_budget.py:275-292 | private_gpt/components/llm/decorators/reasoning_budget.py:332-349 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind `fn` to `_AChatFn` in one and `_AStreamChatFn` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (18 lines × 2) private_gpt/components/llm/custom/openai.py:88— private_gpt/components/llm/custom/openai.py:88-108 | private_gpt/components/llm/custom/openairesponses.py:66-83 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (13 lines × 2) private_gpt/components/readers/pptx2md/pptx2md_reader.py:107— private_gpt/components/readers/pptx2md/pptx2md_reader.py:107-119 | private_gpt/components/readers/vision/convert_doc_into_image.py:108-120 — before extracting anything, compare `private_gpt/components/readers/pptx2md/pptx2md_reader.py` and `private_gpt/components/readers/vision/convert_doc_into_image.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 216 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (13 lines × 2) private_gpt/events/models/_content_blocks.py:174— private_gpt/events/models/_content_blocks.py:174-186 | private_gpt/events/models/_content_blocks.py:217-229 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (13 lines × 2) private_gpt/arq/task_registry.py:7— private_gpt/arq/task_registry.py:7-19 | private_gpt/celery/task_registry.py:10-22 — `private_gpt/arq/task_registry.py` and `private_gpt/celery/task_registry.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 1 separate duplicated blocks between them, totalling at least 13 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (10–11 lines × 2) private_gpt/chat/input_models.py:198— private_gpt/chat/input_models.py:198-208 | private_gpt/chat/input_models.py:1368-1377 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `private_gpt/chat/input_models.py:1378` calls `get`, `isinstance`, `System` and `private_gpt/chat/input_models.py:209` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10–11 lines × 2) private_gpt/components/chat/processors/chat_history/documents/document_uploader.py:94— private_gpt/components/chat/processors/chat_history/documents/document_uploader.py:94-103 | private_gpt/components/chat/processors/chat_history/multimodality/media_uploader.py:108-118 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind `uploads` to `list[UploadedDocument]` in one and `list[UploadedMedia]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (10–11 lines × 2) REDACTED:480— REDACTED:480-489 | REDACTED:522-532 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:480` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) private_gpt/components/vector_store/patched_qdrant_store.py:1091— private_gpt/components/vector_store/patched_qdrant_store.py:1091-1102 | private_gpt/components/vector_store/patched_qdrant_store.py:1249-1259 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/vector_store/patched_qdrant_store.py:1091` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) private_gpt/server/ingest/convert_service.py:103— private_gpt/server/ingest/convert_service.py:103-113 | private_gpt/server/ingest/ingest_service.py:138-148 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) private_gpt/components/embedding/registry.py:96— private_gpt/components/embedding/registry.py:96-106 | private_gpt/components/llm/registry.py:105-115 — `private_gpt/components/embedding/registry.py` and `private_gpt/components/llm/registry.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 50 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/embedding/registry.py:96` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `predicate` to `Callable[[BaseEmbedding], bool]` in one and `Callable[[LLMInstance], bool]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (39 lines × 2) private_gpt/components/readers/pptx2md/pptx2md_reader.py:66— private_gpt/components/readers/pptx2md/pptx2md_reader.py:66-104 | private_gpt/components/readers/vision/convert_doc_into_image.py:67-105 — before extracting anything, compare `private_gpt/components/readers/pptx2md/pptx2md_reader.py` and `private_gpt/components/readers/vision/convert_doc_into_image.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 216 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (39 lines × 2) private_gpt/components/tools/builders/semantic_search_builder.py:245— private_gpt/components/tools/builders/semantic_search_builder.py:245-283 | private_gpt/components/tools/builders/tabular_data_builder.py:276-314 — before extracting anything, compare `private_gpt/components/tools/builders/semantic_search_builder.py` and `private_gpt/components/tools/builders/tabular_data_builder.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/tools/builders/semantic_search_builder.py:245` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (37–38 lines × 2) private_gpt/artifact_index/base_artifact_index.py:494— private_gpt/artifact_index/base_artifact_index.py:494-531 | private_gpt/artifact_index/base_artifact_index.py:595-631 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/artifact_index/base_artifact_index.py:595` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (37–38 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1482— private_gpt/components/engines/chat/async_chat_engine.py:1482-1518 | private_gpt/components/engines/chat/chat_engine.py:780-817 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (38 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1648— private_gpt/components/engines/chat/async_chat_engine.py:1648-1685 | private_gpt/components/engines/chat/chat_engine.py:995-1032 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/engines/chat/async_chat_engine.py:1648` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `run` to `_Run` in one and `_LoopRun` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (38 lines × 2) private_gpt/components/readers/text/email_reader.py:251— private_gpt/components/readers/text/email_reader.py:251-288 | private_gpt/components/readers/text/email_reader.py:315-352 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (29 lines × 2) private_gpt/components/multimodality/audio_handler.py:476— private_gpt/components/multimodality/audio_handler.py:476-504 | private_gpt/components/multimodality/audio_handler.py:718-746 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (29 lines × 2) private_gpt/components/vector_store/patched_qdrant_store.py:651— private_gpt/components/vector_store/patched_qdrant_store.py:651-679 | private_gpt/components/vector_store/patched_qdrant_store.py:771-799 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (24 lines × 2) private_gpt/components/llm/custom/openairesponses.py:549— private_gpt/components/llm/custom/openairesponses.py:549-572 | private_gpt/components/llm/custom/openairesponses.py:581-604 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (24 lines × 2) private_gpt/components/readers/pptx2md/pptx2md_reader.py:144— private_gpt/components/readers/pptx2md/pptx2md_reader.py:144-167 | private_gpt/components/readers/vision/convert_doc_into_image.py:145-168 — before extracting anything, compare `private_gpt/components/readers/pptx2md/pptx2md_reader.py` and `private_gpt/components/readers/vision/convert_doc_into_image.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 216 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (23 lines × 2) private_gpt/components/chat/processors/events/citations/citations.py:49— private_gpt/components/chat/processors/events/citations/citations.py:49-71 | private_gpt/components/chat/processors/events/citations/citations.py:82-104 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (23 lines × 2) private_gpt/components/multimodality/audio_handler.py:751— private_gpt/components/multimodality/audio_handler.py:751-773 | private_gpt/components/multimodality/image_handler.py:415-437 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (19–22 lines × 2) private_gpt/components/concurrency/memory_semaphore_manager.py:55— private_gpt/components/concurrency/memory_semaphore_manager.py:55-73 | private_gpt/components/concurrency/redis_semaphore_manager.py:105-126 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (19–22 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1749— private_gpt/components/engines/chat/async_chat_engine.py:1749-1767 | private_gpt/components/engines/chat/chat_engine.py:1081-1102 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/engines/chat/chat_engine.py:1081` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (22 lines × 2) private_gpt/components/llm/tokenizers/remote.py:277— private_gpt/components/llm/tokenizers/remote.py:277-298 | private_gpt/components/llm/tokenizers/remote.py:302-323 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (22 lines × 2) private_gpt/components/readers/pptx2md/pptx2md_reader.py:223— private_gpt/components/readers/pptx2md/pptx2md_reader.py:223-244 | private_gpt/components/readers/vision/convert_doc_into_image.py:224-245 — before extracting anything, compare `private_gpt/components/readers/pptx2md/pptx2md_reader.py` and `private_gpt/components/readers/vision/convert_doc_into_image.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 216 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `private_gpt/components/readers/pptx2md/pptx2md_reader.py:245` calls `_timed_phase` and `private_gpt/components/readers/vision/convert_doc_into_image.py:246` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (21 lines × 2) private_gpt/components/llm/tokenizers/remote.py:229— private_gpt/components/llm/tokenizers/remote.py:229-249 | private_gpt/components/llm/tokenizers/remote.py:253-273 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (21 lines × 2) private_gpt/components/workflows/others/tree_summarize_synthesizer.py:157— private_gpt/components/workflows/others/tree_summarize_synthesizer.py:157-177 | private_gpt/components/workflows/others/tree_summarize_synthesizer.py:240-260 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–15 lines × 3) REDACTED:89— REDACTED:89-102 | REDACTED:174-187 | REDACTED:262-276 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:89` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–15 lines × 3) REDACTED:88— REDACTED:88-101 | REDACTED:174-187 | REDACTED:255-269 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:88` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–10 lines × 2) private_gpt/chat/input_models.py:1018— private_gpt/chat/input_models.py:1018-1027 | private_gpt/chat/input_models.py:1034-1042 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/chat/input_models.py:1018` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–10 lines × 2) private_gpt/components/llm/decorators/reasoning_budget.py:141— private_gpt/components/llm/decorators/reasoning_budget.py:141-150 | private_gpt/components/llm/decorators/reasoning_budget.py:269-277 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/llm/decorators/reasoning_budget.py:269` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) private_gpt/components/ingest/page_quality.py:30— private_gpt/components/ingest/page_quality.py:30-36 | private_gpt/components/ingest/page_quality.py:82-88 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `private_gpt/components/ingest/page_quality.py:27` calls `parse_markdown_table_cells` and `private_gpt/components/ingest/page_quality.py:81` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 2) private_gpt/components/ingest/transformations/remove_header_and_footer_transform.py:77— private_gpt/components/ingest/transformations/remove_header_and_footer_transform.py:77-83 | private_gpt/components/ingest/transformations/remove_header_and_footer_transform.py:122-128 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) private_gpt/worker/modes.py:20— private_gpt/worker/modes.py:20-24 | private_gpt/worker/modes.py:44-48 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `private_gpt/worker/modes.py:51` calls `get`, `strip` and `private_gpt/worker/modes.py:28` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 2) private_gpt/components/embedding/embedding_component.py:119— private_gpt/components/embedding/embedding_component.py:119-123 | private_gpt/components/llm/llm_component.py:142-146 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) private_gpt/components/embedding/factories/factory.py:29— private_gpt/components/embedding/factories/factory.py:29-34 | private_gpt/components/llm/factories/registry.py:31-36 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (6 lines × 2) private_gpt/components/postgres/postgres_client.py:88— private_gpt/components/postgres/postgres_client.py:88-93 | private_gpt/components/sqlite/sqlite_client.py:69-74 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Low cohesion: TreeNode (LCOM4 5) private_gpt/components/readers/nodes/tree_node.py:49— TreeNode's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ToolService (LCOM4 5) private_gpt/server/tools/tool_service.py:35— ToolService's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
AC6 · Visual & motion safety· Focus outline removed in CSS without a · ×1
Focus outline removed in CSS without a :focus replacement REDACTED:1811— `.model-search-wrap .model-search` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 6 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
REDACTED.renderCodeExecToolUse (cyclomatic 132) REDACTED:5829— REDACTED.renderCodeExecToolUse has cyclomatic complexity 132 (threshold 15). Of this number, 105 points are the body's own statements and 27 belong to 8 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
ChatBody.validate_properties (cyclomatic 58) private_gpt/server/chat/chat_models.py:287— ChatBody.validate_properties has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
EmailTextReader._extract_content_and_attachments (cyclomatic 56) private_gpt/components/readers/text/email_reader.py:240— EmailTextReader._extract_content_and_attachments has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
REDACTED.paintAppearance (cyclomatic 52) REDACTED:4407— REDACTED.paintAppearance has cyclomatic complexity 52 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
event_folding.fold_events (cyclomatic 43) private_gpt/events/event_folding.py:81— event_folding.fold_events has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
citations.process_citations (cyclomatic 41) private_gpt/components/chat/processors/events/citations/citations.py:22— citations.process_citations has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
REDACTED.blocksToHtml (cyclomatic 41) REDACTED:6066— REDACTED.blocksToHtml has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 15 of the 41 points are its own statements and the rest belongs to one function literal inside it that branches (line 6086). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
AsyncChatEngine._handle_stream_chunk (cyclomatic 40) private_gpt/components/engines/chat/async_chat_engine.py:1252— AsyncChatEngine._handle_stream_chunk has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ChatLoopEngine._handle_stream_chunk (cyclomatic 40) private_gpt/components/engines/chat/chat_engine.py:546— ChatLoopEngine._handle_stream_chunk has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
REDACTED.renderToolResultContent (cyclomatic 40) REDACTED:5739— REDACTED.renderToolResultContent has cyclomatic complexity 40 (threshold 15). Of this number, 34 points are the body's own statements and 6 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
REDACTED.bindEvents (cyclomatic 40) REDACTED:7881— REDACTED.bindEvents has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to 19 function literals inside it that branch (lines 8008, 7950, 8033, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
REDACTED.buildChatBody (cyclomatic 39) REDACTED:7209— REDACTED.buildChatBody has cyclomatic complexity 39 (threshold 15). Of this number, 31 points are the body's own statements and 8 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
REDACTED.apiStreamFetch (cyclomatic 38) REDACTED:6623— REDACTED.apiStreamFetch has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
model_discovery._run (cyclomatic 33) private_gpt/components/llm/tokenizers/models/model_discovery.py:226— model_discovery._run has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
input_models.validate_system_config (cyclomatic 32) private_gpt/chat/input_models.py:165— input_models.validate_system_config has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
tool_utils.execute_tool_call (cyclomatic 30) private_gpt/components/engines/chat/utils/tool_utils.py:133— tool_utils.execute_tool_call has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ExtractCitationInterceptor.intercept_event (cyclomatic 29) private_gpt/server/chat/interceptors/extract_citation_interceptor.py:71— ExtractCitationInterceptor.intercept_event has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MessageInput._reorder_tldr_messages (cyclomatic 28) private_gpt/chat/input_models.py:779— MessageInput._reorder_tldr_messages has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
schema_coercing_tool_interceptor._coerce_scalar (cyclomatic 28) private_gpt/server/chat/interceptors/schema_coercing_tool_interceptor.py:240— schema_coercing_tool_interceptor._coerce_scalar has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MessageInput._convert_assistant_message (cyclomatic 27) private_gpt/chat/input_models.py:1070— MessageInput._convert_assistant_message has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ValidatorRequestInterceptor.intercept (cyclomatic 26) private_gpt/server/chat/interceptors/validator_request_interceptor.py:40— ValidatorRequestInterceptor.intercept has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
REDACTED.renderModelSelect (cyclomatic 25) REDACTED:5184— REDACTED.renderModelSelect has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 6 of the 25 points are its own statements and the rest belongs to 10 function items inside it that branch (updateButtonLabel, a function literal at line 5212, modelName, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
format._format_documents_as_xml (cyclomatic 24) private_gpt/components/engines/citations/format.py:92— format._format_documents_as_xml has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DatabaseQueryToolBuilder._get_additional_context (cyclomatic 24) private_gpt/components/tools/builders/database_query_builder.py:113— DatabaseQueryToolBuilder._get_additional_context has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
schema_coercing_tool_interceptor._coerce_value (cyclomatic 24) private_gpt/server/chat/interceptors/schema_coercing_tool_interceptor.py:300— schema_coercing_tool_interceptor._coerce_value has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MarkdownMerger._merge_pages (cyclomatic 23) private_gpt/components/ingest/transformations/make_continuation_markdown_transform.py:88— MarkdownMerger._merge_pages has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MarkdownHelper._sanity_data (cyclomatic 23) private_gpt/components/markdown/markdown_helper.py:10— MarkdownHelper._sanity_data has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_converters.from_tool_output (cyclomatic 23) private_gpt/events/models/_converters.py:66— _converters.from_tool_output has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
REDACTED.migrateState (cyclomatic 23) REDACTED:4141— REDACTED.migrateState has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
REDACTED.requestAssistant (cyclomatic 23) REDACTED:7013— REDACTED.requestAssistant has cyclomatic complexity 23 (threshold 15). Of this number, 17 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
mistral._prepare_apply_chat_template_tools_and_messages (cyclomatic 22) private_gpt/components/llm/tokenizers/mistral.py:205— mistral._prepare_apply_chat_template_tools_and_messages has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
REDACTED.sanitizeMessages (cyclomatic 22) REDACTED:7154— REDACTED.sanitizeMessages has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body's own statements and 11 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
multimodality_preprocessor.preprocess_multimodal_message (cyclomatic 21) private_gpt/components/chat/processors/chat_history/multimodality/multimodality_preprocessor.py:94— multimodality_preprocessor.preprocess_multimodal_message has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DatabaseQueryGenerator._query (cyclomatic 21) REDACTED:525— DatabaseQueryGenerator._query has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
REDACTED.collectToolResultCitationSources (cyclomatic 21) REDACTED:6204— REDACTED.collectToolResultCitationSources has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 6219, 6209, 6217, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
AsyncChatEngine._run_iteration_body (cyclomatic 20) private_gpt/components/engines/chat/async_chat_engine.py:1086— AsyncChatEngine._run_iteration_body has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MarkdownNormalizer.normalize_markdown (cyclomatic 20) private_gpt/components/ingest/transformations/markdown_normalization_transform.py:47— MarkdownNormalizer.normalize_markdown has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TextEditorProcessor._build (cyclomatic 20) private_gpt/components/tools/processors/text_editor_processor.py:43— TextEditorProcessor._build has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
schema_models._validate_json_schema_item (cyclomatic 19) private_gpt/chat/schema_models.py:88— schema_models._validate_json_schema_item has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
multimodality_preprocessor.preprocess_multimodal_history (cyclomatic 19) private_gpt/components/chat/processors/chat_history/multimodality/multimodality_preprocessor.py:233— multimodality_preprocessor.preprocess_multimodal_history has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ChatLoopEngine._run_iteration (cyclomatic 19) private_gpt/components/engines/chat/chat_engine.py:375— ChatLoopEngine._run_iteration has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
utils.deduplicate_documents_in_history (cyclomatic 19) private_gpt/components/engines/citations/utils.py:279— utils.deduplicate_documents_in_history has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MarkdownTreeNodeParser._process_element (cyclomatic 19) private_gpt/components/ingest/transformations/markdown_to_tree_transform.py:260— MarkdownTreeNodeParser._process_element has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
utils._format_hf_content_block (cyclomatic 19) private_gpt/components/llm/utils.py:21— utils._format_hf_content_block has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DatabaseQueryGenerator._try_to_fix_unsupported_type_error (cyclomatic 19) REDACTED:1165— DatabaseQueryGenerator._try_to_fix_unsupported_type_error has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
utils.replace_citations_in_text (cyclomatic 18) private_gpt/components/engines/citations/utils.py:446— utils.replace_citations_in_text has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PPTX2MdReader.lazy_load_data (cyclomatic 18) private_gpt/components/readers/pptx2md/pptx2md_reader.py:213— PPTX2MdReader.lazy_load_data has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
VisionReader.lazy_load_data (cyclomatic 18) private_gpt/components/readers/vision/convert_doc_into_image.py:214— VisionReader.lazy_load_data has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
artifact_refs.resolve_artifact_refs (cyclomatic 18) private_gpt/components/tools/artifact_refs.py:154— artifact_refs.resolve_artifact_refs has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MessageFolder.add (cyclomatic 18) private_gpt/observability/message.py:52— MessageFolder.add has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
schema_coercing_tool_interceptor._normalize_schema (cyclomatic 18) private_gpt/server/chat/interceptors/schema_coercing_tool_interceptor.py:88— schema_coercing_tool_interceptor._normalize_schema has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
REDACTED.apiFetch (cyclomatic 18) REDACTED:6566— REDACTED.apiFetch has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
REDACTED.openSkillModal (cyclomatic 18) REDACTED:7450— REDACTED.openSkillModal has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 7467). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
MessageInput._extract_content (cyclomatic 17) private_gpt/chat/input_models.py:996— MessageInput._extract_content has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MessagesInputBase.normalize_system (cyclomatic 17) private_gpt/chat/input_models.py:1347— MessagesInputBase.normalize_system has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
IngestionHelper.validate_file_info (cyclomatic 17) private_gpt/components/ingest/ingest_helper.py:21— IngestionHelper.validate_file_info has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
StreamProcessor.process_stream (cyclomatic 17) private_gpt/components/streaming/stream/stream_processor.py:29— StreamProcessor.process_stream has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PatchedQdrantVectorStore.get_nodes (cyclomatic 17) private_gpt/components/vector_store/patched_qdrant_store.py:627— PatchedQdrantVectorStore.get_nodes has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
skills_loop_interceptor._iter_tool_selections (cyclomatic 17) private_gpt/server/chat/interceptors/skills_loop_interceptor.py:77— skills_loop_interceptor._iter_tool_selections has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ContentService._filter_tree_nodes (cyclomatic 17) private_gpt/server/content/content_service.py:168— ContentService._filter_tree_nodes has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
benchmark_chat_stream.run (cyclomatic 17) scripts/benchmark_chat_stream.py:212— benchmark_chat_stream.run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
REDACTED.updateMessageNode (cyclomatic 17) REDACTED:5517— REDACTED.updateMessageNode has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
HeartbeatWorker._recover_stale_in_progress_jobs (cyclomatic 16) private_gpt/arq/liveness.py:169— HeartbeatWorker._recover_stale_in_progress_jobs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CondenserContextMemoryStrategy._condense_from_left (cyclomatic 16) private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:467— CondenserContextMemoryStrategy._condense_from_left has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DatabaseFunctionsInspector._get_db2_functions (cyclomatic 16) REDACTED:210— DatabaseFunctionsInspector._get_db2_functions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DatabaseProcedureInspector._get_db2_procedures (cyclomatic 16) REDACTED:210— DatabaseProcedureInspector._get_db2_procedures has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TrimmingMemory._trim_last_max_tokens (cyclomatic 16) private_gpt/components/memory/trimming_memory.py:197— TrimmingMemory._trim_last_max_tokens has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ImageProcessingWorkflow.extract_content (cyclomatic 16) private_gpt/components/multimodality/image_handler.py:213— ImageProcessingWorkflow.extract_content has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
PatchedQdrantVectorStore.aget_nodes (cyclomatic 16) private_gpt/components/vector_store/patched_qdrant_store.py:736— PatchedQdrantVectorStore.aget_nodes has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ContentService._retrieve_document_node (cyclomatic 16) private_gpt/server/content/content_service.py:279— ContentService._retrieve_document_node has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
skills_files.stored_files_from_uploads (cyclomatic 16) private_gpt/server/skills/skills_files.py:41— skills_files.stored_files_from_uploads has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
REDACTED.renderMessages (cyclomatic 16) REDACTED:5461— REDACTED.renderMessages has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5490, 5483). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest. This file is where this pass's cyclomatic complexity CONCENTRATES: REDACTED holds 16 of the 72 methods over the threshold — including the worst — and 325 of the 782 points over it (42%), 7.1× the next-largest file (private_gpt/chat/input_models.py at 46). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
REDACTED.renderCodeExecToolUse (cognitive 168) REDACTED:5829— REDACTED.renderCodeExecToolUse has cognitive complexity 168 (threshold 15). Drivers by points: if/else 49 (81 pts), boolean chains 50, ternaries 13 (37 pts) (nesting depth added 56). Of this number, 139 points are the body's own statements and 29 belong to 8 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EmailTextReader._extract_content_and_attachments (cognitive 148) private_gpt/components/readers/text/email_reader.py:240— EmailTextReader._extract_content_and_attachments has cognitive complexity 148 (threshold 15). Drivers by points: if/else 25 (94 pts), error handling 5 (19 pts), boolean chains 17, ternaries 2 (10 pts), loops 3 (8 pts) (nesting depth added 96). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
citations.process_citations (cognitive 106) private_gpt/components/chat/processors/events/citations/citations.py:22— citations.process_citations has cognitive complexity 106 (threshold 15). Drivers by points: if/else 18 (64 pts), ternaries 8 (32 pts), boolean chains 9, loops 1 (nesting depth added 70). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ChatBody.validate_properties (cognitive 97) private_gpt/server/chat/chat_models.py:287— ChatBody.validate_properties has cognitive complexity 97 (threshold 15). Drivers by points: if/else 36 (73 pts), boolean chains 13, loops 5 (11 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsyncChatEngine._handle_stream_chunk (cognitive 91) private_gpt/components/engines/chat/async_chat_engine.py:1252— AsyncChatEngine._handle_stream_chunk has cognitive complexity 91 (threshold 15). Drivers by points: if/else 21 (59 pts), ternaries 4 (16 pts), boolean chains 11, loops 3 (5 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ChatLoopEngine._handle_stream_chunk (cognitive 91) private_gpt/components/engines/chat/chat_engine.py:546— ChatLoopEngine._handle_stream_chunk has cognitive complexity 91 (threshold 15). Drivers by points: if/else 21 (59 pts), ternaries 4 (16 pts), boolean chains 11, loops 3 (5 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MessageInput._reorder_tldr_messages (cognitive 81) private_gpt/chat/input_models.py:779— MessageInput._reorder_tldr_messages has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (64 pts), loops 6 (14 pts), boolean chains 3 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
event_folding.fold_events (cognitive 78) private_gpt/events/event_folding.py:81— event_folding.fold_events has cognitive complexity 78 (threshold 15). Drivers by points: if/else 18 (63 pts), boolean chains 14, loops 1 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
schema_coercing_tool_interceptor._coerce_scalar (cognitive 70) private_gpt/server/chat/interceptors/schema_coercing_tool_interceptor.py:240— schema_coercing_tool_interceptor._coerce_scalar has cognitive complexity 70 (threshold 15). Drivers by points: if/else 19 (56 pts), error handling 2 (6 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
model_discovery._run (cognitive 65) private_gpt/components/llm/tokenizers/models/model_discovery.py:226— model_discovery._run has cognitive complexity 65 (threshold 15). Drivers by points: if/else 26 (44 pts), loops 7 (17 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.blocksToHtml (cognitive 63) REDACTED:6066— REDACTED.blocksToHtml has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 16, ternaries 4 (12 pts), loops 1 (nesting depth added 24). Of this number, 19 points are the body's own statements and 44 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.apiStreamFetch (cognitive 62) REDACTED:6623— REDACTED.apiStreamFetch has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 14, loops 3 (7 pts), error handling 1 (6 pts), ternaries 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MessageInput._convert_assistant_message (cognitive 55) private_gpt/chat/input_models.py:1070— MessageInput._convert_assistant_message has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (34 pts), boolean chains 8, ternaries 3 (8 pts), loops 2 (5 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
format._format_documents_as_xml (cognitive 53) private_gpt/components/engines/citations/format.py:92— format._format_documents_as_xml has cognitive complexity 53 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 11 (22 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.paintAppearance (cognitive 50) REDACTED:4407— REDACTED.paintAppearance has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 24 (25 pts), boolean chains 24, if/else 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
mistral._prepare_apply_chat_template_tools_and_messages (cognitive 49) private_gpt/components/llm/tokenizers/mistral.py:205— mistral._prepare_apply_chat_template_tools_and_messages has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 5 (13 pts), boolean chains 4 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils.replace_citations_in_text (cognitive 46) private_gpt/components/engines/citations/utils.py:446— utils.replace_citations_in_text has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 4 (18 pts), loops 5 (13 pts), if/else 4 (11 pts), boolean chains 4 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.sanitizeMessages (cognitive 45) REDACTED:7154— REDACTED.sanitizeMessages has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (28 pts), ternaries 2 (7 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 21). Of this number, 26 points are the body's own statements and 19 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
input_models.validate_system_config (cognitive 44) private_gpt/chat/input_models.py:165— input_models.validate_system_config has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 14, error handling 2 (6 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseQueryGenerator._try_to_fix_unsupported_type_error (cognitive 43) REDACTED:1165— DatabaseQueryGenerator._try_to_fix_unsupported_type_error has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 3 (9 pts), boolean chains 2, error handling 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MarkdownMerger._merge_pages (cognitive 42) private_gpt/components/ingest/transformations/make_continuation_markdown_transform.py:88— MarkdownMerger._merge_pages has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.bindEvents (cognitive 42) REDACTED:7881— REDACTED.bindEvents has cognitive complexity 42 (threshold 15). Drivers by points: if/else 32 (34 pts), boolean chains 6, ternaries 2 (nesting depth added 2). None of this is in the body itself: all 42 points belong to 19 function literals inside it that branch (lines 8008, 7950, 7962, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
ExtractCitationInterceptor.intercept_event (cognitive 41) private_gpt/server/chat/interceptors/extract_citation_interceptor.py:71— ExtractCitationInterceptor.intercept_event has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 10 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.renderToolResultContent (cognitive 41) REDACTED:5739— REDACTED.renderToolResultContent has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 12, ternaries 2 (5 pts) (nesting depth added 9). Of this number, 34 points are the body's own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.buildChatBody (cognitive 38) REDACTED:7209— REDACTED.buildChatBody has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 18, if/else 11 (13 pts), error handling 2 (4 pts), ternaries 3 (nesting depth added 4). Of this number, 29 points are the body's own statements and 9 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
utils.deduplicate_documents_in_history (cognitive 37) private_gpt/components/engines/citations/utils.py:279— utils.deduplicate_documents_in_history has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 5 (9 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schema_coercing_tool_interceptor._coerce_value (cognitive 37) private_gpt/server/chat/interceptors/schema_coercing_tool_interceptor.py:300— schema_coercing_tool_interceptor._coerce_value has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 6, ternaries 1 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ContentService._filter_tree_nodes (cognitive 37) private_gpt/server/content/content_service.py:168— ContentService._filter_tree_nodes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (14 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.requestAssistant (cognitive 37) REDACTED:7013— REDACTED.requestAssistant has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 5, ternaries 3 (5 pts), error handling 1, loops 1 (nesting depth added 12). Of this number, 29 points are the body's own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EnsureToolAreFlattenInterceptor._reorder_tool_messages (cognitive 36) private_gpt/components/engines/chat/interceptors/ensure_tools_are_flatten_interceptor.py:26— EnsureToolAreFlattenInterceptor._reorder_tool_messages has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (29 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
tool_utils.execute_tool_call (cognitive 35) private_gpt/components/engines/chat/utils/tool_utils.py:133— tool_utils.execute_tool_call has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 12, loops 2 (4 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseQueryToolBuilder._get_additional_context (cognitive 35) private_gpt/components/tools/builders/database_query_builder.py:113— DatabaseQueryToolBuilder._get_additional_context has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 6, ternaries 2 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schema_coercing_tool_interceptor._normalize_schema (cognitive 33) private_gpt/server/chat/interceptors/schema_coercing_tool_interceptor.py:88— schema_coercing_tool_interceptor._normalize_schema has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (9 pts), boolean chains 5 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
multimodality_preprocessor.preprocess_multimodal_history (cognitive 32) private_gpt/components/chat/processors/chat_history/multimodality/multimodality_preprocessor.py:233— multimodality_preprocessor.preprocess_multimodal_history has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (5 pts), boolean chains 3, ternaries 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MarkdownHelper._sanity_data (cognitive 32) private_gpt/components/markdown/markdown_helper.py:10— MarkdownHelper._sanity_data has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MarkdownNormalizer.normalize_markdown (cognitive 31) private_gpt/components/ingest/transformations/markdown_normalization_transform.py:47— MarkdownNormalizer.normalize_markdown has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 4, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.renderMarkdownText (cognitive 30) REDACTED:6366— REDACTED.renderMarkdownText has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 15). Of this number, 29 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.apiFetch (cognitive 30) REDACTED:6566— REDACTED.apiFetch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 5 (9 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ValidatorRequestInterceptor.intercept (cognitive 29) private_gpt/server/chat/interceptors/validator_request_interceptor.py:40— ValidatorRequestInterceptor.intercept has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 6, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
condensation_interceptor._condensation_producer (cognitive 28) private_gpt/server/chat/interceptors/condensation_interceptor.py:55— condensation_interceptor._condensation_producer has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (5 pts), boolean chains 3, error handling 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mistral.truncate_tool_call_ids (cognitive 27) private_gpt/components/llm/tokenizers/mistral.py:109— mistral.truncate_tool_call_ids has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StreamProcessor.process_stream (cognitive 27) private_gpt/components/streaming/stream/stream_processor.py:29— StreamProcessor.process_stream has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 3, error handling 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schema_models._validate_json_schema_item (cognitive 26) private_gpt/chat/schema_models.py:88— schema_models._validate_json_schema_item has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
multimodality_preprocessor.preprocess_multimodal_message (cognitive 26) private_gpt/components/chat/processors/chat_history/multimodality/multimodality_preprocessor.py:94— multimodality_preprocessor.preprocess_multimodal_message has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, loops 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RemoveHeaderAndFooterTransform._remove_header (cognitive 26) private_gpt/components/ingest/transformations/remove_header_and_footer_transform.py:57— RemoveHeaderAndFooterTransform._remove_header has cognitive complexity 26 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (6 pts), ternaries 2 (6 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseQueryGenerator._query (cognitive 26) REDACTED:525— DatabaseQueryGenerator._query has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7, ternaries 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
condensation_interceptor._consume_and_emit_with_min_duration (cognitive 26) private_gpt/server/chat/interceptors/condensation_interceptor.py:233— condensation_interceptor._consume_and_emit_with_min_duration has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 pts), error handling 1 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PPTX2MdReader.lazy_load_data (cognitive 25) private_gpt/components/readers/pptx2md/pptx2md_reader.py:213— PPTX2MdReader.lazy_load_data has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VisionReader.lazy_load_data (cognitive 25) private_gpt/components/readers/vision/convert_doc_into_image.py:214— VisionReader.lazy_load_data has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ContentService._retrieve_document_node (cognitive 25) private_gpt/server/content/content_service.py:279— ContentService._retrieve_document_node has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 5 (10 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
skills_files.stored_files_from_uploads (cognitive 25) private_gpt/server/skills/skills_files.py:41— skills_files.stored_files_from_uploads has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (5 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
task_helper.find_tasks (cognitive 24) private_gpt/celery/task_helper.py:26— task_helper.find_tasks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MessageInput._process_messages (cognitive 24) private_gpt/chat/input_models.py:559— MessageInput._process_messages has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MessageInput._extract_content (cognitive 24) private_gpt/chat/input_models.py:996— MessageInput._extract_content has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 2, boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsyncChatEngine._run_iteration_body (cognitive 24) private_gpt/components/engines/chat/async_chat_engine.py:1086— AsyncChatEngine._run_iteration_body has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RemoveHeaderAndFooterTransform._remove_footer (cognitive 24) private_gpt/components/ingest/transformations/remove_header_and_footer_transform.py:99— RemoveHeaderAndFooterTransform._remove_footer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), ternaries 1 (4 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils._format_hf_content_block (cognitive 24) private_gpt/components/llm/utils.py:21— utils._format_hf_content_block has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SplitSubtreeAlg.split_subtree (cognitive 24) private_gpt/components/postprocessor/tree_expansion/split_subtrees.py:25— SplitSubtreeAlg.split_subtree has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
skills_loop_interceptor._iter_tool_selections (cognitive 24) private_gpt/server/chat/interceptors/skills_loop_interceptor.py:77— skills_loop_interceptor._iter_tool_selections has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
async_utils.to_async_iterator (cognitive 24) private_gpt/utils/async_utils.py:26— async_utils.to_async_iterator has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 4 (8 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EnhancedPPTXTransform._detect_existing_complex_shapes (cognitive 23) private_gpt/components/readers/pptx2md/convert_slide_into_image.py:368— EnhancedPPTXTransform._detect_existing_complex_shapes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), error handling 6 (8 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MessagesInputBase.normalize_system (cognitive 22) private_gpt/chat/input_models.py:1347— MessagesInputBase.normalize_system has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
run._pick_model (cognitive 22) private_gpt/cli/commands/run.py:143— run._pick_model has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
document_preprocessor.preprocess_document_history (cognitive 22) private_gpt/components/chat/processors/chat_history/documents/document_preprocessor.py:190— document_preprocessor.preprocess_document_history has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
repairs._assert_user_blocks (cognitive 22) private_gpt/components/chat/processors/chat_history/memory/utils/repairs.py:118— repairs._assert_user_blocks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MarkdownTreeNodeParser._process_element (cognitive 22) private_gpt/components/ingest/transformations/markdown_to_tree_transform.py:260— MarkdownTreeNodeParser._process_element has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LLMComponent._initialize_models (cognitive 22) private_gpt/components/llm/llm_component.py:59— LLMComponent._initialize_models has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, error handling 1 (2 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TrimmingMemory._trim_last_max_tokens (cognitive 22) private_gpt/components/memory/trimming_memory.py:197— TrimmingMemory._trim_last_max_tokens has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PrevNextReplacementPostProcessor._postprocess_nodes (cognitive 22) private_gpt/components/postprocessor/prev_next_replacement.py:36— PrevNextReplacementPostProcessor._postprocess_nodes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DocumentTreeExpander._expand_horizontally (cognitive 22) private_gpt/components/postprocessor/tree_expansion/document_expander.py:336— DocumentTreeExpander._expand_horizontally has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
IncrementalTextProcessor.process (cognitive 22) private_gpt/components/text_processing/engine.py:31— IncrementalTextProcessor.process has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
artifact_refs.resolve_artifact_refs (cognitive 22) private_gpt/components/tools/artifact_refs.py:154— artifact_refs.resolve_artifact_refs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
skills_loop_interceptor._resolve_skill_states (cognitive 22) private_gpt/server/chat/interceptors/skills_loop_interceptor.py:138— skills_loop_interceptor._resolve_skill_states has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
batches.aiter_batch (cognitive 22) private_gpt/utils/batches.py:58— batches.aiter_batch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schema_models._resolve_json_type (cognitive 21) private_gpt/chat/schema_models.py:176— schema_models._resolve_json_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (6 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseFunctionsInspector._get_sqlserver_functions (cognitive 21) REDACTED:123— DatabaseFunctionsInspector._get_sqlserver_functions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, error handling 1, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseProcedureInspector._get_sqlserver_procedures (cognitive 21) REDACTED:122— DatabaseProcedureInspector._get_sqlserver_procedures has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, error handling 1, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MistralTokenizer.convert_ids_to_tokens (cognitive 21) private_gpt/components/llm/tokenizers/mistral.py:776— MistralTokenizer.convert_ids_to_tokens has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
model_cache.find_repo_candidates (cognitive 21) private_gpt/components/llm/tokenizers/models/model_cache.py:138— model_cache.find_repo_candidates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PatchedQdrantVectorStore._add_missing_logical_multitenancy_filter (cognitive 21) private_gpt/components/vector_store/patched_qdrant_store.py:312— PatchedQdrantVectorStore._add_missing_logical_multitenancy_filter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
exporters._hex_ids (cognitive 21) private_gpt/observability/exporters.py:127— exporters._hex_ids has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 1 (6 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
REDACTED.openSkillModal (cognitive 21) REDACTED:7450— REDACTED.openSkillModal has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (10 pts), boolean chains 5, if/else 4 (5 pts), error handling 1 (nesting depth added 3). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 7467). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
HeartbeatWorker._recover_stale_in_progress_jobs (cognitive 20) private_gpt/arq/liveness.py:169— HeartbeatWorker._recover_stale_in_progress_jobs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (6 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MessageInput._support_legacy_messages (cognitive 20) private_gpt/chat/input_models.py:406— MessageInput._support_legacy_messages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MessageInput._fold_mid_conv_system_into_tool_results (cognitive 20) private_gpt/chat/input_models.py:460— MessageInput._fold_mid_conv_system_into_tool_results has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CondenserContextMemoryStrategy._condense_from_left (cognitive 20) private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:467— CondenserContextMemoryStrategy._condense_from_left has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tldr_utils._trim_right_tldrs (cognitive 20) private_gpt/components/chat/processors/chat_history/memory/tldr_utils.py:12— tldr_utils._trim_right_tldrs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
format._guarantee_valid_user_block_sequence (cognitive 20) private_gpt/components/chat/processors/chat_history/memory/utils/format.py:9— format._guarantee_valid_user_block_sequence has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseFunctionsInspector._get_postgresql_functions (cognitive 20) REDACTED:34— DatabaseFunctionsInspector._get_postgresql_functions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseFunctionsInspector._get_db2_functions (cognitive 20) REDACTED:210— DatabaseFunctionsInspector._get_db2_functions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseProcedureInspector._get_postgresql_procedures (cognitive 20) REDACTED:33— DatabaseProcedureInspector._get_postgresql_procedures has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseProcedureInspector._get_db2_procedures (cognitive 20) REDACTED:210— DatabaseProcedureInspector._get_db2_procedures has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ChatLoopEngine._run_iteration (cognitive 20) private_gpt/components/engines/chat/chat_engine.py:375— ChatLoopEngine._run_iteration has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, loops 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
MistralTokenizer.convert_tokens_to_string (cognitive 20) private_gpt/components/llm/tokenizers/mistral.py:691— MistralTokenizer.convert_tokens_to_string has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TableRowNode.is_first_row (cognitive 20) private_gpt/components/readers/nodes/table_node.py:208— TableRowNode.is_first_row has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (TableRowNode.is_last_row) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
TableRowNode.is_last_row (cognitive 20) private_gpt/components/readers/nodes/table_node.py:247— TableRowNode.is_last_row has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (TableRowNode.is_first_row) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SelectBestLinks.process_results (cognitive 20) private_gpt/components/web/web_search/processors/select_best_links.py:77— SelectBestLinks.process_results has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TreeSummarizeSynthesizer.get_response (cognitive 20) private_gpt/components/workflows/others/tree_summarize_synthesizer.py:196— TreeSummarizeSynthesizer.get_response has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CitationRequestInterceptor.intercept (cognitive 20) private_gpt/server/chat/interceptors/citation_interceptor.py:29— CitationRequestInterceptor.intercept has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.renderOnboarding (cognitive 20) REDACTED:4907— REDACTED.renderOnboarding has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (13 pts), boolean chains 7 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
input_models.validate_tool_spec (cognitive 19) private_gpt/chat/input_models.py:1232— input_models.validate_tool_spec has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
request_builder._merge_mounts (cognitive 19) private_gpt/components/engines/chat/utils/request_builder.py:79— request_builder._merge_mounts has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TableExpansionPostProcessor._postprocess_nodes (cognitive 19) private_gpt/components/postprocessor/tree_expansion/table_expansion_post_processor.py:18— TableExpansionPostProcessor._postprocess_nodes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (3 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TreePrinter.print_tree (cognitive 19) private_gpt/components/readers/nodes/node_print.py:95— TreePrinter.print_tree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PatchedQdrantVectorStore.get_nodes (cognitive 19) private_gpt/components/vector_store/patched_qdrant_store.py:627— PatchedQdrantVectorStore.get_nodes has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 4 (5 pts), loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
SemconvSpanProcessor.on_end (cognitive 19) private_gpt/observability/processors.py:294— SemconvSpanProcessor.on_end has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 1 (3 pts), error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MessagesInputBase.extract_system_messages (cognitive 18) private_gpt/chat/input_models.py:1395— MessagesInputBase.extract_system_messages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tldr_processor.condense_chat_history (cognitive 18) private_gpt/components/chat/processors/chat_history/memory/tldr_processor.py:89— tldr_processor.condense_chat_history has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
EmbeddingComponent._initialize_models (cognitive 18) private_gpt/components/embedding/embedding_component.py:49— EmbeddingComponent._initialize_models has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, error handling 1 (2 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsyncChatEngine._initialize_run (cognitive 18) private_gpt/components/engines/chat/async_chat_engine.py:1791— AsyncChatEngine._initialize_run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TextAnalyzer.get_unique_terms (cognitive 18) private_gpt/components/engines/citations/term_extractor.py:159— TextAnalyzer.get_unique_terms has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
model_discovery.main (cognitive 18) private_gpt/components/llm/tokenizers/models/model_discovery.py:370— model_discovery.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 3, boolean chains 2, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
parser._parse_legacy_frontmatter (cognitive 18) private_gpt/components/skills/parser.py:109— parser._parse_legacy_frontmatter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 1 (3 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PatchedQdrantVectorStore._init_collection (cognitive 18) private_gpt/components/vector_store/patched_qdrant_store.py:218— PatchedQdrantVectorStore._init_collection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (6 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PatchedQdrantVectorStore.aget_nodes (cognitive 18) private_gpt/components/vector_store/patched_qdrant_store.py:736— PatchedQdrantVectorStore.aget_nodes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, ternaries 4 (5 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
MessageFolder.add (cognitive 18) private_gpt/observability/message.py:52— MessageFolder.add has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
McpRequestInterceptor.intercept (cognitive 18) private_gpt/server/chat/interceptors/mcp_interceptor.py:289— McpRequestInterceptor.intercept has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
convert_router.convert_content (cognitive 18) private_gpt/server/ingest/convert_router.py:329— convert_router.convert_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
settings_loader.discover_exporters_from_environment (cognitive 18) private_gpt/settings/settings_loader.py:154— settings_loader.discover_exporters_from_environment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
benchmark_chat_stream.run (cognitive 18) scripts/benchmark_chat_stream.py:212— benchmark_chat_stream.run has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (5 pts), error handling 2 (3 pts), ternaries 3, loops 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
build_pip_index.build_index (cognitive 18) scripts/build_pip_index.py:98— build_pip_index.build_index has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.renderMessages (cognitive 18) REDACTED:5461— REDACTED.renderMessages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5490, 5483). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
REDACTED.collectToolResultCitationSources (cognitive 18) REDACTED:6204— REDACTED.collectToolResultCitationSources has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, ternaries 2 (3 pts) (nesting depth added 3). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 6219, 6209, 6214, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
citations.process_chat_history_with_documents (cognitive 17) private_gpt/components/chat/processors/chat_history/documents/citations.py:18— citations.process_chat_history_with_documents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RestoreStatelessInputInterceptorRequest._merge_stack_from_original (cognitive 17) private_gpt/components/engines/chat/interceptors/restore_stateless_input_interceptor.py:37— RestoreStatelessInputInterceptorRequest._merge_stack_from_original has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PatchedOpenAIResponsesLLM.get_tool_calls_from_response (cognitive 17) private_gpt/components/llm/custom/openairesponses.py:197— PatchedOpenAIResponsesLLM.get_tool_calls_from_response has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ImageProcessingWorkflow.extract_content (cognitive 17) private_gpt/components/multimodality/image_handler.py:213— ImageProcessingWorkflow.extract_content has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (11 pts), boolean chains 3, if/else 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
TreeNode.rebuild_tree (cognitive 17) private_gpt/components/readers/nodes/tree_node.py:497— TreeNode.rebuild_tree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4, boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseQueryGenerator._fix_cursor_result (cognitive 17) REDACTED:402— DatabaseQueryGenerator._fix_cursor_result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseQueryGenerator._prepare_connection_string (cognitive 17) REDACTED:449— DatabaseQueryGenerator._prepare_connection_string has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TextEditorProcessor._build (cognitive 17) private_gpt/components/tools/processors/text_editor_processor.py:43— TextEditorProcessor._build has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 12, if/else 2 (4 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
chat.state_snapshot (cognitive 17) private_gpt/observability/chat.py:266— chat.state_snapshot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
McpRequestInterceptor._apply_token_refresh (cognitive 17) private_gpt/server/chat/interceptors/mcp_interceptor.py:158— McpRequestInterceptor._apply_token_refresh has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.renderModelSelect (cognitive 17) REDACTED:5184— REDACTED.renderModelSelect has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 5, ternaries 4. Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 5212, modelName, updateButtonLabel, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
REDACTED.updateMessageNode (cognitive 17) REDACTED:5517— REDACTED.updateMessageNode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schema_models._build_model_from_json_schema (cognitive 16) private_gpt/chat/schema_models.py:420— schema_models._build_model_from_json_schema has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tool_choices._add_suffix_to_last_user_message (cognitive 16) private_gpt/components/chat/processors/chat_history/tools/tool_choices.py:48— tool_choices._add_suffix_to_last_user_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
IngestionHelper.validate_file_info (cognitive 16) private_gpt/components/ingest/ingest_helper.py:21— IngestionHelper.validate_file_info has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, error handling 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
PatchedOpenAIResponsesLLM._get_model_kwargs (cognitive 16) private_gpt/components/llm/custom/openairesponses.py:254— PatchedOpenAIResponsesLLM._get_model_kwargs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mistral.maybe_serialize_tool_calls (cognitive 16) private_gpt/components/llm/tokenizers/mistral.py:68— mistral.maybe_serialize_tool_calls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 1 (4 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TreeExpansionReplacementPostProcessor._merge_subtrees (cognitive 16) private_gpt/components/postprocessor/tree_expansion/tree_expansion_replacement_post_processor.py:466— TreeExpansionReplacementPostProcessor._merge_subtrees has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DoclingApiReader.lazy_load_data (cognitive 16) private_gpt/components/readers/docling/docling_api_reader.py:147— DoclingApiReader.lazy_load_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (6 pts), boolean chains 1, error handling 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ImageNode.get_content_internal (cognitive 16) private_gpt/components/readers/nodes/image_node.py:33— ImageNode.get_content_internal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EmailContent.to_llm_friendly_text (cognitive 16) private_gpt/components/readers/text/email_reader.py:53— EmailContent.to_llm_friendly_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StreamBroadcast.read_from (cognitive 16) private_gpt/components/streaming/stream/stream_reader.py:78— StreamBroadcast.read_from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TabularDataProcessor.intercept (cognitive 16) private_gpt/components/tools/processors/tabular_data_processor.py:33— TabularDataProcessor.intercept has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
launcher.create_app (cognitive 16) private_gpt/launcher.py:130— launcher.create_app has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 5 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schema_coercing_tool_interceptor._coerce_kwargs (cognitive 16) private_gpt/server/chat/interceptors/schema_coercing_tool_interceptor.py:365— schema_coercing_tool_interceptor._coerce_kwargs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SkillsInterceptor.intercept (cognitive 16) private_gpt/server/chat/interceptors/skills_loop_interceptor.py:290— SkillsInterceptor.intercept has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, ternaries 4 (6 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
skills_loop_interceptor._apply_skill_event (cognitive 16) private_gpt/server/chat/interceptors/skills_loop_interceptor.py:105— skills_loop_interceptor._apply_skill_event has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
REDACTED.migrateState (cognitive 16) REDACTED:4141— REDACTED.migrateState has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 13, if/else 3. Of this number, 15 points are the body's own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D22 · Internal API Consistency· Duplicate function names across different subsystems (Arq vs Celery) that likely serve similar purposes (exposing health status) but are in separate modules. While technically distinct namespaces, having `healthcheck.health` in two major backend modules creates confusion for consumers who might expect a unified health interface. · ×1
Duplicate function names across different subsystems (Arq vs Celery) that likely serve similar purposes (exposing health status) but are in separate modules. While technically distinct namespaces, having `healthcheck.health` in two major backend modules creates confusion for consumers who might expect a unified health interface. — Consider a unified `private_gpt.health` module that aggregates health checks from both Arq and Celery backends, or rename to `arq_health` and `celery_health` for explicit distinction. (signatures: private_gpt.arq.healthcheck.healthcheck.health(): dict[str, Any] | private_gpt.celery.healthcheck.healthcheck.health(): dict[str, Any])
D22 · Internal API Consistency· Two different modules (`arq.settings` and `tasks.chat.settings`) expose a function named `get_queue_name` with different signatures. One takes a queue string, the other takes settings. This suggests inconsistent abstraction levels for queue name resolution. · ×1
Two different modules (`arq.settings` and `tasks.chat.settings`) expose a function named `get_queue_name` with different signatures. One takes a queue string, the other takes settings. This suggests inconsistent abstraction levels for queue name resolution. — Unify queue name resolution logic into a single utility or ensure consistent signatures (e.g., always take `Settings` and return the resolved queue name). (signatures: private_gpt.arq.settings.settings.get_queue_name(queue: str): str | private_gpt.tasks.chat.settings.settings.get_queue_name(settings: Settings): str)
D22 · Internal API Consistency· Duplicate function names `register_task_packages` in both `arq` and `celery` task registry modules. While they operate on different task queues, the identical naming implies a shared interface contract that doesn't exist (different underlying implementations). · ×1
Duplicate function names `register_task_packages` in both `arq` and `celery` task registry modules. While they operate on different task queues, the identical naming implies a shared interface contract that doesn't exist (different underlying implementations). — Rename to `register_arq_task_packages` and `register_celery_task_packages` or consolidate into a single registry abstraction if possible. (signatures: private_gpt.arq.task_registry.task_registry.register_task_packages(): None | private_gpt.celery.task_registry.task_registry.register_task_packages(): None)
D22 · Internal API Consistency· Two methods with nearly identical names (`populated_or_error` vs `apopulated_or_error`) on the same class. The 'a' prefix typically denotes async in this codebase, but the naming convention is inconsistent with standard Python async patterns (usually `async def populated_or_error`). · ×1
Two methods with nearly identical names (`populated_or_error` vs `apopulated_or_error`) on the same class. The 'a' prefix typically denotes async in this codebase, but the naming convention is inconsistent with standard Python async patterns (usually `async def populated_or_error`). — Rename `apopulated_or_error` to `async populated_or_error` (if supported by the runtime) or `populated_or_error_async` to clearly distinguish synchronous vs asynchronous variants. (signatures: private_gpt.artifact_index.base_artifact_index.BaseArtifactIndex.populated_or_error(self): None | private_gpt.artifact_index.base_artifact_index.BaseArtifactIndex.apopulated_or_error(self): None)
Change coupling: embedding_component.py ↔ llm_component.py private_gpt/components/embedding/embedding_component.py:1— `private_gpt/components/embedding/embedding_component.py` and `private_gpt/components/llm/llm_component.py` change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `20bad17c` feat(llm): autopull ollama models (#2019); `fc13368b` feat(llm): Support for Google Gemini LLMs and Embeddings (#1965); `b3b0140e` feat(llm): Ollama LLM-Embeddings decouple + longer keep_alive setting… — run `git show` on any of them.
Near-duplicate member pair (98 shared lines) private_gpt/components/engines/chat/async_chat_engine.py:1633— private_gpt/components/engines/chat/async_chat_engine.py:1633-1769 | private_gpt/components/engines/chat/chat_engine.py:980-1104 — These two members are variants of one another: 98 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (72 shared lines) private_gpt/artifact_index/base_artifact_index.py:490— private_gpt/artifact_index/base_artifact_index.py:490-585 | private_gpt/artifact_index/base_artifact_index.py:590-685 — These two members are variants of one another: 72 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (55 shared lines) private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:478— private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:478-611 | private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:624-750 — These two members are variants of one another: 55 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (6 members, 50+ identical tokens) REDACTED:36— REDACTED:36-121 | REDACTED:124-208 | REDACTED:211-299 | REDACTED:35-120 | REDACTED:123-208 | REDACTED:211-290 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) private_gpt/components/llm/decorators/reasoning_budget.py:138— private_gpt/components/llm/decorators/reasoning_budget.py:138-188 | private_gpt/components/llm/decorators/reasoning_budget.py:194-258 | private_gpt/components/llm/decorators/reasoning_budget.py:265-315 | private_gpt/components/llm/decorators/reasoning_budget.py:322-386 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (123–124 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1265— private_gpt/components/engines/chat/async_chat_engine.py:1265-1387 | private_gpt/components/engines/chat/chat_engine.py:560-683 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (87–89 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1087— private_gpt/components/engines/chat/async_chat_engine.py:1087-1173 | private_gpt/components/engines/chat/chat_engine.py:377-465 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/engines/chat/async_chat_engine.py:1087` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind `handler` to `_EventHandler` in one and `_LoopEventHandler` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (77–81 lines × 2) private_gpt/components/llm/custom/openairesponses.py:347— private_gpt/components/llm/custom/openairesponses.py:347-427 | private_gpt/components/llm/custom/openairesponses.py:466-542 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (70 lines × 2) private_gpt/components/readers/pptx2md/pptx2md_reader.py:246— private_gpt/components/readers/pptx2md/pptx2md_reader.py:246-315 | private_gpt/components/readers/vision/convert_doc_into_image.py:246-315 — before extracting anything, compare `private_gpt/components/readers/pptx2md/pptx2md_reader.py` and `private_gpt/components/readers/vision/convert_doc_into_image.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 216 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `private_gpt/components/readers/pptx2md/pptx2md_reader.py:245` calls `_timed_phase` and `private_gpt/components/readers/vision/convert_doc_into_image.py:245` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (54–55 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1389— private_gpt/components/engines/chat/async_chat_engine.py:1389-1442 | private_gpt/components/engines/chat/chat_engine.py:684-738 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (45–46 lines × 2) private_gpt/celery/tasks/ingestion/extraction_tasks.py:64— private_gpt/celery/tasks/ingestion/extraction_tasks.py:64-109 | private_gpt/celery/tasks/ingestion/extraction_tasks.py:188-232 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/celery/tasks/ingestion/extraction_tasks.py:64` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (41–44 lines × 3) REDACTED:37— REDACTED:37-79 | REDACTED:35-78 | REDACTED:123-163 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 120 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:164` calls `_ensure_connected` and `REDACTED:79` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (40 lines × 2) private_gpt/components/ingest/transformations/extract_slide_content_from_image_and_text_transform.py:60— private_gpt/components/ingest/transformations/extract_slide_content_from_image_and_text_transform.py:60-99 | private_gpt/components/ingest/transformations/vision_docs_transformations.py:60-99 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (36 lines × 2) private_gpt/components/readers/pptx2md/pptx2md_reader.py:176— private_gpt/components/readers/pptx2md/pptx2md_reader.py:176-211 | private_gpt/components/readers/vision/convert_doc_into_image.py:177-212 — before extracting anything, compare `private_gpt/components/readers/pptx2md/pptx2md_reader.py` and `private_gpt/components/readers/vision/convert_doc_into_image.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 216 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (34 lines × 2) private_gpt/components/ingestion/ingestion_scheduler.py:203— private_gpt/components/ingestion/ingestion_scheduler.py:203-236 | private_gpt/components/ingestion/ingestion_scheduler.py:361-394 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (33 lines × 2) private_gpt/components/ingestion/ingestion_scheduler.py:161— private_gpt/components/ingestion/ingestion_scheduler.py:161-193 | private_gpt/components/ingestion/ingestion_scheduler.py:301-333 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (31–33 lines × 2) private_gpt/components/readers/pptx2md/slides_transforms.py:94— private_gpt/components/readers/pptx2md/slides_transforms.py:94-124 | private_gpt/components/readers/vision/vision_transforms.py:57-89 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/readers/vision/vision_transforms.py:57` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (32–33 lines × 2) private_gpt/components/tools/builders/semantic_search_builder.py:94— private_gpt/components/tools/builders/semantic_search_builder.py:94-125 | private_gpt/components/tools/builders/tabular_data_builder.py:128-160 — before extracting anything, compare `private_gpt/components/tools/builders/semantic_search_builder.py` and `private_gpt/components/tools/builders/tabular_data_builder.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (28 lines × 2) private_gpt/components/database/inspected_schema.py:141— private_gpt/components/database/inspected_schema.py:141-168 | private_gpt/components/database/inspected_schema.py:193-220 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (27–28 lines × 2) private_gpt/components/readers/docling/api_clients.py:338— private_gpt/components/readers/docling/api_clients.py:338-365 | private_gpt/components/readers/docling/api_clients.py:414-440 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (27 lines × 2) private_gpt/components/readers/docling/docling_transforms.py:53— private_gpt/components/readers/docling/docling_transforms.py:53-79 | private_gpt/components/readers/text/text_reader.py:164-190 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (24–26 lines × 2) private_gpt/components/engines/citations/format.py:66— private_gpt/components/engines/citations/format.py:66-89 | private_gpt/components/engines/citations/format.py:388-413 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (22–26 lines × 2) private_gpt/components/engines/citations/format.py:208— private_gpt/components/engines/citations/format.py:208-233 | private_gpt/components/engines/citations/format.py:251-272 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/engines/citations/format.py:208` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12–26 lines × 2) private_gpt/components/vector_store/patched_qdrant_store.py:1043— private_gpt/components/vector_store/patched_qdrant_store.py:1043-1054 | private_gpt/components/vector_store/patched_qdrant_store.py:1099-1124 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/vector_store/patched_qdrant_store.py:1043` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13–26 lines × 2) private_gpt/components/vector_store/patched_qdrant_store.py:1202— private_gpt/components/vector_store/patched_qdrant_store.py:1202-1214 | private_gpt/components/vector_store/patched_qdrant_store.py:1256-1281 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/vector_store/patched_qdrant_store.py:1202` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (24–25 lines × 2) private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:578— private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:578-602 | private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py:718-741 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (23 lines × 3) private_gpt/components/tools/processors/convert_documents_processor.py:47— private_gpt/components/tools/processors/convert_documents_processor.py:47-69 | private_gpt/components/tools/processors/describe_image_processor.py:56-78 | private_gpt/components/tools/processors/transcribe_audio_processor.py:56-78 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (17–20 lines × 2) private_gpt/components/vector_store/patched_qdrant_store.py:1017— private_gpt/components/vector_store/patched_qdrant_store.py:1017-1033 | private_gpt/components/vector_store/patched_qdrant_store.py:1172-1191 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/vector_store/patched_qdrant_store.py:1172` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (18 lines × 4) REDACTED:81— REDACTED:81-98 | REDACTED:166-183 | REDACTED:80-97 | REDACTED:166-183 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 120 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:164` calls `_ensure_connected` and `REDACTED:79` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (15–18 lines × 2) private_gpt/components/skills/services/skill_service.py:96— private_gpt/components/skills/services/skill_service.py:96-113 | private_gpt/components/skills/services/skill_service.py:183-197 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/skills/services/skill_service.py:96` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `private_gpt/components/skills/services/skill_service.py:182` calls `new_skill_version_id`, `new_version_token` and `private_gpt/components/skills/services/skill_service.py:96` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (15–17 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1812— private_gpt/components/engines/chat/async_chat_engine.py:1812-1828 | private_gpt/components/engines/chat/chat_engine.py:874-888 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15–16 lines × 2) REDACTED:284— REDACTED:284-299 | REDACTED:276-290 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 120 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12–15 lines × 2) private_gpt/components/tools/builders/database_query_builder.py:283— private_gpt/components/tools/builders/database_query_builder.py:283-294 | private_gpt/components/tools/builders/database_query_builder.py:320-334 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/tools/builders/database_query_builder.py:283` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13–14 lines × 2) private_gpt/components/engines/chat/async_chat_engine.py:1193— private_gpt/components/engines/chat/async_chat_engine.py:1193-1205 | private_gpt/components/engines/chat/chat_engine.py:491-504 — before extracting anything, compare `private_gpt/components/engines/chat/async_chat_engine.py` and `private_gpt/components/engines/chat/chat_engine.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 512 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `run` to `_Run` in one and `_LoopRun` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (12–13 lines × 6) REDACTED:88— REDACTED:88-99 | REDACTED:173-184 | REDACTED:261-273 | REDACTED:87-98 | REDACTED:173-184 | REDACTED:254-266 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 120 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:88` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10–12 lines × 2) private_gpt/components/ingest/transformations/slide_header_checker_transform.py:51— private_gpt/components/ingest/transformations/slide_header_checker_transform.py:51-62 | private_gpt/components/ingest/transformations/slide_header_checker_transform.py:154-163 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/ingest/transformations/slide_header_checker_transform.py:51` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (11–12 lines × 2) private_gpt/components/skills/services/skill_service.py:85— private_gpt/components/skills/services/skill_service.py:85-96 | private_gpt/components/skills/services/skill_service.py:170-180 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `private_gpt/components/skills/services/skill_service.py:182` calls `new_skill_version_id` and `private_gpt/components/skills/services/skill_service.py:98` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (11 lines × 4) private_gpt/components/llm/decorators/reasoning_budget.py:152— private_gpt/components/llm/decorators/reasoning_budget.py:152-162 | private_gpt/components/llm/decorators/reasoning_budget.py:208-218 | private_gpt/components/llm/decorators/reasoning_budget.py:279-289 | private_gpt/components/llm/decorators/reasoning_budget.py:336-346 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `private_gpt/components/llm/decorators/reasoning_budget.py:152` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–11 lines × 2) private_gpt/components/tabular/pandasai_sandbox.py:453— private_gpt/components/tabular/pandasai_sandbox.py:453-463 | private_gpt/components/tabular/pandasai_sandbox.py:551-559 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (73 lines × 2) private_gpt/components/chat/processors/chat_history/multimodality/audio_preprocessor.py:37— private_gpt/components/chat/processors/chat_history/multimodality/audio_preprocessor.py:37-109 | private_gpt/components/chat/processors/chat_history/multimodality/image_preprocessor.py:37-109 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (41 lines × 2) private_gpt/components/tools/builders/describe_image_tool_builder.py:111— private_gpt/components/tools/builders/describe_image_tool_builder.py:111-151 | private_gpt/components/tools/builders/transcribe_audio_tool_builder.py:103-143 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
P12 · CI test-gate honesty· Coverage collected but not gated · ×1
Coverage collected but not gated — CI collects a coverage report but no step enforces a minimum — coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool's minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository's CI files AND its coverage configuration — the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited — matched against the threshold settings this check knows by name. A floor set in your coverage service's web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here.
X1 · Async correctness· Task from `asyncio.get_running_loop().create_task` is not kept · ×1
Task from `asyncio.get_running_loop().create_task` is not kept private_gpt/components/environment/environment.py:61— The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception.
X1 · Async correctness· Task from `asyncio.create_task` is not kept · ×1
Task from `asyncio.create_task` is not kept REDACTED:520— The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception.
Interpolated log message defeats structured logging private_gpt/launcher.py:244— `debug` at line 244 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/celery/task_helper.py:64— `info` at line 64 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/celery/healthcheck.py:23— `critical` at line 23 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.critical("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.critical("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/celery/healthcheck.py:43— `critical` at line 43 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.critical("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.critical("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/celery/callback.py:39— `debug` at line 39 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/celery/callback.py:80— `error` at line 80 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/celery/tasks/ingestion/extraction_tasks.py:89— `info` at line 89 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/celery/tasks/ingestion/extraction_tasks.py:103— `debug` at line 103 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/celery/tasks/ingestion/extraction_tasks.py:212— `info` at line 212 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/celery/tasks/ingestion/extraction_tasks.py:226— `debug` at line 226 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/celery/tasks/ingestion/extraction_tasks.py:305— `info` at line 305 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/celery/tasks/ingestion/extraction_tasks.py:309— `error` at line 309 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/broker/broker_component.py:88— `debug` at line 88 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/broker/broker_component.py:92— `info` at line 92 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/broker/blocking_publisher.py:101— `error` at line 101 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/broker/blocking_publisher.py:110— `error` at line 110 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/engines/citations/utils.py:80— `error` at line 80 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/engines/citations/utils.py:110— `error` at line 110 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/ingest/transformations/slide_header_checker_transform.py:57— `warning` at line 57 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/ingest/transformations/slide_header_checker_transform.py:80— `error` at line 80 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/ingest/transformations/slide_header_checker_transform.py:158— `warning` at line 158 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/ingest/transformations/slide_header_checker_transform.py:184— `error` at line 184 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/ingest/transformations/sentence_tree_node_parser.py:81— `warning` at line 81 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/ingest/transformations/image_deduplication_transform.py:34— `warning` at line 34 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging private_gpt/components/ingest/transformations/image_deduplication_transform.py:68— `info` at line 68 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
README/code drift README.md:253— README advertises Kubernetes, but no Kubernetes manifest or chart exists — searched for: `kubernetes`, `k8s`, `helm`. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest and configuration files (package.json and other *.json, *.csproj, *.props, *.sln/*.slnx, *.yml, *.toml, *.config, tool configs such as eslint.config.js, REDACTED); the README's own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read — a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong.
README/code drift README.md:74— README.md runs `powershell -ExecutionPolicy ByPass -c "irm https://astral.sh/uv/install.ps1`, but `https:/astral.sh/uv/install.ps1` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/index.mdx:78— fern/docs/pages/index.mdx links to `/providers/overview`, but `providers/overview` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/api-guide/messages.mdx:187— fern/docs/pages/api-guide/messages.mdx links to `/api-guide/messages-async`, but `api-guide/messages-async` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/api-guide/skills.mdx:27— fern/docs/pages/api-guide/skills.mdx names `SKILL.md`, but no file or folder `SKILL.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/api-guide/tools.mdx:47— fern/docs/pages/api-guide/tools.mdx links to `/tools/web-tools`, but `tools/web-tools` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/configuration/advanced.mdx:19— fern/docs/pages/configuration/advanced.mdx links to `/installation/local`, but `installation/local` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/configuration/cli.mdx:126— fern/docs/pages/configuration/cli.mdx links to `/integrations/claude-code`, but `integrations/claude-code` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/getting-started/how-it-works.mdx:31— fern/docs/pages/getting-started/how-it-works.mdx links to `/configuration/settings`, but `configuration/settings` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/getting-started/how-it-works.mdx:42— fern/docs/pages/getting-started/how-it-works.mdx links to `/configuration/advanced`, but `configuration/advanced` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/getting-started/quickstart.mdx:9— fern/docs/pages/getting-started/quickstart.mdx links to `/providers/overview`, but `providers/overview` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/getting-started/quickstart.mdx:9— fern/docs/pages/getting-started/quickstart.mdx links to `/providers/ollama`, but `providers/ollama` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/getting-started/quickstart.mdx:35— fern/docs/pages/getting-started/quickstart.mdx runs `powershell -ExecutionPolicy ByPass -c "irm https://astral.sh/uv/install.ps1`, but `https:/astral.sh/uv/install.ps1` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/getting-started/quickstart.mdx:69— fern/docs/pages/getting-started/quickstart.mdx links to `/providers/lmstudio`, but `providers/lmstudio` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/getting-started/quickstart.mdx:84— fern/docs/pages/getting-started/quickstart.mdx links to `/providers/llamacpp`, but `providers/llamacpp` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/getting-started/quickstart.mdx:101— fern/docs/pages/getting-started/quickstart.mdx links to `/providers/vllm`, but `providers/vllm` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/getting-started/quickstart.mdx:139— fern/docs/pages/getting-started/quickstart.mdx links to `/api-reference/api-reference`, but `api-reference/api-reference` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/getting-started/quickstart.mdx:148— fern/docs/pages/getting-started/quickstart.mdx links to `/tools/database-tools`, but `tools/database-tools` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/getting-started/quickstart.mdx:148— fern/docs/pages/getting-started/quickstart.mdx links to `/tools/web-tools`, but `tools/web-tools` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/installation/docker.mdx:20— fern/docs/pages/installation/docker.mdx links to `/providers/overview`, but `providers/overview` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/installation/local.mdx:8— fern/docs/pages/installation/local.mdx links to `/installation/package`, but `installation/package` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/installation/local.mdx:77— fern/docs/pages/installation/local.mdx runs `powershell -c "irm https://astral.sh/uv/install.ps1`, but `https:/astral.sh/uv/install.ps1` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/installation/local.mdx:124— fern/docs/pages/installation/local.mdx links to `/configuration/advanced`, but `configuration/advanced` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/installation/package.mdx:130— fern/docs/pages/installation/package.mdx links to `/providers/overview`, but `providers/overview` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift fern/docs/pages/installation/package.mdx:131— fern/docs/pages/installation/package.mdx links to `/installation/local`, but `installation/local` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
Duplicated predicate private_gpt/components/embedding/factories/factory.py:30— `", ".join(sorted(self._factories)) or "none"` appears character-identically in 3 files — private_gpt/components/embedding/factories/factory.py, private_gpt/components/llm/factories/registry.py, private_gpt/components/readers/factories/factory.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/tools/processors/convert_documents_processor.py:67— `_replace_tool(request, duplicate, []) or changed` appears character-identically in 3 files — private_gpt/components/tools/processors/convert_documents_processor.py, private_gpt/components/tools/processors/describe_image_processor.py, private_gpt/components/tools/processors/transcribe_audio_processor.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/tools/builders/semantic_search_builder.py:254— `artifacts is not None and context_filter_copy is not None` appears character-identically in 2 files — private_gpt/components/tools/builders/semantic_search_builder.py, private_gpt/components/tools/builders/tabular_data_builder.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/engines/chat/async_chat_engine.py:1269— `assistant_message.content is None and isinstance(chunk.message.content, str) and chunk.message.content` appears character-identically in 2 files — private_gpt/components/engines/chat/async_chat_engine.py, private_gpt/components/engines/chat/chat_engine.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/engines/chat/async_chat_engine.py:1275— `chunk.message.role or assistant_message.role` appears character-identically in 2 files — private_gpt/components/engines/chat/async_chat_engine.py, private_gpt/components/engines/chat/chat_engine.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/server/chat/interceptors/document_file_interceptor.py:80— `context.phase != InterceptorPhase.BEFORE_ITERATION or context.state.runtime.iteration > 0` appears character-identically in 3 files — private_gpt/server/chat/interceptors/document_file_interceptor.py, private_gpt/server/chat/interceptors/media_file_interceptor.py, private_gpt/server/chat/interceptors/multimodal_interceptor.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/tools/builders/semantic_search_builder.py:269— `context_filter_copy is not None and context_filter_copy.artifacts` appears character-identically in 2 files — private_gpt/components/tools/builders/semantic_search_builder.py, private_gpt/components/tools/builders/tabular_data_builder.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/engines/chat/async_chat_engine.py:1838— `context_stack or build_initial_context_stack(request)` appears character-identically in 2 files — private_gpt/components/engines/chat/async_chat_engine.py, private_gpt/components/engines/chat/chat_engine.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/readers/pptx2md/pptx2md_reader.py:281— `converted_file_info and converted_file_info.file_data != file_info.file_data` appears character-identically in 2 files — private_gpt/components/readers/pptx2md/pptx2md_reader.py, private_gpt/components/readers/vision/convert_doc_into_image.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/arq/tasks/chat/resume.py:174— `ctx.get("injector") or get_global_injector( allow_to_generate_new_injectors=True )` appears character-identically in 2 files — private_gpt/arq/tasks/chat/resume.py, private_gpt/arq/tasks/chat/start.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/multimodality/audio_handler.py:353— `evaluation.score < 0.7 or evaluation.issues_found` appears character-identically in 2 files — private_gpt/components/multimodality/audio_handler.py, private_gpt/components/multimodality/image_handler.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/ingest/transformations/extract_slide_content_from_image_and_text_transform.py:168— `extracted_content and extracted_content.strip()` appears character-identically in 2 files — private_gpt/components/ingest/transformations/extract_slide_content_from_image_and_text_transform.py, private_gpt/components/ingest/transformations/vision_docs_transformations.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/embedding/registry.py:104— `id(component) not in seen and predicate(component)` appears character-identically in 2 files — private_gpt/components/embedding/registry.py, private_gpt/components/llm/registry.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/readers/pptx2md/pptx2md_reader.py:83— `image_path.exists() and image_path.is_file()` appears character-identically in 2 files — private_gpt/components/readers/pptx2md/pptx2md_reader.py, private_gpt/components/readers/vision/convert_doc_into_image.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/readers/pptx2md/pptx2md_reader.py:76— `image_path_str.startswith("img/") or not Path(image_path_str).is_absolute()` appears character-identically in 2 files — private_gpt/components/readers/pptx2md/pptx2md_reader.py, private_gpt/components/readers/vision/convert_doc_into_image.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/engines/chat/utils/tool_utils.py:213— `isinstance(block, TextBlock) and not block.text.strip()` appears character-identically in 2 files — private_gpt/components/engines/chat/utils/tool_utils.py, private_gpt/events/models/_converters.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/chat/processors/events/citations/citations.py:45— `isinstance(event, RawContentBlockDeltaEvent) and event.delta` appears character-identically in 3 files — private_gpt/components/chat/processors/events/citations/citations.py, private_gpt/events/event_folding.py, private_gpt/observability/message.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/events/event_folding.py:103— `isinstance(event, RawContentBlockStartEvent) and event.content_block` appears character-identically in 2 files — private_gpt/events/event_folding.py, private_gpt/observability/message.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/server/ingest/convert_router.py:373— `isinstance(n, TreeNode) and n.parent is None` appears character-identically in 2 files — private_gpt/server/ingest/convert_router.py, private_gpt/server/ingest/convert_service.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/observability/chat.py:338— `isinstance(thinking, str) and thinking.strip()` appears character-identically in 2 files — private_gpt/observability/chat.py, private_gpt/observability/llama_index_patch.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/engines/chat/async_chat_engine.py:1279— `key == "thinking_delta" and isinstance(value, str)` appears character-identically in 2 files — private_gpt/components/engines/chat/async_chat_engine.py, private_gpt/components/engines/chat/chat_engine.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/engines/chat/async_chat_engine.py:1285— `key == "token_ids_delta" and isinstance(value, list)` appears character-identically in 2 files — private_gpt/components/engines/chat/async_chat_engine.py, private_gpt/components/engines/chat/chat_engine.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/chat/processors/chat_history/documents/document_preprocessor.py:217— `message.role == MessageRole.USER and is_last_user_message` appears character-identically in 3 files — private_gpt/components/chat/processors/chat_history/documents/document_preprocessor.py, private_gpt/components/chat/processors/chat_history/documents/document_uploader.py, private_gpt/components/chat/processors/chat_history/multimodality/multimodality_preprocessor.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/readers/nodes/image_node.py:59— `metadata_mode != TreeMetadataMode.NONE and metadata_mode != TreeMetadataMode.RAG` appears character-identically in 3 files — private_gpt/components/readers/nodes/image_node.py, private_gpt/components/readers/nodes/partial_node.py, private_gpt/components/readers/nodes/text_node.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate private_gpt/components/readers/nodes/document_node.py:22— `metadata_mode == TreeMetadataMode.NONE or metadata_mode == TreeMetadataMode.RAG` appears character-identically in 3 files — private_gpt/components/readers/nodes/document_node.py, private_gpt/components/readers/nodes/list_node.py, private_gpt/components/readers/nodes/section_node.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Silent fallback default in catch private_gpt/cli/commands/run.py:114— `_fetch_llm_models` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:119— `_get_postgresql_functions` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:206— `_get_sqlserver_functions` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:297— `_get_db2_functions` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:118— `_get_postgresql_procedures` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:206— `_get_sqlserver_procedures` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:288— `_get_db2_procedures` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:336— `_extract_database_name` swallows every exception into `return 'unknown'` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch private_gpt/events/models/_converters.py:38— `_rendered_text` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:43— `_detect_mime_from_bytes` swallows every exception into `return 'application/octet-stream'` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 94 significant file(s) lose their only recent owner: private_gpt/chat/input_models.py, private_gpt/server/ingest/ingest_router.py, private_gpt/components/multimodality/audio_handler.py, private_gpt/components/chat/processors/chat_history/memory/strategies/condenser.py, private_gpt/server/chat_async/chat_async_router.py, private_gpt/server/content/content_router.py, private_gpt/server/tools/tool_router.py, private_gpt/server/skills/skill_router.py (+86 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: REDACTED, private_gpt/components/readers/vision/vision_transforms.py, private_gpt/components/readers/registry.py, private_gpt/components/readers/factories/factory.py. Pair on, review, or document these before any departure.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file private_gpt/utils/eta.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
C2 · Access Controls· No named authorization policies · ×1
No named authorization policies — Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) — this is NOT a claim that endpoints are unprotected. What's missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can't be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (100 single-owned of 371 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 371 of the 710 production source files in this repository met that bar). They are anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: private_gpt/components/text_processing/rules.py, private_gpt/server/utils/auth.py.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (86838 LoC, 1379 module-visible types across 136 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 2 of 371 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 371 of the 710 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: REDACTED, private_gpt/utils/eta.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
No SAST — No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 19987 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
X23 · Unguarded diagnostic materialisation· Diagnostic log message is built whether or not it is wanted · ×1
Diagnostic log message is built whether or not it is wanted private_gpt/components/readers/base_reader.py:89— `debug` at line 89 is called with an argument built by `{ name : "…" t "…" t / total * 100 "…" for name, t, _ in timings }` (line 94), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Hand-rolled JSON/XML parsing via regex private_gpt/components/engines/citations/utils.py:208— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Silent fallback default on parse failure private_gpt/components/llm/discovery.py:137— `_get_openai_api_type_for_model` returns `'chat_completions'` when `ImportError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Dependency hygiene PARTLY measured — Python dependencies read, no exact pin to grade for currency — This repository's Python dependencies were read: 1 shipped distribution(s) across 1 manifest(s) (67 development or optional declaration(s) excluded, because a consumer does not install them). Whether any of them is behind its current release is the dependency-CURRENCY question, and no declaration here carries an EXACT pin to ask it about — every one is a floor or a range, which installs the newest release it admits and therefore cannot be behind one. That is a healthy declaration style, NOT a defect and NOT a gap in this analyzer; there is simply no currency question to answer. This is NOT a finding that these dependencies are current or healthy. Lockfiles are deliberately not read (poetry.lock, REDACTED, Pipfile.lock, pdm.lock): the four disagree about dev/optional membership, and misreading one would charge a test-only package a consumer never receives. Known CVEs in the same dependency graph are a separate question, reported under D30.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a170e0-2428-7890-b989-6fa7f0d2c909 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 61 · Warnings: 537 · Recommendations: 139 · Info: 1 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 25-10-2026 @ 02:24 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.