create-agdf 0.4.8 → 0.5.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +4 -3
- package/bin/create-agdf.js +74 -4
- package/generated/.agdf/control/README.md +1 -0
- package/generated/.github/skills/agdf-delivery-path-search/SKILL.md +14 -0
- package/generated/.github/skills/agdf-runtime-contract.md +30 -0
- package/generated/.opencode/agdf-runtime-contract.md +30 -0
- package/generated/.opencode/agents/agdf-delivery-path-search.md +14 -0
- package/generated/plugins/agdf/.codex-plugin/plugin.json +8 -9
- package/generated/plugins/agdf/LICENSE +201 -0
- package/generated/plugins/agdf/control/README.md +1 -0
- package/generated/plugins/agdf/meta/agdf-plugin.definition.json +9 -10
- package/generated/plugins/agdf/meta/agdf-runtime-contract.md +30 -0
- package/generated/plugins/agdf/skills/delivery-path-search/SKILL.md +14 -0
- package/lib/delivery-path-search/candidate-policy.js +67 -2
- package/lib/delivery-path-search/contracts.js +127 -0
- package/lib/delivery-path-search/evaluators/claude.js +2 -16
- package/lib/delivery-path-search/evaluators/codex.js +2 -16
- package/lib/delivery-path-search/generators/claude.js +40 -0
- package/lib/delivery-path-search/generators/codex.js +38 -0
- package/lib/delivery-path-search/generators/protocol.js +12 -0
- package/lib/delivery-path-search/persistence.js +5 -0
- package/lib/delivery-path-search/search-engine.js +64 -2
- package/lib/delivery-path-search/state-adapter.js +34 -2
- package/lib/delivery-path-search/transports/read-only-guard.js +43 -0
- package/package.json +3 -2
package/README.md
CHANGED
|
@@ -155,17 +155,18 @@ Use `delivery-path-search` only for high-impact planning decisions with several
|
|
|
155
155
|
npx --yes @agdf/cli@latest delivery-path-search --surface codex --json
|
|
156
156
|
```
|
|
157
157
|
|
|
158
|
-
The
|
|
158
|
+
The runtime uses bounded best-first Delivery Path Search, not MCTS. It is read-only and advisory: the result must be checked by canonical `gate-check`. Codex and Claude Code are executable, tool-enforced evaluator adapters and support opt-in `--generate-candidates`; generated proposals supplement the deterministic baseline and are deterministically validated before evaluation. Copilot and OpenCode reuse the same skill and contracts as instruction-only surfaces until conforming executable adapters are available.
|
|
159
159
|
|
|
160
160
|
Requirements and boundaries:
|
|
161
161
|
|
|
162
162
|
- run it only in a repository with live `.agdf/control/AGDF_RUN.md` state
|
|
163
163
|
- the current control state must expose legal next actions
|
|
164
164
|
- Codex CLI must be installed and authenticated for `--surface codex`
|
|
165
|
-
-
|
|
165
|
+
- Claude Code CLI must be installed and authenticated for `--surface claude`
|
|
166
|
+
- `--model <id>` optionally selects the Codex or Claude evaluator model
|
|
166
167
|
- `--persist` writes redacted `DELIVERY_PATH_SEARCH.json` and `.md` evidence under the current scope
|
|
167
168
|
- `--fixture <path>` is for deterministic contract tests, not a production evaluator
|
|
168
|
-
-
|
|
169
|
+
- Copilot and OpenCode have shared workflow mappings but no executable native evaluator in this release
|
|
169
170
|
- cost units are rubric values used for bounded comparison, not measured provider currency
|
|
170
171
|
|
|
171
172
|
The result is either one recommendation or `no_safe_recommendation`. In both cases run canonical `gate-check` afterwards.
|
package/bin/create-agdf.js
CHANGED
|
@@ -11,6 +11,9 @@ import { runDeliveryPathSearch } from "../lib/delivery-path-search/search-engine
|
|
|
11
11
|
import { codexEvaluator } from "../lib/delivery-path-search/evaluators/codex.js";
|
|
12
12
|
import { claudeEvaluator } from "../lib/delivery-path-search/evaluators/claude.js";
|
|
13
13
|
import { fixtureEvaluator } from "../lib/delivery-path-search/evaluators/protocol.js";
|
|
14
|
+
import { codexGenerator } from "../lib/delivery-path-search/generators/codex.js";
|
|
15
|
+
import { claudeGenerator } from "../lib/delivery-path-search/generators/claude.js";
|
|
16
|
+
import { fixtureGenerator } from "../lib/delivery-path-search/generators/protocol.js";
|
|
14
17
|
import { enforcementForSurface } from "../lib/delivery-path-search/surfaces/capabilities.js";
|
|
15
18
|
import { persistSearchResult } from "../lib/delivery-path-search/persistence.js";
|
|
16
19
|
|
|
@@ -213,6 +216,13 @@ Options:
|
|
|
213
216
|
Use deterministic evaluator/candidate fixtures instead of a live evaluator
|
|
214
217
|
--persist Persist the redacted Delivery Path Search result under the current scope
|
|
215
218
|
--model <id> Optional Codex evaluator model
|
|
219
|
+
--generate-candidates
|
|
220
|
+
Add one bounded AI-native candidate-generation call before evaluation
|
|
221
|
+
--generator-model <id>
|
|
222
|
+
Optional candidate-generator model override
|
|
223
|
+
--max-generated-candidates <1-5>
|
|
224
|
+
--generation-timeout-ms <1-30000>
|
|
225
|
+
--generation-cost-units <1-5>
|
|
216
226
|
--help Show this help
|
|
217
227
|
`);
|
|
218
228
|
}
|
|
@@ -281,6 +291,11 @@ function parseArgs(argv) {
|
|
|
281
291
|
let fixture;
|
|
282
292
|
let persist = false;
|
|
283
293
|
let model;
|
|
294
|
+
let generateCandidates = false;
|
|
295
|
+
let generatorModel;
|
|
296
|
+
let maxGeneratedCandidates = 5;
|
|
297
|
+
let generationTimeoutMs = 30000;
|
|
298
|
+
let generationCostUnits = 5;
|
|
284
299
|
|
|
285
300
|
for (let i = 0; i < args.length; i += 1) {
|
|
286
301
|
const arg = args[i];
|
|
@@ -311,7 +326,12 @@ function parseArgs(argv) {
|
|
|
311
326
|
continue;
|
|
312
327
|
}
|
|
313
328
|
|
|
314
|
-
if (
|
|
329
|
+
if (arg === "--generate-candidates") {
|
|
330
|
+
generateCandidates = true;
|
|
331
|
+
continue;
|
|
332
|
+
}
|
|
333
|
+
|
|
334
|
+
if (["--surface", "--fixture", "--model", "--generator-model", "--max-generated-candidates", "--generation-timeout-ms", "--generation-cost-units"].includes(arg)) {
|
|
315
335
|
const next = args[i + 1];
|
|
316
336
|
if (!next) {
|
|
317
337
|
console.error(`Missing value for ${arg}`);
|
|
@@ -324,7 +344,19 @@ function parseArgs(argv) {
|
|
|
324
344
|
}
|
|
325
345
|
surface = next;
|
|
326
346
|
} else if (arg === "--fixture") fixture = next;
|
|
327
|
-
else model = next;
|
|
347
|
+
else if (arg === "--model") model = next;
|
|
348
|
+
else if (arg === "--generator-model") generatorModel = next;
|
|
349
|
+
else {
|
|
350
|
+
const value = Number(next);
|
|
351
|
+
const maximum = arg === "--generation-timeout-ms" ? 30000 : 5;
|
|
352
|
+
if (!Number.isInteger(value) || value < 1 || value > maximum) {
|
|
353
|
+
console.error(`${arg} must be an integer from 1 to ${maximum}.`);
|
|
354
|
+
process.exit(1);
|
|
355
|
+
}
|
|
356
|
+
if (arg === "--max-generated-candidates") maxGeneratedCandidates = value;
|
|
357
|
+
else if (arg === "--generation-timeout-ms") generationTimeoutMs = value;
|
|
358
|
+
else generationCostUnits = value;
|
|
359
|
+
}
|
|
328
360
|
i += 1;
|
|
329
361
|
continue;
|
|
330
362
|
}
|
|
@@ -395,6 +427,11 @@ function parseArgs(argv) {
|
|
|
395
427
|
fixture: fixture ? resolve(process.cwd(), fixture) : null,
|
|
396
428
|
persist,
|
|
397
429
|
model,
|
|
430
|
+
generateCandidates,
|
|
431
|
+
generatorModel,
|
|
432
|
+
maxGeneratedCandidates,
|
|
433
|
+
generationTimeoutMs,
|
|
434
|
+
generationCostUnits,
|
|
398
435
|
};
|
|
399
436
|
}
|
|
400
437
|
|
|
@@ -2198,7 +2235,27 @@ function printDeliveryMapReport(report, json) {
|
|
|
2198
2235
|
async function executeDeliveryPathSearch(options) {
|
|
2199
2236
|
const fixture = options.fixture ? JSON.parse(readFileSync(options.fixture, "utf8")) : null;
|
|
2200
2237
|
const enforcement = fixture?.input?.enforcement ?? enforcementForSurface(options.surface);
|
|
2201
|
-
const
|
|
2238
|
+
const fixtureGeneration = fixture?.generator_response;
|
|
2239
|
+
const generationEnabled = Boolean(fixtureGeneration || options.generateCandidates);
|
|
2240
|
+
const baseInput = fixture?.input ?? searchInputFromControl(options.dir, {
|
|
2241
|
+
enforcement,
|
|
2242
|
+
generation: generationEnabled ? {
|
|
2243
|
+
enabled: true,
|
|
2244
|
+
maxProposals: options.maxGeneratedCandidates,
|
|
2245
|
+
maxDurationMs: options.generationTimeoutMs,
|
|
2246
|
+
maxCostUnits: options.generationCostUnits,
|
|
2247
|
+
} : undefined,
|
|
2248
|
+
});
|
|
2249
|
+
const input = generationEnabled && !baseInput.generation ? {
|
|
2250
|
+
...baseInput,
|
|
2251
|
+
generation: {
|
|
2252
|
+
enabled: true,
|
|
2253
|
+
max_calls: 1,
|
|
2254
|
+
max_proposals: options.maxGeneratedCandidates,
|
|
2255
|
+
max_duration_ms: options.generationTimeoutMs,
|
|
2256
|
+
max_cost_units: options.generationCostUnits,
|
|
2257
|
+
},
|
|
2258
|
+
} : baseInput;
|
|
2202
2259
|
const evaluator = fixture
|
|
2203
2260
|
? fixtureEvaluator(fixture.evaluations ?? {})
|
|
2204
2261
|
: options.surface === "codex"
|
|
@@ -2209,7 +2266,17 @@ async function executeDeliveryPathSearch(options) {
|
|
|
2209
2266
|
if (!evaluator) {
|
|
2210
2267
|
throw new Error(`${options.surface} has no executable evaluator in this release. Codex and Claude are the reference adapters; --fixture is available for deterministic contract testing.`);
|
|
2211
2268
|
}
|
|
2212
|
-
const
|
|
2269
|
+
const generator = fixtureGeneration
|
|
2270
|
+
? fixtureGenerator(fixtureGeneration)
|
|
2271
|
+
: options.generateCandidates && options.surface === "codex"
|
|
2272
|
+
? codexGenerator({ cwd: options.dir, model: options.generatorModel, timeoutMs: options.generationTimeoutMs })
|
|
2273
|
+
: options.generateCandidates && options.surface === "claude"
|
|
2274
|
+
? claudeGenerator({ cwd: options.dir, model: options.generatorModel, timeoutMs: options.generationTimeoutMs })
|
|
2275
|
+
: null;
|
|
2276
|
+
if (options.generateCandidates && !generator) {
|
|
2277
|
+
throw new Error(`${options.surface} has no executable candidate generator; Codex and Claude are tool-enforced reference transports.`);
|
|
2278
|
+
}
|
|
2279
|
+
const result = await runDeliveryPathSearch(input, evaluator, { candidates: fixture?.candidates, generator });
|
|
2213
2280
|
if (options.persist) result.persistence = persistSearchResult(options.dir, result);
|
|
2214
2281
|
if (options.json) {
|
|
2215
2282
|
console.log(JSON.stringify(result, null, 2));
|
|
@@ -2220,6 +2287,9 @@ async function executeDeliveryPathSearch(options) {
|
|
|
2220
2287
|
console.log(`Enforcement: ${result.enforcement.level}`);
|
|
2221
2288
|
console.log(`Recommendation: ${result.recommendation?.action ?? "none"}`);
|
|
2222
2289
|
console.log(`Evaluations: ${result.budgets.evaluations}`);
|
|
2290
|
+
console.log(`Generation: ${result.generation.status} (${result.generation.accepted}/${result.generation.returned} accepted)`);
|
|
2291
|
+
console.log(`Generation budget: ${result.generation.cost_units} cost units, ${result.generation.duration_ms} ms`);
|
|
2292
|
+
if (result.generation.failure_code) console.log(`Generation failure: ${result.generation.failure_code}`);
|
|
2223
2293
|
console.log(`Stopping reason: ${result.stopping_reason}`);
|
|
2224
2294
|
console.log(result.next_gate_action);
|
|
2225
2295
|
return result;
|
|
@@ -80,5 +80,6 @@ npx --yes @agdf/cli@latest gate-check --json
|
|
|
80
80
|
- `SOT_REGISTRY.md` decides which document owns which domain.
|
|
81
81
|
- `CONTEXT_GRAPH.md` records durable project knowledge only when it has evidence and an exit criterion.
|
|
82
82
|
- `AGENT_QUALITY_CONTRACTS.json` names reusable block, revise and warning conditions.
|
|
83
|
+
- `AGDF_RUN.md` can be edited concurrently from different machines or sessions. Give it a `.gitattributes` entry (`.agdf/control/AGDF_RUN.md merge=union`, git's built-in union driver — no local `git config` registration needed, unlike a custom named driver) so concurrent edits merge automatically instead of blocking. Always re-run `doctor`/`gate-check` and visually skim the merged file after a merge or pull that could have touched it: a union merge on conflicting lines (e.g. two different `current_gate` values) keeps both lines rather than erroring, and `doctor` reads only the first match per field, so it will not by itself flag that duplication — it only catches missing or structurally malformed fields.
|
|
83
84
|
|
|
84
85
|
Do not duplicate full product documentation in this scaffold. Link to the authoritative artefact instead.
|
|
@@ -37,6 +37,17 @@ Skip for routine questions, obvious local fixes and approved implementation with
|
|
|
37
37
|
npx --yes @agdf/cli@latest delivery-path-search --surface <surface> --json
|
|
38
38
|
```
|
|
39
39
|
|
|
40
|
+
Optional AI-native candidate generation is explicit:
|
|
41
|
+
|
|
42
|
+
```bash
|
|
43
|
+
npx --yes @agdf/cli@latest delivery-path-search \
|
|
44
|
+
--surface codex \
|
|
45
|
+
--generate-candidates \
|
|
46
|
+
--json
|
|
47
|
+
```
|
|
48
|
+
|
|
49
|
+
It supplements the deterministic baseline with at most one bounded generator call. Treat proposals as untrusted until the canonical core validates schema, gate action, scope, duplicates and material diversity. Report generation provenance, budgets, rejections and failure. Never hide deterministic fallback or switch providers automatically.
|
|
50
|
+
|
|
40
51
|
5. Treat facts, repository evidence, assumptions and model judgements separately.
|
|
41
52
|
6. Return exactly one recommendation or `no_safe_recommendation`.
|
|
42
53
|
7. Run canonical AGDF gate-check after search. Never translate a recommendation into permission.
|
|
@@ -73,3 +84,6 @@ Persist only the redacted decision summary when durable evidence is required. Do
|
|
|
73
84
|
- Do not invent default scores for invalid evaluator output.
|
|
74
85
|
- Do not implement, approve or release based on search output.
|
|
75
86
|
- Do not create agent-specific scoring, gate logic or skill copies.
|
|
87
|
+
- Do not replace deterministic candidates with generated proposals.
|
|
88
|
+
- Do not send secrets, full artefacts, source snapshots, raw prompts or hidden reasoning to a generator.
|
|
89
|
+
- Do not claim executable generation for instruction-only surfaces.
|
|
@@ -27,6 +27,25 @@ Use this compact output shape when no formal gate artefact is required:
|
|
|
27
27
|
|
|
28
28
|
Do not add a separate `Quality outlook` line for pure Quick Tasks unless the task became a relevant run.
|
|
29
29
|
|
|
30
|
+
### Non-Normative Trivial Change Boundary
|
|
31
|
+
|
|
32
|
+
A `quick_task` whose entire diff stays fully outside all of the following paths may close using only
|
|
33
|
+
the compact output shape above, and must not create, rewrite or expand any of `AGDF_RUN.md`'s core
|
|
34
|
+
sections (Run Meta, Objective, Current Control State, Source And Scope State, Run Status Card,
|
|
35
|
+
Approvals, Artefacts, Mode/Slice Decision, Artefact Chain, Evidence, Missing Evidence, Risks, Context
|
|
36
|
+
Graph Impact, Knowledge Persistence Decision, Closeout):
|
|
37
|
+
|
|
38
|
+
- `plugin/skills/**`
|
|
39
|
+
- `plugin/control/templates/**`
|
|
40
|
+
- `plugin/meta/**`
|
|
41
|
+
- `create-agdf/lib/**`
|
|
42
|
+
- `create-agdf/bin/**`
|
|
43
|
+
- any other executable code file, in any language, anywhere in the repository
|
|
44
|
+
|
|
45
|
+
A `MASTER_BACKLOG.md` entry is required only when the change is otherwise a "Relevant Run" below. A
|
|
46
|
+
change that is not clearly and fully outside every listed path fails closed to the existing, unchanged
|
|
47
|
+
ceremony — ambiguity is never read as permission for the lighter path.
|
|
48
|
+
|
|
30
49
|
## Run Status Card
|
|
31
50
|
|
|
32
51
|
When a run needs an operational status view, use the Run Status Card as a compact projection of existing control state.
|
|
@@ -72,6 +91,12 @@ Delivery Path Search is an optional read-only planning step for high-impact deci
|
|
|
72
91
|
- Search output is evidence only. Canonical `agdf-gate-check` independently decides what may proceed.
|
|
73
92
|
- The bounded first-release algorithm must not be labelled MCTS.
|
|
74
93
|
- Surface adapters may translate transport and presentation, but must not fork scoring, search or gate semantics.
|
|
94
|
+
- Optional AI-native candidate generation supplements the deterministic candidate baseline; it never replaces it.
|
|
95
|
+
- Generated proposals are untrusted. The core must validate schema, exact canonical gate action, scope, duplicates and material diversity before evaluation.
|
|
96
|
+
- Generation is opt-in and bounded to one call, five proposals, 30 seconds and five abstract cost units by default, within whole-run budgets.
|
|
97
|
+
- External generation receives only bounded normalized control summaries and references, never secrets, full artefacts, raw prompts, hidden reasoning or source snapshots.
|
|
98
|
+
- Generator status, provenance, accepted/rejected counts, separate budget use and typed failure must remain visible. Failure retains the deterministic baseline; automatic provider fallback is forbidden.
|
|
99
|
+
- Codex and Claude Code may provide tool-enforced generator transports. Copilot, OpenCode and generic surfaces remain instruction-only without conforming evidence.
|
|
75
100
|
|
|
76
101
|
The field names above are the stable machine-readable contract used by JSON
|
|
77
102
|
reports and automation. Human-facing Markdown must present the same projection
|
|
@@ -181,6 +206,11 @@ A relevant run is any run that changes durable state, creates or updates an AGDF
|
|
|
181
206
|
OR is not mandatory for a pure explanation, read-only inspection, small review, or local debugging step that produces no durable state change and no gate consequence.
|
|
182
207
|
When in doubt, use a short OR-lite only if it clarifies gate state, evidence, risk, or the next permissible step.
|
|
183
208
|
|
|
209
|
+
A `quick_task` fully inside the Non-Normative Trivial Change Boundary above stays exempt from the full
|
|
210
|
+
`AGDF_RUN.md` ceremony even when it is otherwise a relevant run. If `AGDF_RUN.md` currently reflects
|
|
211
|
+
another active run, append exactly one line to that run's `Prior Run Pointers` section noting what
|
|
212
|
+
changed and that it is unrelated; do not edit any other section or any other existing line.
|
|
213
|
+
|
|
184
214
|
## Gate Rules
|
|
185
215
|
|
|
186
216
|
- User gates: `UR -> PRD -> SD -> TP -> QA -> UAT`
|
|
@@ -27,6 +27,25 @@ Use this compact output shape when no formal gate artefact is required:
|
|
|
27
27
|
|
|
28
28
|
Do not add a separate `Quality outlook` line for pure Quick Tasks unless the task became a relevant run.
|
|
29
29
|
|
|
30
|
+
### Non-Normative Trivial Change Boundary
|
|
31
|
+
|
|
32
|
+
A `quick_task` whose entire diff stays fully outside all of the following paths may close using only
|
|
33
|
+
the compact output shape above, and must not create, rewrite or expand any of `AGDF_RUN.md`'s core
|
|
34
|
+
sections (Run Meta, Objective, Current Control State, Source And Scope State, Run Status Card,
|
|
35
|
+
Approvals, Artefacts, Mode/Slice Decision, Artefact Chain, Evidence, Missing Evidence, Risks, Context
|
|
36
|
+
Graph Impact, Knowledge Persistence Decision, Closeout):
|
|
37
|
+
|
|
38
|
+
- `plugin/skills/**`
|
|
39
|
+
- `plugin/control/templates/**`
|
|
40
|
+
- `plugin/meta/**`
|
|
41
|
+
- `create-agdf/lib/**`
|
|
42
|
+
- `create-agdf/bin/**`
|
|
43
|
+
- any other executable code file, in any language, anywhere in the repository
|
|
44
|
+
|
|
45
|
+
A `MASTER_BACKLOG.md` entry is required only when the change is otherwise a "Relevant Run" below. A
|
|
46
|
+
change that is not clearly and fully outside every listed path fails closed to the existing, unchanged
|
|
47
|
+
ceremony — ambiguity is never read as permission for the lighter path.
|
|
48
|
+
|
|
30
49
|
## Run Status Card
|
|
31
50
|
|
|
32
51
|
When a run needs an operational status view, use the Run Status Card as a compact projection of existing control state.
|
|
@@ -72,6 +91,12 @@ Delivery Path Search is an optional read-only planning step for high-impact deci
|
|
|
72
91
|
- Search output is evidence only. Canonical `agdf-gate-check` independently decides what may proceed.
|
|
73
92
|
- The bounded first-release algorithm must not be labelled MCTS.
|
|
74
93
|
- Surface adapters may translate transport and presentation, but must not fork scoring, search or gate semantics.
|
|
94
|
+
- Optional AI-native candidate generation supplements the deterministic candidate baseline; it never replaces it.
|
|
95
|
+
- Generated proposals are untrusted. The core must validate schema, exact canonical gate action, scope, duplicates and material diversity before evaluation.
|
|
96
|
+
- Generation is opt-in and bounded to one call, five proposals, 30 seconds and five abstract cost units by default, within whole-run budgets.
|
|
97
|
+
- External generation receives only bounded normalized control summaries and references, never secrets, full artefacts, raw prompts, hidden reasoning or source snapshots.
|
|
98
|
+
- Generator status, provenance, accepted/rejected counts, separate budget use and typed failure must remain visible. Failure retains the deterministic baseline; automatic provider fallback is forbidden.
|
|
99
|
+
- Codex and Claude Code may provide tool-enforced generator transports. Copilot, OpenCode and generic surfaces remain instruction-only without conforming evidence.
|
|
75
100
|
|
|
76
101
|
The field names above are the stable machine-readable contract used by JSON
|
|
77
102
|
reports and automation. Human-facing Markdown must present the same projection
|
|
@@ -181,6 +206,11 @@ A relevant run is any run that changes durable state, creates or updates an AGDF
|
|
|
181
206
|
OR is not mandatory for a pure explanation, read-only inspection, small review, or local debugging step that produces no durable state change and no gate consequence.
|
|
182
207
|
When in doubt, use a short OR-lite only if it clarifies gate state, evidence, risk, or the next permissible step.
|
|
183
208
|
|
|
209
|
+
A `quick_task` fully inside the Non-Normative Trivial Change Boundary above stays exempt from the full
|
|
210
|
+
`AGDF_RUN.md` ceremony even when it is otherwise a relevant run. If `AGDF_RUN.md` currently reflects
|
|
211
|
+
another active run, append exactly one line to that run's `Prior Run Pointers` section noting what
|
|
212
|
+
changed and that it is unrelated; do not edit any other section or any other existing line.
|
|
213
|
+
|
|
184
214
|
## Gate Rules
|
|
185
215
|
|
|
186
216
|
- User gates: `UR -> PRD -> SD -> TP -> QA -> UAT`
|
|
@@ -37,6 +37,17 @@ Skip for routine questions, obvious local fixes and approved implementation with
|
|
|
37
37
|
npx --yes @agdf/cli@latest delivery-path-search --surface <surface> --json
|
|
38
38
|
```
|
|
39
39
|
|
|
40
|
+
Optional AI-native candidate generation is explicit:
|
|
41
|
+
|
|
42
|
+
```bash
|
|
43
|
+
npx --yes @agdf/cli@latest delivery-path-search \
|
|
44
|
+
--surface codex \
|
|
45
|
+
--generate-candidates \
|
|
46
|
+
--json
|
|
47
|
+
```
|
|
48
|
+
|
|
49
|
+
It supplements the deterministic baseline with at most one bounded generator call. Treat proposals as untrusted until the canonical core validates schema, gate action, scope, duplicates and material diversity. Report generation provenance, budgets, rejections and failure. Never hide deterministic fallback or switch providers automatically.
|
|
50
|
+
|
|
40
51
|
5. Treat facts, repository evidence, assumptions and model judgements separately.
|
|
41
52
|
6. Return exactly one recommendation or `no_safe_recommendation`.
|
|
42
53
|
7. Run canonical AGDF gate-check after search. Never translate a recommendation into permission.
|
|
@@ -73,4 +84,7 @@ Persist only the redacted decision summary when durable evidence is required. Do
|
|
|
73
84
|
- Do not invent default scores for invalid evaluator output.
|
|
74
85
|
- Do not implement, approve or release based on search output.
|
|
75
86
|
- Do not create agent-specific scoring, gate logic or skill copies.
|
|
87
|
+
- Do not replace deterministic candidates with generated proposals.
|
|
88
|
+
- Do not send secrets, full artefacts, source snapshots, raw prompts or hidden reasoning to a generator.
|
|
89
|
+
- Do not claim executable generation for instruction-only surfaces.
|
|
76
90
|
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "agdf",
|
|
3
|
-
"version": "0.
|
|
4
|
-
"description": "Codex-first
|
|
3
|
+
"version": "0.5.0",
|
|
4
|
+
"description": "Codex-first operating system for governed AI-assisted delivery.",
|
|
5
5
|
"author": {
|
|
6
6
|
"name": "Arndt Gold",
|
|
7
7
|
"url": "https://agdf.iself.eu"
|
|
@@ -20,9 +20,9 @@
|
|
|
20
20
|
"hooks": "./hooks/hooks.json",
|
|
21
21
|
"interface": {
|
|
22
22
|
"displayName": "AI Governance & Delivery Framework",
|
|
23
|
-
"shortDescription": "Codex-first
|
|
24
|
-
"longDescription": "AI Governance & Delivery Framework (AGDF)
|
|
25
|
-
"developerName": "
|
|
23
|
+
"shortDescription": "Codex-first operating system for governed AI-assisted delivery.",
|
|
24
|
+
"longDescription": "AI Governance & Delivery Framework (AGDF) brings an operating system for governed AI-assisted delivery to Codex, combining workflow skills, control templates and machine-readable repository checks for gate decisions, Brownfield analysis, task-plan review, QA decisions, durable run state and auditable delivery closeout.",
|
|
25
|
+
"developerName": "Arndt Gold",
|
|
26
26
|
"category": "Productivity",
|
|
27
27
|
"capabilities": [
|
|
28
28
|
"Read",
|
|
@@ -32,10 +32,9 @@
|
|
|
32
32
|
"composerIcon": "./assets/agdf-icon.svg",
|
|
33
33
|
"logo": "./assets/agdf-logo.svg",
|
|
34
34
|
"defaultPrompt": [
|
|
35
|
-
"
|
|
36
|
-
"Create
|
|
37
|
-
"
|
|
38
|
-
"Close this run with an AGDF orchestration report."
|
|
35
|
+
"Start this request under AGDF governance.",
|
|
36
|
+
"Create durable AGDF control state for this repository.",
|
|
37
|
+
"Close this delivery run with an auditable AGDF report."
|
|
39
38
|
],
|
|
40
39
|
"brandColor": "#14B8A6"
|
|
41
40
|
}
|
|
@@ -0,0 +1,201 @@
|
|
|
1
|
+
Apache License
|
|
2
|
+
Version 2.0, January 2004
|
|
3
|
+
http://www.apache.org/licenses/
|
|
4
|
+
|
|
5
|
+
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
|
6
|
+
|
|
7
|
+
1. Definitions.
|
|
8
|
+
|
|
9
|
+
"License" shall mean the terms and conditions for use, reproduction,
|
|
10
|
+
and distribution as defined by Sections 1 through 9 of this document.
|
|
11
|
+
|
|
12
|
+
"Licensor" shall mean the copyright owner or entity authorized by
|
|
13
|
+
the copyright owner that is granting the License.
|
|
14
|
+
|
|
15
|
+
"Legal Entity" shall mean the union of the acting entity and all
|
|
16
|
+
other entities that control, are controlled by, or are under common
|
|
17
|
+
control with that entity. For the purposes of this definition,
|
|
18
|
+
"control" means (i) the power, direct or indirect, to cause the
|
|
19
|
+
direction or management of such entity, whether by contract or
|
|
20
|
+
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
|
21
|
+
outstanding shares, or (iii) beneficial ownership of such entity.
|
|
22
|
+
|
|
23
|
+
"You" (or "Your") shall mean an individual or Legal Entity
|
|
24
|
+
exercising permissions granted by this License.
|
|
25
|
+
|
|
26
|
+
"Source" form shall mean the preferred form for making modifications,
|
|
27
|
+
including but not limited to software source code, documentation
|
|
28
|
+
source, and configuration files.
|
|
29
|
+
|
|
30
|
+
"Object" form shall mean any form resulting from mechanical
|
|
31
|
+
transformation or translation of a Source form, including but
|
|
32
|
+
not limited to compiled object code, generated documentation,
|
|
33
|
+
and conversions to other media types.
|
|
34
|
+
|
|
35
|
+
"Work" shall mean the work of authorship, whether in Source or
|
|
36
|
+
Object form, made available under the License, as indicated by a
|
|
37
|
+
copyright notice that is included in or attached to the work
|
|
38
|
+
(an example is provided in the Appendix below).
|
|
39
|
+
|
|
40
|
+
"Derivative Works" shall mean any work, whether in Source or Object
|
|
41
|
+
form, that is based on (or derived from) the Work and for which the
|
|
42
|
+
editorial revisions, annotations, elaborations, or other modifications
|
|
43
|
+
represent, as a whole, an original work of authorship. For the purposes
|
|
44
|
+
of this License, Derivative Works shall not include works that remain
|
|
45
|
+
separable from, or merely link (or bind by name) to the interfaces of,
|
|
46
|
+
the Work and Derivative Works thereof.
|
|
47
|
+
|
|
48
|
+
"Contribution" shall mean any work of authorship, including
|
|
49
|
+
the original version of the Work and any modifications or additions
|
|
50
|
+
to that Work or Derivative Works thereof, that is intentionally
|
|
51
|
+
submitted to Licensor for inclusion in the Work by the copyright owner
|
|
52
|
+
or by an individual or Legal Entity authorized to submit on behalf of
|
|
53
|
+
the copyright owner. For the purposes of this definition, "submitted"
|
|
54
|
+
means any form of electronic, verbal, or written communication sent
|
|
55
|
+
to the Licensor or its representatives, including but not limited to
|
|
56
|
+
communication on electronic mailing lists, source code control systems,
|
|
57
|
+
and issue tracking systems that are managed by, or on behalf of, the
|
|
58
|
+
Licensor for the purpose of discussing and improving the Work, but
|
|
59
|
+
excluding communication that is conspicuously marked or otherwise
|
|
60
|
+
designated in writing by the copyright owner as "Not a Contribution."
|
|
61
|
+
|
|
62
|
+
"Contributor" shall mean Licensor and any individual or Legal Entity
|
|
63
|
+
on behalf of whom a Contribution has been received by Licensor and
|
|
64
|
+
subsequently incorporated within the Work.
|
|
65
|
+
|
|
66
|
+
2. Grant of Copyright License. Subject to the terms and conditions of
|
|
67
|
+
this License, each Contributor hereby grants to You a perpetual,
|
|
68
|
+
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
|
69
|
+
copyright license to reproduce, prepare Derivative Works of,
|
|
70
|
+
publicly display, publicly perform, sublicense, and distribute the
|
|
71
|
+
Work and such Derivative Works in Source or Object form.
|
|
72
|
+
|
|
73
|
+
3. Grant of Patent License. Subject to the terms and conditions of
|
|
74
|
+
this License, each Contributor hereby grants to You a perpetual,
|
|
75
|
+
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
|
76
|
+
(except as stated in this section) patent license to make, have made,
|
|
77
|
+
use, offer to sell, sell, import, and otherwise transfer the Work,
|
|
78
|
+
where such license applies only to those patent claims licensable
|
|
79
|
+
by such Contributor that are necessarily infringed by their
|
|
80
|
+
Contribution(s) alone or by combination of their Contribution(s)
|
|
81
|
+
with the Work to which such Contribution(s) was submitted. If You
|
|
82
|
+
institute patent litigation against any entity (including a
|
|
83
|
+
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
|
84
|
+
or a Contribution incorporated within the Work constitutes direct
|
|
85
|
+
or contributory patent infringement, then any patent licenses
|
|
86
|
+
granted to You under this License for that Work shall terminate
|
|
87
|
+
as of the date such litigation is filed.
|
|
88
|
+
|
|
89
|
+
4. Redistribution. You may reproduce and distribute copies of the
|
|
90
|
+
Work or Derivative Works thereof in any medium, with or without
|
|
91
|
+
modifications, and in Source or Object form, provided that You
|
|
92
|
+
meet the following conditions:
|
|
93
|
+
|
|
94
|
+
(a) You must give any other recipients of the Work or
|
|
95
|
+
Derivative Works a copy of this License; and
|
|
96
|
+
|
|
97
|
+
(b) You must cause any modified files to carry prominent notices
|
|
98
|
+
stating that You changed the files; and
|
|
99
|
+
|
|
100
|
+
(c) You must retain, in the Source form of any Derivative Works
|
|
101
|
+
that You distribute, all copyright, patent, trademark, and
|
|
102
|
+
attribution notices from the Source form of the Work,
|
|
103
|
+
excluding those notices that do not pertain to any part of
|
|
104
|
+
the Derivative Works; and
|
|
105
|
+
|
|
106
|
+
(d) If the Work includes a "NOTICE" text file as part of its
|
|
107
|
+
distribution, then any Derivative Works that You distribute must
|
|
108
|
+
include a readable copy of the attribution notices contained
|
|
109
|
+
within such NOTICE file, excluding those notices that do not
|
|
110
|
+
pertain to any part of the Derivative Works, in at least one
|
|
111
|
+
of the following places: within a NOTICE text file distributed
|
|
112
|
+
as part of the Derivative Works; within the Source form or
|
|
113
|
+
documentation, if provided along with the Derivative Works; or,
|
|
114
|
+
within a display generated by the Derivative Works, if and
|
|
115
|
+
wherever such third-party notices normally appear. The contents
|
|
116
|
+
of the NOTICE file are for informational purposes only and
|
|
117
|
+
do not modify the License. You may add Your own attribution
|
|
118
|
+
notices within Derivative Works that You distribute, alongside
|
|
119
|
+
or as an addendum to the NOTICE text from the Work, provided
|
|
120
|
+
that such additional attribution notices cannot be construed
|
|
121
|
+
as modifying the License.
|
|
122
|
+
|
|
123
|
+
You may add Your own copyright statement to Your modifications and
|
|
124
|
+
may provide additional or different license terms and conditions
|
|
125
|
+
for use, reproduction, or distribution of Your modifications, or
|
|
126
|
+
for any such Derivative Works as a whole, provided Your use,
|
|
127
|
+
reproduction, and distribution of the Work otherwise complies with
|
|
128
|
+
the conditions stated in this License.
|
|
129
|
+
|
|
130
|
+
5. Submission of Contributions. Unless You explicitly state otherwise,
|
|
131
|
+
any Contribution intentionally submitted for inclusion in the Work
|
|
132
|
+
by You to the Licensor shall be under the terms and conditions of
|
|
133
|
+
this License, without any additional terms or conditions.
|
|
134
|
+
Notwithstanding the above, nothing herein shall supersede or modify
|
|
135
|
+
the terms of any separate license agreement you may have executed
|
|
136
|
+
with Licensor regarding such Contributions.
|
|
137
|
+
|
|
138
|
+
6. Trademarks. This License does not grant permission to use the trade
|
|
139
|
+
names, trademarks, service marks, or product names of the Licensor,
|
|
140
|
+
except as required for reasonable and customary use in describing the
|
|
141
|
+
origin of the Work and reproducing the content of the NOTICE file.
|
|
142
|
+
|
|
143
|
+
7. Disclaimer of Warranty. Unless required by applicable law or
|
|
144
|
+
agreed to in writing, Licensor provides the Work (and each
|
|
145
|
+
Contributor provides its Contributions) on an "AS IS" BASIS,
|
|
146
|
+
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
|
147
|
+
implied, including, without limitation, any warranties or conditions
|
|
148
|
+
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
|
149
|
+
PARTICULAR PURPOSE. You are solely responsible for determining the
|
|
150
|
+
appropriateness of using or redistributing the Work and assume any
|
|
151
|
+
risks associated with Your exercise of permissions under this License.
|
|
152
|
+
|
|
153
|
+
8. Limitation of Liability. In no event and under no legal theory,
|
|
154
|
+
whether in tort (including negligence), contract, or otherwise,
|
|
155
|
+
unless required by applicable law (such as deliberate and grossly
|
|
156
|
+
negligent acts) or agreed to in writing, shall any Contributor be
|
|
157
|
+
liable to You for damages, including any direct, indirect, special,
|
|
158
|
+
incidental, or consequential damages of any character arising as a
|
|
159
|
+
result of this License or out of the use or inability to use the
|
|
160
|
+
Work (including but not limited to damages for loss of goodwill,
|
|
161
|
+
work stoppage, computer failure or malfunction, or any and all
|
|
162
|
+
other commercial damages or losses), even if such Contributor
|
|
163
|
+
has been advised of the possibility of such damages.
|
|
164
|
+
|
|
165
|
+
9. Accepting Warranty or Additional Liability. While redistributing
|
|
166
|
+
the Work or Derivative Works thereof, You may choose to offer,
|
|
167
|
+
and charge a fee for, acceptance of support, warranty, indemnity,
|
|
168
|
+
or other liability obligations and/or rights consistent with this
|
|
169
|
+
License. However, in accepting such obligations, You may act only
|
|
170
|
+
on Your own behalf and on Your sole responsibility, not on behalf
|
|
171
|
+
of any other Contributor, and only if You agree to indemnify,
|
|
172
|
+
defend, and hold each Contributor harmless for any liability
|
|
173
|
+
incurred by, or claims asserted against, such Contributor by reason
|
|
174
|
+
of your accepting any such warranty or additional liability.
|
|
175
|
+
|
|
176
|
+
END OF TERMS AND CONDITIONS
|
|
177
|
+
|
|
178
|
+
APPENDIX: How to apply the Apache License to your work.
|
|
179
|
+
|
|
180
|
+
To apply the Apache License to your work, attach the following
|
|
181
|
+
boilerplate notice, with the fields enclosed by brackets "[]"
|
|
182
|
+
replaced with your own identifying information. (Don't include
|
|
183
|
+
the brackets!) The text should be enclosed in the appropriate
|
|
184
|
+
comment syntax for the file format. We also recommend that a
|
|
185
|
+
file or class name and description of purpose be included on the
|
|
186
|
+
same "printed page" as the copyright notice for easier
|
|
187
|
+
identification within third-party archives.
|
|
188
|
+
|
|
189
|
+
Copyright [yyyy] [name of copyright owner]
|
|
190
|
+
|
|
191
|
+
Licensed under the Apache License, Version 2.0 (the "License");
|
|
192
|
+
you may not use this file except in compliance with the License.
|
|
193
|
+
You may obtain a copy of the License at
|
|
194
|
+
|
|
195
|
+
http://www.apache.org/licenses/LICENSE-2.0
|
|
196
|
+
|
|
197
|
+
Unless required by applicable law or agreed to in writing, software
|
|
198
|
+
distributed under the License is distributed on an "AS IS" BASIS,
|
|
199
|
+
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
200
|
+
See the License for the specific language governing permissions and
|
|
201
|
+
limitations under the License.
|
|
@@ -80,5 +80,6 @@ npx --yes @agdf/cli@latest gate-check --json
|
|
|
80
80
|
- `SOT_REGISTRY.md` decides which document owns which domain.
|
|
81
81
|
- `CONTEXT_GRAPH.md` records durable project knowledge only when it has evidence and an exit criterion.
|
|
82
82
|
- `AGENT_QUALITY_CONTRACTS.json` names reusable block, revise and warning conditions.
|
|
83
|
+
- `AGDF_RUN.md` can be edited concurrently from different machines or sessions. Give it a `.gitattributes` entry (`.agdf/control/AGDF_RUN.md merge=union`, git's built-in union driver — no local `git config` registration needed, unlike a custom named driver) so concurrent edits merge automatically instead of blocking. Always re-run `doctor`/`gate-check` and visually skim the merged file after a merge or pull that could have touched it: a union merge on conflicting lines (e.g. two different `current_gate` values) keeps both lines rather than erroring, and `doctor` reads only the first match per field, so it will not by itself flag that duplication — it only catches missing or structurally malformed fields.
|
|
83
84
|
|
|
84
85
|
Do not duplicate full product documentation in this scaffold. Link to the authoritative artefact instead.
|
|
@@ -1,13 +1,13 @@
|
|
|
1
1
|
{
|
|
2
2
|
"schemaVersion": 1,
|
|
3
3
|
"id": "agdf",
|
|
4
|
-
"version": "0.
|
|
4
|
+
"version": "0.5.0",
|
|
5
5
|
"displayName": "AI Governance & Delivery Framework",
|
|
6
|
-
"developerName": "
|
|
7
|
-
"description": "Codex-first
|
|
8
|
-
"claudeDescription": "
|
|
9
|
-
"shortDescription": "Codex-first
|
|
10
|
-
"longDescription": "AI Governance & Delivery Framework (AGDF)
|
|
6
|
+
"developerName": "Arndt Gold",
|
|
7
|
+
"description": "Codex-first operating system for governed AI-assisted delivery.",
|
|
8
|
+
"claudeDescription": "AI Governance & Delivery Framework (AGDF) brings an operating system for governed AI-assisted delivery to Claude Code, combining workflow skills, control templates and machine-readable repository checks for gate decisions, Brownfield analysis, task-plan review, QA decisions, durable run state and auditable closeout.",
|
|
9
|
+
"shortDescription": "Codex-first operating system for governed AI-assisted delivery.",
|
|
10
|
+
"longDescription": "AI Governance & Delivery Framework (AGDF) brings an operating system for governed AI-assisted delivery to Codex, combining workflow skills, control templates and machine-readable repository checks for gate decisions, Brownfield analysis, task-plan review, QA decisions, durable run state and auditable delivery closeout.",
|
|
11
11
|
"homepage": "https://agdf.iself.eu",
|
|
12
12
|
"repository": "https://github.com/arndtgold/ai-native-governance-delivery-framework",
|
|
13
13
|
"license": "Apache-2.0",
|
|
@@ -35,10 +35,9 @@
|
|
|
35
35
|
"Write"
|
|
36
36
|
],
|
|
37
37
|
"defaultPrompt": [
|
|
38
|
-
"
|
|
39
|
-
"Create
|
|
40
|
-
"
|
|
41
|
-
"Close this run with an AGDF orchestration report."
|
|
38
|
+
"Start this request under AGDF governance.",
|
|
39
|
+
"Create durable AGDF control state for this repository.",
|
|
40
|
+
"Close this delivery run with an auditable AGDF report."
|
|
42
41
|
],
|
|
43
42
|
"hooks": "hooks/hooks.json"
|
|
44
43
|
},
|