Borrowing it
Nothing to install: this file belongs to Dimkox/adaptive-grok-build-pro. Take a copy, put it at the same path in your own repository, and replace the rules that are about this project with yours.
curl -O https://raw.githubusercontent.com/Dimkox/adaptive-grok-build-pro/main/AGENTS.mdgit clone --depth 1 https://github.com/Dimkox/adaptive-grok-build-proWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/instructions/dimkox/adaptive-grok-build-pro/agents-md)<a href="https://agentmods.dev/instructions/dimkox/adaptive-grok-build-pro/agents-md"><img src="https://agentmods.dev/badge/instructions/dimkox/adaptive-grok-build-pro/agents-md/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/instructions/dimkox/adaptive-grok-build-pro/agents-md"><img src="https://agentmods.dev/badge/instructions/dimkox/adaptive-grok-build-pro/agents-md.svg" alt="Reviewed on agentmods" width="80" height="20"></a>What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.05367 | $0.05367 |
| Opus 5.5 | $0.02147 | $0.02147 |
| Sonnet 5.5 | $0.01073 | $0.01073 |
| Haiku 4.5 | $0.00537 | $0.00537 |
Grade A, and why
adaptive-grok-build-pro AGENTS.md scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 24d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 215 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Adaptive Grok Build Pro Engineering Contract
Mandatory startup algorithm: measure, then dispatch
Step zero precedes all other startup work, including backlog/route inspection, dependency planning, agent spawning and CPU-heavy commands. Complete resource discovery below and record its snapshot locally first; attach it to the change package after selecting the route. Only then inspect backlog/routes, plan dependencies, dispatch work, assign isolated writers and apply verification/delivery gates, in that order.
- Observe host physical-core and online logical-CPU topology (
lscpu,nproc --all), current process capacity (nproc) and affinity (taskset -pc <pid>). Physical cores, logical CPUs and allowed CPUs are different quantities. - Resolve the process's actual cgroup membership/mounts, effective cpuset and finite CPU quota, including applicable ancestor limits. Do not infer usable capacity from host CPU count alone; if a bound cannot be established, report the uncertainty and use a conservative capacity.
- When affinity appears narrower than the effective cpuset and policy permits it, run one bounded child-only affinity-widening probe over the candidate allowed CPU IDs. For example,
taskset -c 0-27 nprocpreviously exposed 28 CPUs where defaultnprocshowed 22. Recheck that child's affinity and quotas; a failed probe leaves the existing limits in force. Never assume this example's CPU IDs exist on another host or change the controller/system affinity as a shortcut. - Compute verified effective CPU capacity from the child/process allowed online CPUs, effective cpuset and finite quota (conservatively round quota capacity down, with one worker minimum). Record timestamp, commands/results, topology, affinity, cpuset/quota bounds, probe result and chosen capacity. Remeasure at every startup and when the execution environment changes. The September 26 host observation was 14 physical cores / 28 logical CPUs, not a permanent capacity guarantee.
- After the CPU snapshot is recorded, inspect repository handoff/backlog/routes and build the dependency plan. Separately observe available agent slots: the current platform exposes one controller plus 12 child-agent slots; route
max_parallel_analysis=10remains the routing cap, and test-process worker counts are a third independent limit. Never manufacture route permissions or add unselected agents to fill slots. - Dispatch all independent route-permitted analyses, checks and reviews in parallel when their prerequisites are satisfied, scheduling available slots in waves. Spread eligible CPU-heavy child work across the verified effective CPU capacity, using the successfully probed affinity when needed and coordinating worker totals to avoid oversubscription. Record dependencies, isolation or resource limits that require serialization.
- Keep exactly one write owner per isolated task/route/branch/worktree. Independent writers may run concurrently only on separate isolated task contours and worktrees; no two writers share a mutable candidate. Reviews remain independent and read-only.
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 24d ago Changed · +3 lines · +407 tokens per session 5ce073e82c88
- 1mo ago Changed · +28 lines · +1,900 tokens per session 8df3a08e8e53
- 1mo ago Changed · +9 lines · +291 tokens per session d552d9cf89f8
- 1mo ago Changed · -1 tokens per session 221475c1f981
- 2mo ago First seen · 175 lines · 2,770 tokens per session scan A 6f9216579ffb
adaptive-grok-build-pro AGENTS.md is an instructions file published in the GitHub repository Dimkox/adaptive-grok-build-pro (2 stars, last pushed 23d ago), licensed MIT. It adds 5,367 tokens to every session, about $0.0215 per session on Opus 5.5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-31.
Other instructions, from other repositories
vscode buildNext.instructions.md
Working notes and architecture documentation for the new esbuild-based build system in build/next. Use when making changes to the new build pipeline (transpile/bundle commands, NLS plugin, source-map handling, resource copying, or self-hosting watch tasks).
next.js AGENTS.md
AGENTS.md instructions for vercel/next.js, covering next.js development guide, codebase structure, monorepo overview, core package: packages/next and other important packages.
vscode oss-third-party-notices.instructions.md
Instructions for microsoft/vscode, covering vs code oss third-party-notices pipeline, architecture, pipeline flow in ci, cache eligibility and rollout and applying the notice (cutover).
langchain AGENTS.md
AGENTS.md instructions for langchain-ai/langchain, covering global development guidelines for the langchain monorepo, corridor security analysis, project architecture and context, monorepo structure and development tools & commands.
vscode copilot-instructions.md
Copilot instructions for microsoft/vscode, covering vs code copilot instructions, project overview, root folders, core architecture (src/ folder) and built-in extensions (extensions/ folder).
deno copilot-instructions.md
Copilot instructions for denoland/deno, covering deno development guide for github copilot, network access, high level overview, key directories and key files to understand first.