Guards

Warns before node_modules, build output, OS junk or huge files get staged.

Runs go mod tidy when Claude changes Go imports, so go.mod and go.sum stay in sync.

Gives Claude a compact summary of your GraphQL schema when you work on queries and resolvers.

One security policy for every guard mod — permissive, standard or strict — plus a project safety score.

Warns when large images, videos or fonts are added to the project.

Flags hard-coded user-facing strings in UI components.

Turns kubectl apply into a server-side dry run with a diff you approve first.

Flags event listeners, intervals and subscriptions created without cleanup.

Claude explains the why behind each change and leaves small TODOs for you to complete yourself.

When Claude fixes a mistake, offers to save the lesson to CLAUDE.md.

Warns when a dependency with a copyleft license (GPL, AGPL) lands in a permissively licensed project.

Adds your license header to every new source file Claude creates.

Runs the linter on each edited file and hands the errors straight back to Claude.

Prevents hand-editing lockfiles; they must change through the package manager.

Alerts you when a single command has been running too long.

Stops Claude when it repeats the same failing command three times and suggests a different approach.

Warns you the moment Claude starts editing files directly on main or master.

Prevents editing database migrations that already exist; write a new one instead.

Gives new migrations consistent, descriptive, timestamped names.

One dashboard for every Claude session on your machine: what each is doing, cost, blockers, with pause and priorities.

Recommends the right mods for your project and for what you're asking, with the commands to type, and installs them in one click.

The shared core that lets mods talk to each other: one event bus, one side panel with tabs, one place that routes notifications to your channels.

Detects which monorepo package you're in and scopes test, lint and build commands to it.

Spots database queries inside loops, the classic N+1 problem, as Claude writes them.