Public report of Mr-DooSun/fastapi-agent-blueprint, published 9 November 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.11.2). Assert 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, 9 November 2026, 04:07 UTC · Survey ID cd_1e8a9a96238848dbb4136c6f8bae8a28
Mr-DooSun/fastapi-agent-blueprint
Measured 9 November 2026, 04:06 UTC, at code version 9dca3eb
Supply-chain provenance & signing is not measured: Supply-chain provenance is not scored (this pipeline releases no artifact), but its build steps or GitHub Actions workflows have integrity defects, or nothing watches its dependency set for published advisories.
CAI scoreAt riskUp 7 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: 25,123 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 0.5 person-years · Weakest lens: Production Readiness, 47
Findings by how serious they are
50 critical104 serious38 minor
17 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look 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
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
9 November 2026, 04:06 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 the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer 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. We work 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 ▸
66of 66 dimensions measured by tools.
184of 192 findings point to an exact file and line, so you can open each one in the code. The other 8 concern the repository as a whole, such as missing documentation.
66dimensions across 7 lenses, read from 25,123 lines of product code in 2 projects.
Mr-DooSun/fastapi-agent-blueprint is rated At risk because critical security findings are open. It scores 65 out of 100, which the At risk rating leaves unchanged. We judged it as a preview release, against a lower bar.
Production Readiness, at 47, is the weakest lens and counts most in the score. The best first step for the work it takes is fixing the package under a licence on your banned list, worth about 5 points. Documenting the recovery plan would lift Production Readiness itself, worth about 8 points. Raising Production Readiness to 62 would lift the score to about 72.
Twenty-two pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Seventeen known security holes in the packages the code depends on can be used by attackers, and eight passwords or keys are open to anyone who can read the repository. Pinning each tool to an exact version, updating the vulnerable packages and replacing each exposed password or key would close these risks. Passing outside input through environment variables would fix the pipeline step that puts outside input straight into a shell command, and the unsafe setting in infrastructure or container files needs changing to safe values. The package under a licence on your banned list needs replacing, or clearing with your legal team.
The product code is 25,123 lines, about €76,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.
We compare 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: 28 findings
These 28 critical or serious findings were in the previous survey, on 22 October 2026, and are gone from this one.
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Rebuild cost: about €76,000 · Estimate
Cost to rebuild
€25,000 to €130,000, for 421 to 1,334 hours of work, about 0.5 person-years for one engineer
Difficulty of the problem
Standard, 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.9 at a score of 65. 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: 25,123 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price 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 Banned license finding(s) in License Compliance.
Codify backups + geo-recovery in IaC and document RTO/RPO and the restore procedure — a persistence guard alone is not disaster recovery.
Raises the score by about 8 points · Medium effort · DR & Backup
3
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.
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 €76,000 to build again, about 0.5 person-years of work. Its weakest lens is Production Readiness, at 47 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Banned license finding(s) in License Compliance. Of all the actions in this report, it raises the score most for the work it takes: about 5 points for low effort, because it clears the 1 License Compliance findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
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.
230 modules, with 226 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; 190 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.
_core.domain.validation uses _core.exceptions.base_exception, so a change to _core.exceptions.base_exception can break _core.domain.validation, while a change to _core.domain.validation can't break _core.exceptions.base_exception.
Position
Below the diagonal: _core.domain.validation uses a module listed above it, which is the healthy direction.
_core.domain.value_objects.agent_usage_record uses _core.domain.value_objects.value_object, so a change to _core.domain.value_objects.value_object can break _core.domain.value_objects.agent_usage_record, while a change to _core.domain.value_objects.agent_usage_record can't break _core.domain.value_objects.value_object.
Position
Below the diagonal: _core.domain.value_objects.agent_usage_record uses a module listed above it, which is the healthy direction.
_core.domain.value_objects.dynamo_key uses _core.domain.value_objects.value_object, so a change to _core.domain.value_objects.value_object can break _core.domain.value_objects.dynamo_key, while a change to _core.domain.value_objects.dynamo_key can't break _core.domain.value_objects.value_object.
Position
Below the diagonal: _core.domain.value_objects.dynamo_key uses a module listed above it, which is the healthy direction.
_core.domain.value_objects.vector_query uses _core.domain.value_objects.value_object, so a change to _core.domain.value_objects.value_object can break _core.domain.value_objects.vector_query, while a change to _core.domain.value_objects.vector_query can't break _core.domain.value_objects.value_object.
Position
Below the diagonal: _core.domain.value_objects.vector_query uses a module listed above it, which is the healthy direction.
_core.infrastructure.persistence.rdb.base_repository uses _core.infrastructure.persistence.rdb.database, so a change to _core.infrastructure.persistence.rdb.database can break _core.infrastructure.persistence.rdb.base_repository, while a change to _core.infrastructure.persistence.rdb.base_repository can't break _core.infrastructure.persistence.rdb.database.
Position
Below the diagonal: _core.infrastructure.persistence.rdb.base_repository uses a module listed above it, which is the healthy direction.
admin_identity.domain.services.admin_auth_service uses admin_identity.domain.dtos.admin_identity_dto, so a change to admin_identity.domain.dtos.admin_identity_dto can break admin_identity.domain.services.admin_auth_service, while a change to admin_identity.domain.services.admin_auth_service can't break admin_identity.domain.dtos.admin_identity_dto.
Position
Below the diagonal: admin_identity.domain.services.admin_auth_service uses a module listed above it, which is the healthy direction.
admin_identity.domain.services.admin_identity_service uses _core.domain.services.base_service, so a change to _core.domain.services.base_service can break admin_identity.domain.services.admin_identity_service, while a change to admin_identity.domain.services.admin_identity_service can't break _core.domain.services.base_service.
Position
Below the diagonal: admin_identity.domain.services.admin_identity_service uses a module listed above it, which is the healthy direction.
admin_identity.domain.services.admin_identity_service uses admin_identity.domain.dtos.admin_identity_dto, so a change to admin_identity.domain.dtos.admin_identity_dto can break admin_identity.domain.services.admin_identity_service, while a change to admin_identity.domain.services.admin_identity_service can't break admin_identity.domain.dtos.admin_identity_dto.
Position
Below the diagonal: admin_identity.domain.services.admin_identity_service uses a module listed above it, which is the healthy direction.
admin_identity.interface.server.schemas.admin_auth_schema uses _core.application.dtos.base_request, so a change to _core.application.dtos.base_request can break admin_identity.interface.server.schemas.admin_auth_schema, while a change to admin_identity.interface.server.schemas.admin_auth_schema can't break _core.application.dtos.base_request.
Position
Below the diagonal: admin_identity.interface.server.schemas.admin_auth_schema uses a module listed above it, which is the healthy direction.
admin_identity.interface.server.schemas.admin_auth_schema uses _core.application.dtos.base_response, so a change to _core.application.dtos.base_response can break admin_identity.interface.server.schemas.admin_auth_schema, while a change to admin_identity.interface.server.schemas.admin_auth_schema can't break _core.application.dtos.base_response.
Position
Below the diagonal: admin_identity.interface.server.schemas.admin_auth_schema uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in admin_identity.interface.server.schemas.admin_auth_schema uses a type in admin_identity.domain.dtos.admin_identity_dto.
admin_identity.interface.server.schemas.admin_auth_schema uses admin_identity.domain.dtos.admin_identity_dto, so a change to admin_identity.domain.dtos.admin_identity_dto can break admin_identity.interface.server.schemas.admin_auth_schema, while a change to admin_identity.interface.server.schemas.admin_auth_schema can't break admin_identity.domain.dtos.admin_identity_dto.
Position
Below the diagonal: admin_identity.interface.server.schemas.admin_auth_schema uses a module listed above it, which is the healthy direction.
ai_usage.interface.server.schemas.ai_usage_schema uses _core.application.dtos.base_request, so a change to _core.application.dtos.base_request can break ai_usage.interface.server.schemas.ai_usage_schema, while a change to ai_usage.interface.server.schemas.ai_usage_schema can't break _core.application.dtos.base_request.
Position
Below the diagonal: ai_usage.interface.server.schemas.ai_usage_schema uses a module listed above it, which is the healthy direction.
ai_usage.interface.server.schemas.ai_usage_schema uses _core.application.dtos.base_response, so a change to _core.application.dtos.base_response can break ai_usage.interface.server.schemas.ai_usage_schema, while a change to ai_usage.interface.server.schemas.ai_usage_schema can't break _core.application.dtos.base_response.
Position
Below the diagonal: ai_usage.interface.server.schemas.ai_usage_schema uses a module listed above it, which is the healthy direction.
docs.interface.server.schemas.docs_schema uses _core.application.dtos.base_request, so a change to _core.application.dtos.base_request can break docs.interface.server.schemas.docs_schema, while a change to docs.interface.server.schemas.docs_schema can't break _core.application.dtos.base_request.
Position
Below the diagonal: docs.interface.server.schemas.docs_schema uses a module listed above it, which is the healthy direction.
docs.interface.server.schemas.docs_schema uses _core.application.dtos.base_response, so a change to _core.application.dtos.base_response can break docs.interface.server.schemas.docs_schema, while a change to docs.interface.server.schemas.docs_schema can't break _core.application.dtos.base_response.
Position
Below the diagonal: docs.interface.server.schemas.docs_schema uses a module listed above it, which is the healthy direction.
user.domain.protocols.user_repository_protocol uses _core.domain.protocols.repository_protocol, so a change to _core.domain.protocols.repository_protocol can break user.domain.protocols.user_repository_protocol, while a change to user.domain.protocols.user_repository_protocol can't break _core.domain.protocols.repository_protocol.
Position
Below the diagonal: user.domain.protocols.user_repository_protocol uses a module listed above it, which is the healthy direction.
user.interface.server.schemas.user_schema uses _core.application.dtos.base_request, so a change to _core.application.dtos.base_request can break user.interface.server.schemas.user_schema, while a change to user.interface.server.schemas.user_schema can't break _core.application.dtos.base_request.
Position
Below the diagonal: user.interface.server.schemas.user_schema uses a module listed above it, which is the healthy direction.
user.interface.server.schemas.user_schema uses _core.application.dtos.base_response, so a change to _core.application.dtos.base_response can break user.interface.server.schemas.user_schema, while a change to user.interface.server.schemas.user_schema can't break _core.application.dtos.base_response.
Position
Below the diagonal: user.interface.server.schemas.user_schema uses a module listed above it, which is the healthy direction.
_core.infrastructure.vectors.s3.base_store uses _core.infrastructure.vectors.vector_model, so a change to _core.infrastructure.vectors.vector_model can break _core.infrastructure.vectors.s3.base_store, while a change to _core.infrastructure.vectors.s3.base_store can't break _core.infrastructure.vectors.vector_model.
Position
Below the diagonal: _core.infrastructure.vectors.s3.base_store uses a module listed above it, which is the healthy direction.
_core.infrastructure.vectors.s3.base_store uses _core.domain.value_objects.vector_query, so a change to _core.domain.value_objects.vector_query can break _core.infrastructure.vectors.s3.base_store, while a change to _core.infrastructure.vectors.s3.base_store can't break _core.domain.value_objects.vector_query.
Position
Below the diagonal: _core.infrastructure.vectors.s3.base_store uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in admin_identity.application.use_cases.admin_account_use_case uses a type in admin_identity.domain.dtos.admin_identity_dto.
admin_identity.application.use_cases.admin_account_use_case uses admin_identity.domain.dtos.admin_identity_dto, so a change to admin_identity.domain.dtos.admin_identity_dto can break admin_identity.application.use_cases.admin_account_use_case, while a change to admin_identity.application.use_cases.admin_account_use_case can't break admin_identity.domain.dtos.admin_identity_dto.
Position
Below the diagonal: admin_identity.application.use_cases.admin_account_use_case uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in admin_identity.application.use_cases.admin_account_use_case uses a type in admin_identity.domain.services.admin_auth_service.
admin_identity.application.use_cases.admin_account_use_case uses admin_identity.domain.services.admin_auth_service, so a change to admin_identity.domain.services.admin_auth_service can break admin_identity.application.use_cases.admin_account_use_case, while a change to admin_identity.application.use_cases.admin_account_use_case can't break admin_identity.domain.services.admin_auth_service.
Position
Below the diagonal: admin_identity.application.use_cases.admin_account_use_case uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in admin_identity.application.use_cases.admin_account_use_case uses a type in admin_identity.domain.services.admin_identity_service.
admin_identity.application.use_cases.admin_account_use_case uses admin_identity.domain.services.admin_identity_service, so a change to admin_identity.domain.services.admin_identity_service can break admin_identity.application.use_cases.admin_account_use_case, while a change to admin_identity.application.use_cases.admin_account_use_case can't break admin_identity.domain.services.admin_identity_service.
Position
Below the diagonal: admin_identity.application.use_cases.admin_account_use_case uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in admin_identity.application.use_cases.admin_auth_use_case uses a type in admin_identity.domain.dtos.admin_identity_dto.
admin_identity.application.use_cases.admin_auth_use_case uses admin_identity.domain.dtos.admin_identity_dto, so a change to admin_identity.domain.dtos.admin_identity_dto can break admin_identity.application.use_cases.admin_auth_use_case, while a change to admin_identity.application.use_cases.admin_auth_use_case can't break admin_identity.domain.dtos.admin_identity_dto.
Position
Below the diagonal: admin_identity.application.use_cases.admin_auth_use_case uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in admin_identity.application.use_cases.admin_auth_use_case uses a type in admin_identity.domain.services.admin_auth_service.
admin_identity.application.use_cases.admin_auth_use_case uses admin_identity.domain.services.admin_auth_service, so a change to admin_identity.domain.services.admin_auth_service can break admin_identity.application.use_cases.admin_auth_use_case, while a change to admin_identity.application.use_cases.admin_auth_use_case can't break admin_identity.domain.services.admin_auth_service.
Position
Below the diagonal: admin_identity.application.use_cases.admin_auth_use_case uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in admin_identity.application.use_cases.admin_auth_use_case uses a type in admin_identity.domain.services.admin_identity_service.
admin_identity.application.use_cases.admin_auth_use_case uses admin_identity.domain.services.admin_identity_service, so a change to admin_identity.domain.services.admin_identity_service can break admin_identity.application.use_cases.admin_auth_use_case, while a change to admin_identity.application.use_cases.admin_auth_use_case can't break admin_identity.domain.services.admin_identity_service.
Position
Below the diagonal: admin_identity.application.use_cases.admin_auth_use_case uses a module listed above it, which is the healthy direction.
4 pairs of types, where a type in admin_identity.application.use_cases.admin_auth_use_case uses a type in admin_identity.interface.server.schemas.admin_auth_schema.
admin_identity.application.use_cases.admin_auth_use_case uses admin_identity.interface.server.schemas.admin_auth_schema, so a change to admin_identity.interface.server.schemas.admin_auth_schema can break admin_identity.application.use_cases.admin_auth_use_case, while a change to admin_identity.application.use_cases.admin_auth_use_case can't break admin_identity.interface.server.schemas.admin_auth_schema.
Position
Below the diagonal: admin_identity.application.use_cases.admin_auth_use_case uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in admin_identity.infrastructure.repositories.admin_identity_repository uses a type in _core.infrastructure.persistence.rdb.database.
admin_identity.infrastructure.repositories.admin_identity_repository uses _core.infrastructure.persistence.rdb.database, so a change to _core.infrastructure.persistence.rdb.database can break admin_identity.infrastructure.repositories.admin_identity_repository, while a change to admin_identity.infrastructure.repositories.admin_identity_repository can't break _core.infrastructure.persistence.rdb.database.
Position
Below the diagonal: admin_identity.infrastructure.repositories.admin_identity_repository uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in admin_identity.infrastructure.repositories.admin_identity_repository uses a type in admin_identity.domain.dtos.admin_identity_dto.
admin_identity.infrastructure.repositories.admin_identity_repository uses admin_identity.domain.dtos.admin_identity_dto, so a change to admin_identity.domain.dtos.admin_identity_dto can break admin_identity.infrastructure.repositories.admin_identity_repository, while a change to admin_identity.infrastructure.repositories.admin_identity_repository can't break admin_identity.domain.dtos.admin_identity_dto.
Position
Below the diagonal: admin_identity.infrastructure.repositories.admin_identity_repository uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in admin_identity.infrastructure.repositories.admin_identity_repository uses a type in _core.infrastructure.persistence.rdb.base_repository.
admin_identity.infrastructure.repositories.admin_identity_repository uses _core.infrastructure.persistence.rdb.base_repository, so a change to _core.infrastructure.persistence.rdb.base_repository can break admin_identity.infrastructure.repositories.admin_identity_repository, while a change to admin_identity.infrastructure.repositories.admin_identity_repository can't break _core.infrastructure.persistence.rdb.base_repository.
Position
Below the diagonal: admin_identity.infrastructure.repositories.admin_identity_repository uses a module listed above it, which is the healthy direction.
ai_usage.domain.protocols.ai_usage_repository_protocol uses _core.domain.protocols.repository_protocol, so a change to _core.domain.protocols.repository_protocol can break ai_usage.domain.protocols.ai_usage_repository_protocol, while a change to ai_usage.domain.protocols.ai_usage_repository_protocol can't break _core.domain.protocols.repository_protocol.
Position
Below the diagonal: ai_usage.domain.protocols.ai_usage_repository_protocol uses a module listed above it, which is the healthy direction.
ai_usage.domain.protocols.ai_usage_repository_protocol uses ai_usage.domain.dtos.ai_usage_dto, so a change to ai_usage.domain.dtos.ai_usage_dto can break ai_usage.domain.protocols.ai_usage_repository_protocol, while a change to ai_usage.domain.protocols.ai_usage_repository_protocol can't break ai_usage.domain.dtos.ai_usage_dto.
Position
Below the diagonal: ai_usage.domain.protocols.ai_usage_repository_protocol uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in ai_usage.domain.protocols.ai_usage_repository_protocol uses a type in ai_usage.interface.server.schemas.ai_usage_schema.
ai_usage.domain.protocols.ai_usage_repository_protocol uses ai_usage.interface.server.schemas.ai_usage_schema, so a change to ai_usage.interface.server.schemas.ai_usage_schema can break ai_usage.domain.protocols.ai_usage_repository_protocol, while a change to ai_usage.domain.protocols.ai_usage_repository_protocol can't break ai_usage.interface.server.schemas.ai_usage_schema.
Position
Below the diagonal: ai_usage.domain.protocols.ai_usage_repository_protocol uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in ai_usage.infrastructure.repositories.ai_usage_repository uses a type in _core.infrastructure.persistence.rdb.database.
ai_usage.infrastructure.repositories.ai_usage_repository uses _core.infrastructure.persistence.rdb.database, so a change to _core.infrastructure.persistence.rdb.database can break ai_usage.infrastructure.repositories.ai_usage_repository, while a change to ai_usage.infrastructure.repositories.ai_usage_repository can't break _core.infrastructure.persistence.rdb.database.
Position
Below the diagonal: ai_usage.infrastructure.repositories.ai_usage_repository uses a module listed above it, which is the healthy direction.
ai_usage.infrastructure.repositories.ai_usage_repository uses ai_usage.domain.dtos.ai_usage_dto, so a change to ai_usage.domain.dtos.ai_usage_dto can break ai_usage.infrastructure.repositories.ai_usage_repository, while a change to ai_usage.infrastructure.repositories.ai_usage_repository can't break ai_usage.domain.dtos.ai_usage_dto.
Position
Below the diagonal: ai_usage.infrastructure.repositories.ai_usage_repository uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in ai_usage.infrastructure.repositories.ai_usage_repository uses a type in _core.infrastructure.persistence.rdb.base_repository.
ai_usage.infrastructure.repositories.ai_usage_repository uses _core.infrastructure.persistence.rdb.base_repository, so a change to _core.infrastructure.persistence.rdb.base_repository can break ai_usage.infrastructure.repositories.ai_usage_repository, while a change to ai_usage.infrastructure.repositories.ai_usage_repository can't break _core.infrastructure.persistence.rdb.base_repository.
Position
Below the diagonal: ai_usage.infrastructure.repositories.ai_usage_repository uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in ai_usage.infrastructure.repositories.ai_usage_repository uses a type in ai_usage.interface.server.schemas.ai_usage_schema.
ai_usage.infrastructure.repositories.ai_usage_repository uses ai_usage.interface.server.schemas.ai_usage_schema, so a change to ai_usage.interface.server.schemas.ai_usage_schema can break ai_usage.infrastructure.repositories.ai_usage_repository, while a change to ai_usage.infrastructure.repositories.ai_usage_repository can't break ai_usage.interface.server.schemas.ai_usage_schema.
Position
Below the diagonal: ai_usage.infrastructure.repositories.ai_usage_repository uses a module listed above it, which is the healthy direction.
auth.domain.services.auth_service uses user.domain.dtos.user_dto, so a change to user.domain.dtos.user_dto can break auth.domain.services.auth_service, while a change to auth.domain.services.auth_service can't break user.domain.dtos.user_dto.
Position
Below the diagonal: auth.domain.services.auth_service uses a module listed above it, which is the healthy direction.
auth.domain.services.auth_service uses user.domain.protocols.user_repository_protocol, so a change to user.domain.protocols.user_repository_protocol can break auth.domain.services.auth_service, while a change to auth.domain.services.auth_service can't break user.domain.protocols.user_repository_protocol.
Position
Below the diagonal: auth.domain.services.auth_service uses a module listed above it, which is the healthy direction.
auth.interface.server.schemas.auth_schema uses _core.application.dtos.base_request, so a change to _core.application.dtos.base_request can break auth.interface.server.schemas.auth_schema, while a change to auth.interface.server.schemas.auth_schema can't break _core.application.dtos.base_request.
Position
Below the diagonal: auth.interface.server.schemas.auth_schema uses a module listed above it, which is the healthy direction.
auth.interface.server.schemas.auth_schema uses _core.application.dtos.base_response, so a change to _core.application.dtos.base_response can break auth.interface.server.schemas.auth_schema, while a change to auth.interface.server.schemas.auth_schema can't break _core.application.dtos.base_response.
Position
Below the diagonal: auth.interface.server.schemas.auth_schema uses a module listed above it, which is the healthy direction.
auth.interface.server.schemas.auth_schema uses user.domain.dtos.user_dto, so a change to user.domain.dtos.user_dto can break auth.interface.server.schemas.auth_schema, while a change to auth.interface.server.schemas.auth_schema can't break user.domain.dtos.user_dto.
Position
Below the diagonal: auth.interface.server.schemas.auth_schema uses a module listed above it, which is the healthy direction.
auth.interface.server.schemas.auth_schema uses user.interface.server.schemas.user_schema, so a change to user.interface.server.schemas.user_schema can break auth.interface.server.schemas.auth_schema, while a change to auth.interface.server.schemas.auth_schema can't break user.interface.server.schemas.user_schema.
Position
Below the diagonal: auth.interface.server.schemas.auth_schema uses a module listed above it, which is the healthy direction.
docs.domain.services.document_service uses _core.domain.dtos.rag, so a change to _core.domain.dtos.rag can break docs.domain.services.document_service, while a change to docs.domain.services.document_service can't break _core.domain.dtos.rag.
Position
Below the diagonal: docs.domain.services.document_service uses a module listed above it, which is the healthy direction.
docs.domain.services.document_service uses _core.domain.services.base_service, so a change to _core.domain.services.base_service can break docs.domain.services.document_service, while a change to docs.domain.services.document_service can't break _core.domain.services.base_service.
Position
Below the diagonal: docs.domain.services.document_service uses a module listed above it, which is the healthy direction.
docs.domain.services.document_service uses docs.interface.server.schemas.docs_schema, so a change to docs.interface.server.schemas.docs_schema can break docs.domain.services.document_service, while a change to docs.domain.services.document_service can't break docs.interface.server.schemas.docs_schema.
Position
Below the diagonal: docs.domain.services.document_service uses a module listed above it, which is the healthy direction.
user.domain.services.user_service uses _core.domain.services.base_service, so a change to _core.domain.services.base_service can break user.domain.services.user_service, while a change to user.domain.services.user_service can't break _core.domain.services.base_service.
Position
Below the diagonal: user.domain.services.user_service uses a module listed above it, which is the healthy direction.
user.domain.services.user_service uses user.domain.dtos.user_dto, so a change to user.domain.dtos.user_dto can break user.domain.services.user_service, while a change to user.domain.services.user_service can't break user.domain.dtos.user_dto.
Position
Below the diagonal: user.domain.services.user_service uses a module listed above it, which is the healthy direction.
user.domain.services.user_service uses user.domain.protocols.user_repository_protocol, so a change to user.domain.protocols.user_repository_protocol can break user.domain.services.user_service, while a change to user.domain.services.user_service can't break user.domain.protocols.user_repository_protocol.
Position
Below the diagonal: user.domain.services.user_service uses a module listed above it, which is the healthy direction.
user.domain.services.user_service uses user.interface.server.schemas.user_schema, so a change to user.interface.server.schemas.user_schema can break user.domain.services.user_service, while a change to user.domain.services.user_service can't break user.interface.server.schemas.user_schema.
Position
Below the diagonal: user.domain.services.user_service uses a module listed above it, which is the healthy direction.
ai_usage.domain.services.ai_usage_service uses _core.domain.services.base_service, so a change to _core.domain.services.base_service can break ai_usage.domain.services.ai_usage_service, while a change to ai_usage.domain.services.ai_usage_service can't break _core.domain.services.base_service.
Position
Below the diagonal: ai_usage.domain.services.ai_usage_service uses a module listed above it, which is the healthy direction.
ai_usage.domain.services.ai_usage_service uses ai_usage.domain.dtos.ai_usage_dto, so a change to ai_usage.domain.dtos.ai_usage_dto can break ai_usage.domain.services.ai_usage_service, while a change to ai_usage.domain.services.ai_usage_service can't break ai_usage.domain.dtos.ai_usage_dto.
Position
Below the diagonal: ai_usage.domain.services.ai_usage_service uses a module listed above it, which is the healthy direction.
ai_usage.domain.services.ai_usage_service uses _core.domain.value_objects.agent_usage_record, so a change to _core.domain.value_objects.agent_usage_record can break ai_usage.domain.services.ai_usage_service, while a change to ai_usage.domain.services.ai_usage_service can't break _core.domain.value_objects.agent_usage_record.
Position
Below the diagonal: ai_usage.domain.services.ai_usage_service uses a module listed above it, which is the healthy direction.
ai_usage.domain.services.ai_usage_service uses ai_usage.interface.server.schemas.ai_usage_schema, so a change to ai_usage.interface.server.schemas.ai_usage_schema can break ai_usage.domain.services.ai_usage_service, while a change to ai_usage.domain.services.ai_usage_service can't break ai_usage.interface.server.schemas.ai_usage_schema.
Position
Below the diagonal: ai_usage.domain.services.ai_usage_service uses a module listed above it, which is the healthy direction.
ai_usage.domain.services.ai_usage_service uses ai_usage.domain.protocols.ai_usage_repository_protocol, so a change to ai_usage.domain.protocols.ai_usage_repository_protocol can break ai_usage.domain.services.ai_usage_service, while a change to ai_usage.domain.services.ai_usage_service can't break ai_usage.domain.protocols.ai_usage_repository_protocol.
Position
Below the diagonal: ai_usage.domain.services.ai_usage_service uses a module listed above it, which is the healthy direction.
auth.application.use_cases.auth_use_case uses user.domain.dtos.user_dto, so a change to user.domain.dtos.user_dto can break auth.application.use_cases.auth_use_case, while a change to auth.application.use_cases.auth_use_case can't break user.domain.dtos.user_dto.
Position
Below the diagonal: auth.application.use_cases.auth_use_case uses a module listed above it, which is the healthy direction.
auth.application.use_cases.auth_use_case uses auth.domain.services.auth_service, so a change to auth.domain.services.auth_service can break auth.application.use_cases.auth_use_case, while a change to auth.application.use_cases.auth_use_case can't break auth.domain.services.auth_service.
Position
Below the diagonal: auth.application.use_cases.auth_use_case uses a module listed above it, which is the healthy direction.
auth.application.use_cases.auth_use_case uses auth.interface.server.schemas.auth_schema, so a change to auth.interface.server.schemas.auth_schema can break auth.application.use_cases.auth_use_case, while a change to auth.application.use_cases.auth_use_case can't break auth.interface.server.schemas.auth_schema.
Position
Below the diagonal: auth.application.use_cases.auth_use_case uses a module listed above it, which is the healthy direction.
docs.infrastructure.vectors.document_chunk_s3_store uses _core.domain.dtos.rag, so a change to _core.domain.dtos.rag can break docs.infrastructure.vectors.document_chunk_s3_store, while a change to docs.infrastructure.vectors.document_chunk_s3_store can't break _core.domain.dtos.rag.
Position
Below the diagonal: docs.infrastructure.vectors.document_chunk_s3_store uses a module listed above it, which is the healthy direction.
docs.infrastructure.vectors.document_chunk_s3_store uses _core.infrastructure.vectors.s3.base_store, so a change to _core.infrastructure.vectors.s3.base_store can break docs.infrastructure.vectors.document_chunk_s3_store, while a change to docs.infrastructure.vectors.document_chunk_s3_store can't break _core.infrastructure.vectors.s3.base_store.
Position
Below the diagonal: docs.infrastructure.vectors.document_chunk_s3_store uses a module listed above it, which is the healthy direction.
docs.interface.server.routers uses _core.application.dtos.base_response, so a change to _core.application.dtos.base_response can break docs.interface.server.routers, while a change to docs.interface.server.routers can't break _core.application.dtos.base_response.
Position
Below the diagonal: docs.interface.server.routers uses a module listed above it, which is the healthy direction.
docs.interface.server.routers uses docs.interface.server.schemas.docs_schema, so a change to docs.interface.server.schemas.docs_schema can break docs.interface.server.routers, while a change to docs.interface.server.routers can't break docs.interface.server.schemas.docs_schema.
Position
Below the diagonal: docs.interface.server.routers uses a module listed above it, which is the healthy direction.
docs.interface.server.routers uses docs.domain.services.document_service, so a change to docs.domain.services.document_service can break docs.interface.server.routers, while a change to docs.interface.server.routers can't break docs.domain.services.document_service.
Position
Below the diagonal: docs.interface.server.routers 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
23
High / Critical
A03:2025 — Software Supply Chain Failures
23
High / Critical
A02:2025 — Security Misconfiguration
13
High / Critical
A07:2025 — Authentication Failures
9
High / Critical
Roadmap
Top priorities: Codify backups + geo-recovery in IaC and document RTO/RPO and the restore procedure — a persistence guard alone is not disaster recovery; Resolve the 1 Banned license finding(s) in License Compliance; 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.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 Banned license finding(s) in License Compliance.
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.
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.
Code Duplication: Edited copy of a member (23 corresponding lines)
How the grades work
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 — 50
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 — 104
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 — 38
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 17
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
This survey 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. All 66 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.
Every figure here is one of two 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. 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.
What we checked — 66 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, 184 of 192 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 or a scanner, 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 — We 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 MEASURED: test source is present (.py) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage 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 — We 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, 172 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 12 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.
D16 Bus Factor — 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. Single-maintainer repository — bus factor is not applicable (11 contributor(s) across 1283 commit(s) sampled, automation and bot accounts excluded). One of them holds 95% of the history; the other 10 hold 0.5% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming Consistency — not measured this run — We 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. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — We 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. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — We 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's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
AX1 Captive dependencies — not measured this run — We 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 dependency-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 — We 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 — We 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 DockerCompose (REDACTED). compose up failed (exit 1 — a container did not start, exited, or never became healthy) — migrate Built scheduler Built server Built worker Built Container fastapi-agent-blueprint-migrate-1 Exited Container fastapi-agent-blueprint-migrate-1 Exited Container fastapi-agent-blueprint-migrate-1 Exited Container fastapi-agent-blueprint-migrate-1 Exited container fastapi-agent-blueprint-scheduler-1 has no healthcheck configured; runtime evidence skipped.
C1 Data Protection — not measured this run — We 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.
GD1 Unfinished & placeholder code — not measured this run — We 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 — We 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.
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
S1 Web-Security Posture — not measured this run — We 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 — We 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 — We 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 — We 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 (Vue and Svelte components included), 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.
X5 Nullable reference types — not measured this run — We 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
We assess the repository exactly as committed, and only the repository. By design we do 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.
D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
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.
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 publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
D23 Boundary Type-Coupling: Boundary leakage is detected from type references across detected contexts — leaks that flow through primitives, serialization or shared infrastructure may not surface as a typed reference.
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.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
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 Dockerfile (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.
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.
C3 Audit Trail: This control is scored from in-repo evidence only — a working control configured outside the repository leaves no signal a static scan can credit.
C4 Data Retention: This control is scored from in-repo evidence only — its real-world effectiveness, exercised only at runtime, is outside a static scan.
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: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
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".
P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
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.
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.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 30 down to 30 or less in Cyclomatic Complexity — start with Settings._validate_environment_safety (cyclomatic 101). — Refactoring it lifts Cyclomatic Complexity from 7.5 to about 8.8/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.
+ 9 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 Cognitive Complexity — start with Settings._validate_environment_safety (cognitive 122). — Refactoring it lifts Cognitive Complexity from 6.7 to about 7.4/10.
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.8 / 10Stronggated by 1 serious finding✓ 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.
1 over-large unit(s) detected — types, modules or files that carry too much.
FileTooLong: _core/config.pysrc/_core/config.py
What to do
Resolve the 1 FileTooLong finding(s) in God Classes — start with config.py. — One of this dimension's main actionable groups (1 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.
53 duplicated block group(s) detected. A further 2 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 11 of the 55 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 35 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 4 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with document_chunk_in_memory_store.py, exceptions.py, admin_identity_repository.py. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 3 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with discord_notification_adapter.py, admin_identity_repository.py, governor_state_doctor.py. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 3 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with admin_auth_service.py (3). — One of this dimension's main actionable groups (3 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.
What it measures: Whether the code respects its intended layering / architecture rules.
Method: Enforcement rung (Prevented/Verified/Documented) per checkable ADR via Roslyn, plus dependency cycles via the engine shared with D5/AX3. Deterministic, exact.
No mechanizable ADR was identified, so enforcement is not measured. Dependency cycles not checked (no project-reference graph; where this repository's language has an import-cycle lens, cycles are reported there).
What to do
Enforce Architectural Integrity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d7_recommendation.md.
Do you agree with this assessment?
D9 · Test Distribution9.6 / 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.
1692 test methods: 1548 unit, 95 integration, 0 BDD, 49 e2e. The Python suite contributes 1692 test function(s) across 171 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.
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.
1 of 41 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 12 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (29 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. 1 of them publish no licence on PyPI this pass can read; that is missing data, not a violation, and none of them is charged. This repository publishes itself under MIT, which is its own choice and is not judged here.
Banned license: psycopg
What to do
Resolve the 1 Banned license finding(s) in License Compliance. — One of this dimension's main actionable groups (1 issue-level).
Enforce License Compliance in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d14_recommendation.md · top locations in Appendix A, every location in findings.md.
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: .agents/shared/work_ledger.py (9×27=243); tools/check_doc_links.py (4×15=60) Repeated repair below the complexity floor: src/_apps/admin/pages/dashboard.py (4 of 6 changes were fixes); src/_core/infrastructure/admin/theme.py (3 of 4 changes were fixes); .agents/shared/governor/paths.py (3 of 3 changes were fixes)
Resolve the 3 Repeated repair finding(s) in Churn × Complexity Hotspots — start with dashboard.py, theme.py, paths.py. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 Hotspot finding(s) in Churn × Complexity Hotspots — start with work_ledger.py, check_doc_links.py. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d15_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.
0 deducted task-comment markers across 25123 LoC (0.0/KLoC) → score 10.0. 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.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.
0 of 5 evaluated ADRs have a defect readable from the log itself (a missing or empty section, no title, a single option, consequences with no cost, no status, a missing enforcement field, a status the log contradicts, a dangling link, an unlinked second decision on one question, a date that is no calendar day). How well each record argues its case is not measured.
What it measures: Whether domain types (IDs, enums, value objects) leak across bounded-context boundaries.
Method: Cross-context domain-type leakage via Roslyn structural classification (strongly-typed IDs / value objects) over every public surface. Exhaustive, deterministic, type-level aggregate-boundary check.
Coverage: Bounded contexts derived from NAMESPACE prefix (or graph-inferred where available); cross-boundary domain-type leakage then checked exhaustively over every public member of every type.
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: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
97 % of calls cross a namespace and 3 % go through an interface, but 86 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.
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.
8 finding(s): 0 critical, 8 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 8 High secret finding(s) in Secrets (history) — start with REDACTED (8). — One of this dimension's main actionable groups (8 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
23 finding(s): 0 critical, 23 high, 0 medium, 0 low. 22 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. semgrep hit a parse error in 1 file(s) — `.claude/hooks/stop-sync-reminder.sh` (line 33, lines 39–98, lines 138–172) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 2 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
What to do
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 22 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 (22 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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
Resolve the 10 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (10). — One of this dimension's main actionable groups (10 issue-level).
Resolve the 4 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (4). — One of this dimension's main actionable groups (4 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 12 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (7), REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (12 warning-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.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 108 of the 377 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
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.
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. Reported 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. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
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 12 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.
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.
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 dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, 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.
Do you agree with this assessment?
C3 · Audit Trail7.5 / 10Strong✓ Tool-verified
Other · Security — Whether changes to sensitive data are recorded (who, what, when) for compliance + incident response.
An audit mechanism is present, but the trail is not yet complete — missing: a write-side hook every change flows through (HistoricalRecords, auditlog.register, reversion.register, pghistory.track, SQLAlchemy-Continuum, a post_save / after_update listener recording each change, or an event-sourced store), per-model coverage (a change-history registration on each model that needs a who-changed-what trail, or an event-sourced aggregate).
What to do
Back the audit convention with a structural mechanism: HistoricalRecords or auditlog.register on the models that need a who-changed-what trail, or a post_save / after_update listener writing each sensitive change to an audit-log table, with the acting user and time on every entry.
Do you agree with this assessment?
C4 · Data Retention10.0 / 10Exemplary✓ Tool-verified
Other · Security — Whether data has a defined lifetime — retention periods, TTLs, cleanup jobs (storage limitation).
Method: Roslyn scan: retention/TTL configuration presence in schema; CascadeDelete detected but not scored as retention control. Deterministic, gated by PII presence.
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.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
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's code 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 15338 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. — REDACTED:6
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.
Enable Dependabot/Renovate or a dependency-review gate.
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.
What to do
Add an approval/environment gate (required reviewers / protection rules) before production promotion.
Do you agree with this assessment?
P5 · DR & Backup0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.
Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.
A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced — a volume that survives a container recreate is not a tested restore from catastrophic loss.
What to do
Codify backups + geo-recovery in IaC and document RTO/RPO and the restore procedure — a persistence guard alone is not disaster recovery.
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.
Do you agree with this assessment?
P8 · Schema migrations3.0 / 10Weak✓ Tool-verified
Readiness · Readiness — Whether database schema changes go through versioned migrations rather than being auto-created from the model at startup.
Method: Roslyn scan: EF Core DbContext for a versioned migrations directory versus bare EnsureCreated usage; off .NET, a file scan of dependency manifests, migration histories (Flyway, Liquibase, Alembic, Django, Rails, Prisma, TypeORM, Knex/Sequelize, golang-migrate, goose, Laravel, Doctrine, Diesel/sqlx) and schema auto-create in production source or config. Exhaustive, deterministic.
This repository versions its schema (Alembic), but SQLAlchemy create_all() here builds or alters the schema from the model as well, outside that history — the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Alembic own the schema. (×2) — src/_core/infrastructure/admin/audit/__init__.py:4, src/_apps/server/bootstrap.py:133
What to do
Turn off SQLAlchemy create_all() in production and let the versioned migrations own the schema.
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 each language's code 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.
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 document3.5 / 10Weak✓ 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.
`from_dynamodb` is public, takes a document from its caller (line 148) and hands it to `_clean_value`, which calls itself at line 184 (`self._clean_value`) with a piece of `value` (and at line 186) — and nowhere in `_clean_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 `_clean_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/_core/infrastructure/persistence/nosql/dynamodb/dynamodb_model.py:184
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. Also whether a `finally` that gives the primitive back unconditionally can run in a state where the method does not hold it: after a timed wait whose result was discarded, after an acquire inside the `try` that can fail, after the body already released it, or never, because a `return` left between the acquire and the `try`.
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.
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.
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.
Do you agree with this assessment?
Reference — by lens
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 — 3 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.
D36 Supply-chain Provenance & Signing — 1 observation(s) recorded · The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 6 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 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.
C5 Data-Subject Rights — Repo shows no corroborated data-subject-rights mechanism (erasure / export-portability / consent) tied to a subject id or GDPR vocabulary — absence of evidence is not evidence of a working control. A delete/anonymise identifier was seen but did not co-occur with GDPR vocabulary or a subject-id shape, so it was not credited (e.g. a save-slot DeleteAccount()). Implement erasure, data export/portability and consent tracking over the subject's records.
Not included — 50 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.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
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
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 — compose up failed (exit 1 — a container did not start, exited, or never became healthy) — migrate Built scheduler Built server Built worker Built Container fastapi-agent-blueprint-migrate-1 Exited Container fastapi-agent-blueprint-migrate-1 Exited Container fastapi-agent-blueprint-migrate-1 Exited Container fastapi-agent-blueprint-migrate-1 Exited container fastapi-agent-blueprint-scheduler-1 has no healthcheck configured; 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 — ~28408 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
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
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.
D21 Naming Consistency — Naming consistency is measured on C# and TypeScript only; Python not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Python surface was not measured.
D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .py, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — None of 5 binding record(s) states a rule in checkable form (a backticked element with a prohibition, or an `adr-rules` block), so conformance cannot be read from the code. Write the rule as an `adr-rules` block (`forbid:` a symbol, a package or a dependency) to make it checkable.
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.)
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
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
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 scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
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
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
Banned license: psycopg — `psycopg` 3.3.8 is published on PyPI under `LGPL-3.0-only`, which this policy bans, and it is in the SHIPPED closure of this repository — so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception. ★ The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do — that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository's licence policy rather than replacing it: add `LGPL-3.0-only` / `LGPL-3.0-or-later` to the allow-list of the licence check your CI runs (`license-checker --onlyAllow`, the `allow-licenses` input of GitHub's dependency-review-action, `[licenses] allow` in cargo-deny's deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan's banned set is not read from that file, so the row stays until it is hidden.
Duplicated block (10 lines × 2) src/docs/infrastructure/vectors/document_chunk_in_memory_store.py:31— src/docs/infrastructure/vectors/document_chunk_in_memory_store.py:31-40 | src/docs/infrastructure/vectors/document_chunk_s3_store.py:29-38 — 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 (10 lines × 2) src/_core/infrastructure/embedding/exceptions.py:30— src/_core/infrastructure/embedding/exceptions.py:30-39 | src/_core/infrastructure/vectors/s3/exceptions.py:12-21 — 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 (10 lines × 2) src/admin_identity/infrastructure/repositories/admin_identity_repository.py:110— src/admin_identity/infrastructure/repositories/admin_identity_repository.py:110-119 | src/user/infrastructure/repositories/user_repository.py:68-77 — 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) examples/url_shortener/infrastructure/repositories/link_repository.py:23— examples/url_shortener/infrastructure/repositories/link_repository.py:23-32 | examples/url_shortener/infrastructure/repositories/link_repository.py:36-45 — 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.
Repeated repair: src/_apps/admin/pages/dashboard.py src/_apps/admin/pages/dashboard.py:143— src/_apps/admin/pages/dashboard.py changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 6 (its worst body is dashboard._render_ai_usage at line 143), 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(admin): recompose the dashboard into two columns”; “fix(admin): gate the infrastructure panel on the accounts permission”; “fix(admin): size the dashboard activity grid to its rows”; “fix(admin): drop the dashboard's Quick Actions section”. 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-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-09 00:57:29 +09:00' --until='2026-11-07 00:57:29 +09:00' --full-history --no-merges -- src/_apps/admin/pages/dashboard.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: src/_core/infrastructure/admin/theme.py src/_core/infrastructure/admin/theme.py:586— src/_core/infrastructure/admin/theme.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 2 (its worst body is theme.install_admin_theme_css at line 586), 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(admin): recompose the dashboard into two columns”; “fix(admin): size the dashboard activity grid to its rows”; “fix(admin): restore dark-drawer hierarchy and narrow two over-broad test guards”. 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-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-09 00:57:29 +09:00' --until='2026-11-07 00:57:29 +09:00' --full-history --no-merges -- src/_core/infrastructure/admin/theme.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: .agents/shared/governor/paths.py .agents/shared/governor/paths.py:131— .agents/shared/governor/paths.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 14 (its worst body is paths.resolve_session_roots at line 131), 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: make the session-root resolver total and fall back only inside its own tree (#425)”; “fix: keep the harness alive outside a repository and pin every state path (#425)”; “fix: resolve harness state from the session's worktree, not the hook copy (#425)”. 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-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-09 00:57:29 +09:00' --until='2026-11-07 00:57:29 +09:00' --full-history --no-merges -- .agents/shared/governor/paths.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 (9 lines × 2) src/_core/infrastructure/notification/discord_notification_adapter.py:13— src/_core/infrastructure/notification/discord_notification_adapter.py:13-21 | src/_core/infrastructure/notification/slack_notification_adapter.py:13-21 — 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 (9 lines × 2) src/admin_identity/infrastructure/repositories/admin_identity_repository.py:37— src/admin_identity/infrastructure/repositories/admin_identity_repository.py:37-45 | src/user/infrastructure/repositories/user_repository.py:41-49 — 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 (9 lines × 2) tools/governor_state_doctor.py:619— tools/governor_state_doctor.py:619-627 | tools/governor_state_doctor.py:656-664 — 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 (6 lines × 2) src/admin_identity/domain/services/admin_auth_service.py:57— src/admin_identity/domain/services/admin_auth_service.py:57-62 | src/auth/domain/services/auth_service.py:48-57 — 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) src/admin_identity/domain/services/admin_auth_service.py:88— src/admin_identity/domain/services/admin_auth_service.py:88-93 | src/auth/domain/services/auth_service.py:79-84 — 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) src/admin_identity/domain/services/admin_auth_service.py:145— src/admin_identity/domain/services/admin_auth_service.py:145-150 | src/auth/domain/services/auth_service.py:139-144 — 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.
Hotspot: .agents/shared/work_ledger.py .agents/shared/work_ledger.py:618— .agents/shared/work_ledger.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in work_ledger.build_session_summary at line 618. 8 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-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-09 00:57:29 +09:00' --until='2026-11-07 00:57:29 +09:00' --full-history --no-merges -- .agents/shared/work_ledger.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: tools/check_doc_links.py tools/check_doc_links.py:408— tools/check_doc_links.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in DocLinkChecker._check_link at line 408. 3 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-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-09 00:57:29 +09:00' --until='2026-11-07 00:57:29 +09:00' --full-history --no-merges -- tools/check_doc_links.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 (30–33 lines × 2) .antigravity/hooks/completion_gate.py:86— .antigravity/hooks/completion_gate.py:86-115 | .codex/hooks/completion_gate.py:119-151 — 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 (30–33 lines × 2) .antigravity/hooks/stop-sync-reminder.py:211— .antigravity/hooks/stop-sync-reminder.py:211-240 | .codex/hooks/stop-sync-reminder.py:293-325 — before extracting anything, compare `.antigravity/hooks/stop-sync-reminder.py` and `.codex/hooks/stop-sync-reminder.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 259 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `.codex/hooks/stop-sync-reminder.py:292` calls `suppress` and `.antigravity/hooks/stop-sync-reminder.py:209` 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 (17 lines × 2) .antigravity/hooks/_shared.py:118— .antigravity/hooks/_shared.py:118-134 | .codex/hooks/_shared.py:73-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. 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) migrations/versions/0002_add_ai_usage_log.py:98— migrations/versions/0002_add_ai_usage_log.py:98-114 | migrations/versions/0007_add_admin_audit_log.py:52-73 — 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 `migrations/versions/0002_add_ai_usage_log.py:98` 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–16 lines × 2) migrations/versions/0006_user_admin_permissions.py:24— migrations/versions/0006_user_admin_permissions.py:24-39 | migrations/versions/0009_admin_identity_realm.py:126-140 — 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. 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 (15–16 lines × 2) src/_apps/server/bootstrap.py:149— src/_apps/server/bootstrap.py:149-164 | src/_apps/worker/bootstrap.py:174-188 — 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 `src/_apps/server/bootstrap.py:149` 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 (13 lines × 2) src/_core/config.py:656— src/_core/config.py:656-669 | src/_core/config.py:672-684 — 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 `src/_core/config.py:656` 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 (13 lines × 2) examples/chatbot_with_memory/infrastructure/chatbot/pydantic_ai_chatbot_memory.py:17— examples/chatbot_with_memory/infrastructure/chatbot/pydantic_ai_chatbot_memory.py:17-29 | examples/simple_chatbot/infrastructure/chatbot/pydantic_ai_chatbot.py:14-26 — 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: `ChatReply` names `...domain.dtos.chatbot_dto` in one and `...domain.dtos.chatbot_memory_dto` in another — different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (7 lines × 2) src/_core/infrastructure/persistence/nosql/dynamodb/base_dynamo_repository.py:300— src/_core/infrastructure/persistence/nosql/dynamodb/base_dynamo_repository.py:300-309 | src/_core/infrastructure/persistence/nosql/dynamodb/base_dynamo_repository.py:351-357 — 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 (7 lines × 2) src/admin_identity/application/use_cases/admin_auth_use_case.py:96— src/admin_identity/application/use_cases/admin_auth_use_case.py:96-102 | src/auth/application/use_cases/auth_use_case.py:62-68 — 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 (11 lines × 2) src/_core/infrastructure/persistence/nosql/dynamodb/dynamodb_client.py:57— src/_core/infrastructure/persistence/nosql/dynamodb/dynamodb_client.py:57-67 | src/_core/infrastructure/storage/object_storage_client.py:26-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.
Duplicated block (11 lines × 2) tools/governor_state_doctor.py:410— tools/governor_state_doctor.py:410-420 | tools/governor_state_doctor.py:424-434 — 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 × 3) src/ai_usage/interface/admin/pages/ai_usage_page.py:47— src/ai_usage/interface/admin/pages/ai_usage_page.py:47-51 | src/docs/interface/admin/pages/docs_page.py:22-26 | src/user/interface/admin/pages/user_page.py:16-20 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. 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 (5 lines × 3) src/ai_usage/interface/admin/pages/ai_usage_page.py:98— src/ai_usage/interface/admin/pages/ai_usage_page.py:98-102 | src/docs/interface/admin/pages/docs_page.py:101-105 | src/user/interface/admin/pages/user_page.py:26-30 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. 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 (5 lines × 2) migrations/versions/0001_baseline_current_rdb_schema.py:33— migrations/versions/0001_baseline_current_rdb_schema.py:33-37 | migrations/versions/0009_admin_identity_realm.py:27-31 — 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 `migrations/versions/0001_baseline_current_rdb_schema.py:33` 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 (5 lines × 2) examples/blog/author/interface/server/routers/author_router.py:43— examples/blog/author/interface/server/routers/author_router.py:43-47 | examples/todo/interface/server/routers/todo_router.py:43-47 — 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.
P8 · Schema migrations· Schema created by SQLAlchemy create_all() outside the migrations · ×2
Schema created by SQLAlchemy create_all() outside the migrations src/_core/infrastructure/admin/audit/__init__.py:4— This repository versions its schema (Alembic), but SQLAlchemy create_all() here builds or alters the schema from the model as well, outside that history — the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Alembic own the schema.
Schema created by SQLAlchemy create_all() outside the migrations src/_apps/server/bootstrap.py:133— This repository versions its schema (Alembic), but SQLAlchemy create_all() here builds or alters the schema from the model as well, outside that history — the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Alembic own the schema.
Settings._validate_environment_safety (cyclomatic 101) src/_core/config.py:551— Settings._validate_environment_safety has cyclomatic complexity 101 (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.
work_ledger.build_session_summary (cyclomatic 27) .agents/shared/work_ledger.py:618— work_ledger.build_session_summary has cyclomatic complexity 27 (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.
completion_gate.governor_changing_segment (cyclomatic 21) .claude/hooks/completion_gate.py:145— completion_gate.governor_changing_segment has cyclomatic complexity 21 (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.
post-tool-format._extract_exit_code (cyclomatic 19) .antigravity/hooks/post-tool-format.py:124— post-tool-format._extract_exit_code 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.
env_utils.load_models (cyclomatic 16) migrations/env_utils.py:17— env_utils.load_models has cyclomatic complexity 16 (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.
BaseDynamoRepository.query_items (cyclomatic 16) src/_core/infrastructure/persistence/nosql/dynamodb/base_dynamo_repository.py:150— BaseDynamoRepository.query_items 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.
Settings._validate_environment_safety (cognitive 122) src/_core/config.py:551— Settings._validate_environment_safety has cognitive complexity 122 (threshold 15). Drivers by points: if/else 63 (83 pts), boolean chains 35, loops 2 (4 pts) (nesting depth added 22). 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.
post-tool-format._extract_exit_code (cognitive 36) .antigravity/hooks/post-tool-format.py:124— post-tool-format._extract_exit_code has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (6 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 18). 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.
work_ledger.build_session_summary (cognitive 30) .agents/shared/work_ledger.py:618— work_ledger.build_session_summary has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13, ternaries 6 (10 pts), boolean chains 7 (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.
env_utils.load_models (cognitive 27) migrations/env_utils.py:17— env_utils.load_models has cognitive complexity 27 (threshold 15). Drivers by points: error handling 4 (10 pts), if/else 5 (9 pts), loops 4 (6 pts), boolean chains 2 (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.
scanner.scan_dynamo_models (cognitive 25) migrations/dynamodb/scanner.py:17— scanner.scan_dynamo_models has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 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.
scanner.scan_s3vector_models (cognitive 25) migrations/s3vectors/scanner.py:17— scanner.scan_s3vector_models has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 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.
completion_gate.governor_changing_segment (cognitive 22) .claude/hooks/completion_gate.py:145— completion_gate.governor_changing_segment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 6 (7 pts), boolean chains 4, error handling 1 (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.
post-tool-format._extract_exit_code (cognitive 21) .codex/hooks/post-tool-format.py:40— post-tool-format._extract_exit_code has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 2 (7 pts), loops 2, 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.
BaseDynamoRepository.query_items (cognitive 21) src/_core/infrastructure/persistence/nosql/dynamodb/base_dynamo_repository.py:150— BaseDynamoRepository.query_items has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 1 (2 pts), boolean chains 1, ternaries 1 (nesting depth added 5). 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.
user-prompt-submit._extract_prompt (cognitive 19) .antigravity/hooks/user-prompt-submit.py:29— user-prompt-submit._extract_prompt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (4 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.
DynamoDBMigrator._create_table (cognitive 18) migrations/dynamodb/migrator.py:54— DynamoDBMigrator._create_table has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (2 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.
post-tool-format._shell_text_outcome (cognitive 16) .antigravity/hooks/post-tool-format.py:67— post-tool-format._shell_text_outcome has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 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.
user-prompt-submit.main (cognitive 16) .codex/hooks/user-prompt-submit.py:75— user-prompt-submit.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, error handling 3 (4 pts) (nesting depth added 2). 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.
layout.admin_layout (cognitive 16) src/_core/infrastructure/admin/layout.py:64— layout.admin_layout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, loops 1 (2 pts), ternaries 2 (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.
FileTooLong: _core/config.py src/_core/config.py— FileTooLong — 697 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 197 over it, 1.39× 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.
D4 · Code Duplication· Edited copy of a member (23 corresponding lines) · ×1
Edited copy of a member (23 corresponding lines) migrations/versions/0004_add_auth_refresh_tokens.py:22— migrations/versions/0004_add_auth_refresh_tokens.py:22-44 | migrations/versions/0009_admin_identity_realm.py:27-119 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) .antigravity/hooks/stop-sync-reminder.py:104— .antigravity/hooks/stop-sync-reminder.py:104-123 | .antigravity/hooks/stop-sync-reminder.py:134-158 | .codex/hooks/stop-sync-reminder.py:127-171 | .codex/hooks/stop-sync-reminder.py:182-216 — 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 (53–56 lines × 2) .antigravity/hooks/stop-sync-reminder.py:245— .antigravity/hooks/stop-sync-reminder.py:245-297 | .codex/hooks/stop-sync-reminder.py:340-395 — before extracting anything, compare `.antigravity/hooks/stop-sync-reminder.py` and `.codex/hooks/stop-sync-reminder.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 259 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 (16–45 lines × 2) .antigravity/hooks/stop-sync-reminder.py:164— .antigravity/hooks/stop-sync-reminder.py:164-208 | .codex/hooks/stop-sync-reminder.py:230-245 — before extracting anything, compare `.antigravity/hooks/stop-sync-reminder.py` and `.codex/hooks/stop-sync-reminder.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 259 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. Read the line range as the matched WINDOW rather than a finished unit: at `.codex/hooks/stop-sync-reminder.py:230` 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 (25–35 lines × 2) .antigravity/hooks/stop-sync-reminder.py:134— .antigravity/hooks/stop-sync-reminder.py:134-158 | .codex/hooks/stop-sync-reminder.py:182-216 — before extracting anything, compare `.antigravity/hooks/stop-sync-reminder.py` and `.codex/hooks/stop-sync-reminder.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 259 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. Read the line range as the matched WINDOW rather than a finished unit: at `.codex/hooks/stop-sync-reminder.py:182` 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 (25 lines × 2) migrations/dynamodb/scanner.py:29— migrations/dynamodb/scanner.py:29-53 | migrations/s3vectors/scanner.py:29-53 — 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 (24 lines × 2) .antigravity/hooks/stop-sync-reminder.py:170— .antigravity/hooks/stop-sync-reminder.py:170-209 | .codex/hooks/stop-sync-reminder.py:267-290 — before extracting anything, compare `.antigravity/hooks/stop-sync-reminder.py` and `.codex/hooks/stop-sync-reminder.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 259 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. Read the line range as the matched WINDOW rather than a finished unit: at `.antigravity/hooks/stop-sync-reminder.py:170` 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 after the matched lines, `.codex/hooks/stop-sync-reminder.py:292` calls `suppress` and `.antigravity/hooks/stop-sync-reminder.py:211` 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 (20–23 lines × 2) .antigravity/hooks/stop-sync-reminder.py:104— .antigravity/hooks/stop-sync-reminder.py:104-123 | .codex/hooks/stop-sync-reminder.py:149-171 — before extracting anything, compare `.antigravity/hooks/stop-sync-reminder.py` and `.codex/hooks/stop-sync-reminder.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 259 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 (18–20 lines × 2) .antigravity/hooks/post-tool-format.py:178— .antigravity/hooks/post-tool-format.py:178-195 | .codex/hooks/post-tool-format.py:70-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. 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 (18 lines × 2) .antigravity/hooks/post-tool-format.py:21— .antigravity/hooks/post-tool-format.py:21-38 | .codex/hooks/post-tool-format.py:20-37 — 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 (16–18 lines × 2) migrations/versions/0004_add_auth_refresh_tokens.py:29— migrations/versions/0004_add_auth_refresh_tokens.py:29-44 | migrations/versions/0009_admin_identity_realm.py:62-79 — 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 `migrations/versions/0004_add_auth_refresh_tokens.py:29` 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–18 lines × 2) src/_core/infrastructure/rag/pydantic_ai_answer_agent.py:135— src/_core/infrastructure/rag/pydantic_ai_answer_agent.py:135-152 | src/classification/infrastructure/classifier/pydantic_ai_classifier.py:99-113 — 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 (15–17 lines × 2) src/_core/config.py:801— src/_core/config.py:801-815 | src/_core/config.py:828-844 — 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 `src/_core/config.py:828` 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 (13–15 lines × 2) migrations/dynamodb/cli.py:36— migrations/dynamodb/cli.py:36-50 | migrations/s3vectors/cli.py:45-57 — 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 `migrations/dynamodb/cli.py:36` 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–15 lines × 2) migrations/env_utils.py:50— migrations/env_utils.py:50-64 | migrations/env_utils.py:74-85 — 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 (12–14 lines × 2) src/_core/config.py:671— src/_core/config.py:671-684 | src/_core/config.py:710-721 — 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 `src/_core/config.py:671` 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–13 lines × 2) src/_apps/admin/pages/accounts.py:74— src/_apps/admin/pages/accounts.py:74-85 | src/_apps/admin/pages/setup.py:53-65 — 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 `src/_apps/admin/pages/setup.py:53` 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 lines × 4) .antigravity/hooks/stop-sync-reminder.py:109— .antigravity/hooks/stop-sync-reminder.py:109-120 | .antigravity/hooks/stop-sync-reminder.py:144-155 | .codex/hooks/stop-sync-reminder.py:154-165 | .codex/hooks/stop-sync-reminder.py:201-212 — before extracting anything, compare `.antigravity/hooks/stop-sync-reminder.py` and `.codex/hooks/stop-sync-reminder.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 259 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. Read the line range as the matched WINDOW rather than a finished unit: at `.antigravity/hooks/stop-sync-reminder.py:109` 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) src/_core/domain/value_objects/agent_usage_record.py:75— src/_core/domain/value_objects/agent_usage_record.py:75-86 | src/ai_usage/interface/server/schemas/ai_usage_schema.py:65-76 — 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 (10 lines × 3) src/_core/infrastructure/persistence/rdb/base_repository.py:98— src/_core/infrastructure/persistence/rdb/base_repository.py:98-107 | src/_core/infrastructure/persistence/rdb/base_repository.py:238-247 | src/_core/infrastructure/persistence/rdb/base_repository.py:255-264 — 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.
Duplicated block (6–8 lines × 2) migrations/dynamodb/migrator.py:56— migrations/dynamodb/migrator.py:56-63 | migrations/dynamodb/migrator.py:131-136 — 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 `migrations/dynamodb/migrator.py:56` 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 (15 lines × 2) .antigravity/hooks/stop-sync-reminder.py:70— .antigravity/hooks/stop-sync-reminder.py:70-84 | .codex/hooks/stop-sync-reminder.py:92-106 — before extracting anything, compare `.antigravity/hooks/stop-sync-reminder.py` and `.codex/hooks/stop-sync-reminder.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 259 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 (8 lines × 4) src/admin_identity/infrastructure/repositories/admin_identity_repository.py:48— src/admin_identity/infrastructure/repositories/admin_identity_repository.py:48-57 | src/admin_identity/infrastructure/repositories/admin_refresh_token_repository.py:22-29 | src/auth/infrastructure/repositories/refresh_token_repository.py:22-29 | src/user/infrastructure/repositories/user_repository.py:52-59 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. 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–27 lines × 3) examples/chatbot_with_guardrails/domain/services/chatbot_service.py:31— examples/chatbot_with_guardrails/domain/services/chatbot_service.py:31-47 | examples/simple_chatbot/domain/services/chatbot_service.py:29-55 | examples/web_search_chatbot/domain/services/chatbot_service.py:29-55 — before extracting anything, compare `examples/simple_chatbot/domain/services/chatbot_service.py` and `examples/web_search_chatbot/domain/services/chatbot_service.py` as WHOLE FILES: 100% 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. 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 (8–10 lines × 2) tools/check_harness_hook_surface.py:97— tools/check_harness_hook_surface.py:97-104 | tools/check_harness_hook_surface.py:108-117 — 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 (7–10 lines × 3) tools/governor_state_doctor.py:171— tools/governor_state_doctor.py:171-180 | tools/governor_state_doctor.py:182-191 | tools/governor_state_doctor.py:192-198 — 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.
Duplicated block (8 lines × 2) tools/governor_state_doctor.py:601— tools/governor_state_doctor.py:601-608 | tools/governor_state_doctor.py:631-638 — 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 (35 lines × 3) examples/chatbot_with_guardrails/interface/server/routers/chatbot_router.py:34— examples/chatbot_with_guardrails/interface/server/routers/chatbot_router.py:34-68 | examples/simple_chatbot/interface/server/routers/chatbot_router.py:34-68 | examples/web_search_chatbot/interface/server/routers/chatbot_router.py:34-68 — before extracting anything, compare `examples/simple_chatbot/interface/server/routers/chatbot_router.py` and `examples/web_search_chatbot/interface/server/routers/chatbot_router.py` as WHOLE FILES: 92% 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. 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 (14 lines × 2) examples/simple_chatbot/infrastructure/chatbot/stub_chatbot.py:28— examples/simple_chatbot/infrastructure/chatbot/stub_chatbot.py:28-41 | examples/web_search_chatbot/infrastructure/chatbot/stub_chatbot.py:28-41 — before extracting anything, compare `examples/simple_chatbot/infrastructure/chatbot/stub_chatbot.py` and `examples/web_search_chatbot/infrastructure/chatbot/stub_chatbot.py` as WHOLE FILES: 100% 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. 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.
No DR/backup evidence — A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced — a volume that survives a container recreate is not a tested restore from catastrophic loss.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×1
Recursive walk over a caller-supplied document has no depth cap src/_core/infrastructure/persistence/nosql/dynamodb/dynamodb_model.py:184— `from_dynamodb` is public, takes a document from its caller (line 148) and hands it to `_clean_value`, which calls itself at line 184 (`self._clean_value`) with a piece of `value` (and at line 186) — and nowhere in `_clean_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 `_clean_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Duplicated predicate src/_core/infrastructure/embedding/pydantic_ai_embedding_adapter.py:203— `"rate" in error_str and "limit" in error_str` appears character-identically in 2 files — src/_core/infrastructure/embedding/pydantic_ai_embedding_adapter.py, src/_core/infrastructure/llm/error_mapper.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 .antigravity/hooks/user-prompt-submit.py:63— `Blocked is not None and isinstance(result, Blocked)` appears character-identically in 2 files — .antigravity/hooks/user-prompt-submit.py, .codex/hooks/user-prompt-submit.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 .antigravity/hooks/user-prompt-submit.py:69— `ParsedToken is not None and isinstance(result, ParsedToken)` appears character-identically in 2 files — .antigravity/hooks/user-prompt-submit.py, .codex/hooks/user-prompt-submit.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 .antigravity/hooks/stop-sync-reminder.py:168— `_SYNC_OK and _classify_advisory is not None` appears character-identically in 2 files — .antigravity/hooks/stop-sync-reminder.py, .codex/hooks/stop-sync-reminder.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 .antigravity/hooks/completion_gate.py:106— `_resolve_locale_string("GOVERNOR_REMINDER_NO_PR") or GOVERNOR_REMINDER_NO_PR` appears character-identically in 3 files — .antigravity/hooks/completion_gate.py, .claude/hooks/completion_gate.py, .codex/hooks/completion_gate.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 .antigravity/hooks/completion_gate.py:110— `_resolve_locale_string("GOVERNOR_REMINDER_WITH_PR") or GOVERNOR_REMINDER_WITH_PR` appears character-identically in 3 files — .antigravity/hooks/completion_gate.py, .claude/hooks/completion_gate.py, .codex/hooks/completion_gate.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 .antigravity/hooks/stop-sync-reminder.py:158— `_resolve_locale_string("PLAN_EXECUTE_REMINDER") or PLAN_EXECUTE_REMINDER` appears character-identically in 3 files — .antigravity/hooks/stop-sync-reminder.py, .claude/hooks/pre_tool_stage_block.py, .codex/hooks/stop-sync-reminder.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 .antigravity/hooks/stop-sync-reminder.py:123— `_resolve_locale_string("STAGE_GATE_REMINDER") or STAGE_GATE_REMINDER` appears character-identically in 3 files — .antigravity/hooks/stop-sync-reminder.py, .claude/hooks/post_tool_stage_gate.py, .codex/hooks/stop-sync-reminder.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 .antigravity/hooks/completion_gate.py:94— `_shared_governor_subset is not None and _shared_is_sync_cosmetic_only is not None` appears character-identically in 3 files — .antigravity/hooks/completion_gate.py, .claude/hooks/completion_gate.py, .codex/hooks/completion_gate.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 .antigravity/hooks/stop-sync-reminder.py:228— `bool(changed) and not is_log_only_backfill(changed) and is_governor_changing(changed, globs)` appears character-identically in 2 files — .antigravity/hooks/stop-sync-reminder.py, .codex/hooks/stop-sync-reminder.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 .antigravity/hooks/_shared.py:132— `candidate.exists() and candidate.is_file()` appears character-identically in 2 files — .antigravity/hooks/_shared.py, .codex/hooks/_shared.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 src/admin_identity/interface/server/dependencies/admin_auth_dependencies.py:27— `credentials is None or credentials.scheme.lower() != "bearer"` appears character-identically in 2 files — src/admin_identity/interface/server/dependencies/admin_auth_dependencies.py, src/auth/interface/server/dependencies/auth_dependencies.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 src/admin_identity/infrastructure/repositories/admin_refresh_token_repository.py:54— `data is None or data.revoked_at is not None` appears character-identically in 2 files — src/admin_identity/infrastructure/repositories/admin_refresh_token_repository.py, src/auth/infrastructure/repositories/refresh_token_repository.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 .antigravity/hooks/_shared.py:156— `explicit or f"{os.getppid()}-{os.getpid()}-{_PROCESS_START_NS:016x}"` appears character-identically in 2 files — .antigravity/hooks/_shared.py, .codex/hooks/_shared.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 src/_apps/admin/pages/accounts.py:102— `getattr(exc, "error_code", None) or type(exc).__name__` appears character-identically in 4 files — src/_apps/admin/pages/accounts.py, src/_apps/admin/pages/change_password.py, src/_apps/admin/pages/setup.py, src/_core/infrastructure/admin/audit/logger.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 .antigravity/hooks/post-tool-format.py:206— `inp.get("file_path") or inp.get("path") or inp.get("filePath")` appears character-identically in 2 files — .antigravity/hooks/post-tool-format.py, .antigravity/hooks/pre-tool-security.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 .antigravity/hooks/completion_gate.py:75— `not _SHARED_OK or _shared_consume_phase2_markers is None` appears character-identically in 3 files — .antigravity/hooks/completion_gate.py, .claude/hooks/completion_gate.py, .codex/hooks/completion_gate.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 .antigravity/hooks/completion_gate.py:69— `not _SHARED_OK or _shared_read_latest_token is None or MarkerLifecycle is None` appears character-identically in 3 files — .antigravity/hooks/completion_gate.py, .claude/hooks/completion_gate.py, .codex/hooks/completion_gate.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 .claude/hooks/user_prompt_submit.py:67— `not _SHARED_OK or _shared_write_marker is None` appears character-identically in 2 files — .claude/hooks/user_prompt_submit.py, .codex/hooks/user-prompt-submit.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 .antigravity/hooks/user-prompt-submit.py:55— `not _SHARED_OK or safe_parse_exception_token is None` appears character-identically in 2 files — .antigravity/hooks/user-prompt-submit.py, .codex/hooks/user-prompt-submit.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 .antigravity/hooks/stop-sync-reminder.py:140— `not _STAGE_GATE_OK or is_implementation_source is None or default_ledger_path is None or should_plan_execute_gate is None` appears character-identically in 2 files — .antigravity/hooks/stop-sync-reminder.py, .codex/hooks/stop-sync-reminder.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 .antigravity/hooks/stop-sync-reminder.py:105— `not _STAGE_GATE_OK or is_implementation_source is None or default_ledger_path is None or should_stage_gate is None` appears character-identically in 2 files — .antigravity/hooks/stop-sync-reminder.py, .codex/hooks/stop-sync-reminder.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 .antigravity/hooks/completion_gate.py:91— `not globs or not is_governor_changing(changed, globs)` appears character-identically in 2 files — .antigravity/hooks/completion_gate.py, .claude/hooks/completion_gate.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 .antigravity/hooks/post-tool-format.py:22— `not paths or shutil.which("ruff") is None` appears character-identically in 2 files — .antigravity/hooks/post-tool-format.py, .codex/hooks/post-tool-format.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 migrations/env.py:58— `os.getenv("DATABASE_ENGINE") or "postgresql"` appears character-identically in 2 files — migrations/env.py, tools/migrate_legacy_revision_ids.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 .antigravity/hooks/post-tool-format.py:227— `main` swallows every exception into `return 0` — 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 .claude/hooks/completion_gate.py:237— `main` swallows every exception into `return 0` — 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 .claude/hooks/post_tool_stage_gate.py:117— `main` swallows every exception into `return 0` — 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 .codex/hooks/post-tool-format.py:107— `main` swallows every exception into `return 0` — 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 on parse failure .claude/hooks/user_prompt_submit.py:78— `read_payload` returns `{}` when `json.JSONDecodeError` 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.
Silent fallback default on parse failure tools/check_language_policy.py:330— `find_violations` returns `[]` when `(OSError, UnicodeDecodeError)` 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.
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.
Partial audit-trail evidence — An audit mechanism is present, but the trail is not yet complete — missing: a write-side hook every change flows through (HistoricalRecords, auditlog.register, reversion.register, pghistory.track, SQLAlchemy-Continuum, a post_save / after_update listener recording each change, or an event-sourced store), per-model coverage (a change-history registration on each model that needs a who-changed-what trail, or an event-sourced aggregate).
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)` (24013 LoC, 564 module-visible types across 215 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.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
No SAST REDACTED:6— 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 15338 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.
Dependency hygiene PARTLY measured — Python dependencies read, no exact pin to grade for currency — This repository's Python dependencies were read: 12 shipped distribution(s) across 1 manifest(s) (18 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 01a1be7c-4771-7aad-b82e-1a09df676a3e · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 50 · Warnings: 104 · Recommendations: 37 · Info: 1 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 09-11-2026 @ 04:06 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.