@digital-agora/friday 0.10.0 → 0.11.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 +3 -2
- package/bundles/friday-claude-0.1.0.zip +0 -0
- package/bundles/friday-opencode-0.1.0.zip +0 -0
- package/dist/adapters/claude/runtime.js +38 -2
- package/dist/adapters/claude/workflows.js +5 -0
- package/dist/adapters/drivers.js +8 -0
- package/dist/adapters/opencode/index.js +1 -1
- package/dist/adapters/skill.js +6 -3
- package/dist/graph.js +7 -2
- package/dist/reads.js +75 -0
- package/dist/validate.js +17 -0
- package/pack/orchestrations/feature-delivery.yaml +10 -0
- package/pack/orchestrations/prompt-delivery.yaml +12 -0
- package/package.json +1 -1
- package/schemas/orchestration.schema.yaml +10 -0
package/README.md
CHANGED
|
@@ -247,7 +247,7 @@ friday list [--with spec]... agents (with models) and workflows
|
|
|
247
247
|
friday validate [--with spec]... schemas + cross-references + sources + model policy + test pyramid
|
|
248
248
|
friday build [-t target] [-o dir] [--with spec]... unpacked bundles
|
|
249
249
|
friday bundle [-t target] [-o dir] [--with spec]... friday-<target>-<version>.zip
|
|
250
|
-
friday graph [orchestration] [--with spec]... steps, routes, loops and every way a run can end (Mermaid + table)
|
|
250
|
+
friday graph [orchestration] [--with spec]... steps, routes, loops, what each step reads and every way a run can end (Mermaid + table)
|
|
251
251
|
friday handoff render <file> write the readable handoff.md next to handoff.yaml
|
|
252
252
|
friday handoff check <file> [--pending]
|
|
253
253
|
```
|
|
@@ -294,4 +294,5 @@ model policy and test pyramid, all generic), `specializations/` (platform and pr
|
|
|
294
294
|
such as Google Cloud's and Hybrid-Day's, each its own package), `src/` (loader, validator, IR,
|
|
295
295
|
`src/adapters/<target>/`, bundle, install, CLI), `test/` (vitest, including a harness that runs
|
|
296
296
|
the generated workflow scripts with mocked agents). See `CLAUDE.md` for the rules and
|
|
297
|
-
`docs/decisions.md` for why things are the way they are
|
|
297
|
+
`docs/decisions.md` for why things are the way they are, and
|
|
298
|
+
`docs/how-friday-fits-together.md` for how the parts fit together as a pattern for other tools.
|
|
Binary file
|
|
Binary file
|
|
@@ -154,12 +154,48 @@ function context(stepId, item) {
|
|
|
154
154
|
if (HANDOFF && HANDOFF.deliveryPolicy) {
|
|
155
155
|
parts.push("Standing delivery policy (what delivery may settle itself; record each such decision in your summary, never product, copy or security-widening):\n" + JSON.stringify(HANDOFF.deliveryPolicy));
|
|
156
156
|
}
|
|
157
|
-
const earlier =
|
|
158
|
-
if (earlier.length) parts.push("Results of earlier steps:\n" + JSON.stringify(
|
|
157
|
+
const earlier = visibleOutputs(stepId, item);
|
|
158
|
+
if (Object.keys(earlier).length) parts.push("Results of earlier steps:\n" + JSON.stringify(earlier));
|
|
159
159
|
if (item) parts.push("Current item:\n" + JSON.stringify(item));
|
|
160
160
|
return parts.join("\n\n");
|
|
161
161
|
}
|
|
162
162
|
|
|
163
|
+
// The results of earlier steps one agent call sees (decision 55; the rules are in src/reads.ts).
|
|
164
|
+
// A result key is <stepId>[.<part>][:<itemId>]. A step's own results are always visible; with
|
|
165
|
+
// reads, only the steps it names besides its own loop. A result of the step's own loop is given
|
|
166
|
+
// for the current item whole, for the items it depends on summarized, and not for other items; any
|
|
167
|
+
// other per-item result is summarized (SUMMARY_DROPS left out).
|
|
168
|
+
function keyStep(k) { return k.split(/[.:]/)[0]; }
|
|
169
|
+
function keyItem(k) { const i = k.indexOf(":"); return i < 0 ? null : k.slice(i + 1); }
|
|
170
|
+
function summarized(v) {
|
|
171
|
+
if (Array.isArray(v)) return v.map(summarized);
|
|
172
|
+
if (!v || typeof v !== "object") return v;
|
|
173
|
+
const o = {};
|
|
174
|
+
Object.keys(v).forEach(function (k) { if (SUMMARY_DROPS.indexOf(k) < 0) o[k] = summarized(v[k]); });
|
|
175
|
+
return o;
|
|
176
|
+
}
|
|
177
|
+
function visibleOutputs(stepId, item) {
|
|
178
|
+
const base = keyStep(stepId);
|
|
179
|
+
const reads = READS[base] || null;
|
|
180
|
+
const loop = LOOPS[base] || null;
|
|
181
|
+
const deps = (item && item.dependsOn) || [];
|
|
182
|
+
const out = {};
|
|
183
|
+
Object.keys(state.outputs).forEach(function (k) {
|
|
184
|
+
const s = keyStep(k);
|
|
185
|
+
const it = keyItem(k);
|
|
186
|
+
const own = !!loop && LOOPS[s] === loop;
|
|
187
|
+
if (!own && s !== base && reads && reads.indexOf(s) < 0) return;
|
|
188
|
+
if (it === null) { out[k] = state.outputs[k]; return; }
|
|
189
|
+
if (own && item && item.id) {
|
|
190
|
+
if (it === item.id) out[k] = state.outputs[k];
|
|
191
|
+
else if (deps.indexOf(it) >= 0) out[k] = summarized(state.outputs[k]);
|
|
192
|
+
return;
|
|
193
|
+
}
|
|
194
|
+
out[k] = summarized(state.outputs[k]);
|
|
195
|
+
});
|
|
196
|
+
return out;
|
|
197
|
+
}
|
|
198
|
+
|
|
163
199
|
// Per-repo command map: level id -> commands, from args.commands or the handoff's commands.
|
|
164
200
|
// The pack's commands are only the default; an npm repo with test:architecture maps its own.
|
|
165
201
|
const COMMANDS = Object.assign({}, (HANDOFF && HANDOFF.commands) || {}, A.commands || {});
|
|
@@ -1,6 +1,7 @@
|
|
|
1
1
|
import { FIELD_GUIDES, LEAN_SCHEMAS } from "../../step-schemas.js";
|
|
2
2
|
import * as P from "../../prompts.js";
|
|
3
3
|
import { RUNTIME } from "./runtime.js";
|
|
4
|
+
import { SUMMARY_DROPS, loopMap, readsMap } from "../../reads.js";
|
|
4
5
|
const j = (v) => JSON.stringify(v);
|
|
5
6
|
function refLit(r) {
|
|
6
7
|
return j(r);
|
|
@@ -310,6 +311,10 @@ export function compileClaudeWorkflow(w, ir) {
|
|
|
310
311
|
`const BOOTSTRAPPED = ${j(P.BOOTSTRAPPED)};`,
|
|
311
312
|
`const DECIDER = ${j(w.stream === "downstream" ? { persona: "lead-developer", taskKind: "decide" } : null)};`,
|
|
312
313
|
`const LOOP_LEVELS = ${j(ir.pack.testPyramid?.loopLevels ?? [])};`,
|
|
314
|
+
// What each step's agents read from earlier steps (decision 55).
|
|
315
|
+
`const READS = ${j(readsMap(w))};`,
|
|
316
|
+
`const LOOPS = ${j(loopMap(w))};`,
|
|
317
|
+
`const SUMMARY_DROPS = ${j(SUMMARY_DROPS)};`,
|
|
313
318
|
RUNTIME,
|
|
314
319
|
...ctx.fns,
|
|
315
320
|
"",
|
package/dist/adapters/drivers.js
CHANGED
|
@@ -1,4 +1,5 @@
|
|
|
1
1
|
import { loopExits } from "../graph.js";
|
|
2
|
+
import { readsText } from "../reads.js";
|
|
2
3
|
export const CLI = "npx -y @digital-agora/friday";
|
|
3
4
|
function who(ref, ir) {
|
|
4
5
|
const kinds = ref.taskKind === "{{task.taskKind}}" ? (ref.allowedTaskKinds ?? []) : [ref.taskKind];
|
|
@@ -87,6 +88,13 @@ function planLines(steps, ir, depth) {
|
|
|
87
88
|
out.push(`${n} **${s.id}** (gate, up to ${s.maxLoops} fix loops) - ${ref(s)}: ${s.prompt}${s.onFail ? ` On fail, ${ref(s.onFail)} fixes the findings and the gate runs again.` : ""}${when}`, exitsLine(pad, s, down(s)));
|
|
88
89
|
break;
|
|
89
90
|
}
|
|
91
|
+
// What the step's agents are given from earlier steps (decision 55).
|
|
92
|
+
if (s.reads && out[start]) {
|
|
93
|
+
if (out[start].endsWith(":"))
|
|
94
|
+
out.splice(start + 1, 0, `${pad} - reads: ${readsText(s)}`);
|
|
95
|
+
else
|
|
96
|
+
out[start] += ` ${readsText(s)}`;
|
|
97
|
+
}
|
|
90
98
|
if (s.checkpoint && s.type !== "approval" && out[start]) {
|
|
91
99
|
out[start] += ` Builds checkpoint \`${s.checkpoint}\`: a person approves it before the next step reads it.`;
|
|
92
100
|
}
|
|
@@ -144,7 +144,7 @@ function orchestrator(w, ir) {
|
|
|
144
144
|
const persona = ir.agentIndex[w.orchestrator] ?? {};
|
|
145
145
|
const kind = persona.decide ? "decide" : (Object.keys(persona)[0] ?? "decide");
|
|
146
146
|
const up = w.stream === "upstream";
|
|
147
|
-
const run = "Execute the step plan above yourself, in order, delegating every step to the named subagent with the task tool. Give each subagent the work id, the request or the handoff, every answer, every resolved gap and the results of earlier steps, and tell it which JSON shape to return (below). Steps marked parallel or in one wave may be delegated at the same time. Never do a step's work yourself and never use a different subagent or model than the plan names";
|
|
147
|
+
const run = "Execute the step plan above yourself, in order, delegating every step to the named subagent with the task tool. Give each subagent the work id, the request or the handoff, every answer, every resolved gap and the results of earlier steps (only the steps a plan step says it reads, when it says so; for a task, its own results whole, its dependencies' summarized without raw output, evidence or failures, and no other task's: decision 55), and tell it which JSON shape to return (below). Steps marked parallel or in one wave may be delegated at the same time. Never do a step's work yourself and never use a different subagent or model than the plan names";
|
|
148
148
|
const ask = "the question tool (one question per call, as many calls as needed)";
|
|
149
149
|
const driver = up
|
|
150
150
|
? upstreamDriver(w, { run, ask }, ir.pack.id)
|
package/dist/adapters/skill.js
CHANGED
|
@@ -154,7 +154,7 @@ function runSection(w, t, ir) {
|
|
|
154
154
|
...(w.steps.some((s) => s.type === "approval" && s.level)
|
|
155
155
|
? ["Approved prompt pyramid levels (build only from these; never change one): <level -> approving role>"]
|
|
156
156
|
: []),
|
|
157
|
-
"Results of earlier steps: <step id -> its result>",
|
|
157
|
+
"Results of earlier steps: <step id -> its result, as section 3 scopes them>",
|
|
158
158
|
]
|
|
159
159
|
: [
|
|
160
160
|
`Workflow ${w.id} (downstream), step <step id>.`,
|
|
@@ -162,7 +162,7 @@ function runSection(w, t, ir) {
|
|
|
162
162
|
? "Approved handoff (the only source of truth; anything it does not settle is a blocker, not a guess):"
|
|
163
163
|
: "Run arguments (anything they and the repository do not settle is a blocker, not a guess):",
|
|
164
164
|
"<the handoff or the run arguments>",
|
|
165
|
-
"Results of earlier steps: <step id -> its result>",
|
|
165
|
+
"Results of earlier steps: <step id -> its result, as section 3 scopes them>",
|
|
166
166
|
];
|
|
167
167
|
return [
|
|
168
168
|
"## 3. How to run a step",
|
|
@@ -178,7 +178,10 @@ function runSection(w, t, ir) {
|
|
|
178
178
|
"",
|
|
179
179
|
"Check each result against its shape. A missing or malformed result: start the agent once more",
|
|
180
180
|
"with the problem; still wrong -> stop, `failed`, with the step and the reason. Keep every",
|
|
181
|
-
"result by step id
|
|
181
|
+
"result by step id. A later step gets them all, unless its brief in steps.md says what it",
|
|
182
|
+
"reads: then only those (decision 55). A task's step gets its own task's results whole, the",
|
|
183
|
+
"results of the tasks it depends on summarized (without raw output, evidence or failures), and",
|
|
184
|
+
"no other task's.",
|
|
182
185
|
up
|
|
183
186
|
? `\nCollect every question, assumption and gap a step returns, with its id and step. Ids are
|
|
184
187
|
\`<step>.<id>\` so two steps never clash.${w.deferNonBlocking ? " An item marked `blocking: false` goes to `deferred` instead." : ""}`
|
package/dist/graph.js
CHANGED
|
@@ -1,4 +1,5 @@
|
|
|
1
1
|
import { outputsOf } from "./types.js";
|
|
2
|
+
import { stepPlaces } from "./reads.js";
|
|
2
3
|
const n = (k, one, many) => `${k} ${k === 1 ? one : many}`;
|
|
3
4
|
/** `handoff`: the run has a handoff to go back to (downstream, not release from changesets). */
|
|
4
5
|
export function loopExits(step, handoff = true) {
|
|
@@ -166,6 +167,10 @@ export function orchestrationGraph(w) {
|
|
|
166
167
|
route("round-limit", id, `checkpoint after round ${w.maxRounds} (+ extraRounds): the user freezes the scope, extends or stops`);
|
|
167
168
|
};
|
|
168
169
|
const last = chain(w.steps, at("start"));
|
|
170
|
+
// Data edges (decision 55): what each step with `reads` is given from earlier steps.
|
|
171
|
+
for (const [id, p] of stepPlaces(w))
|
|
172
|
+
for (const r of p.step.reads ?? [])
|
|
173
|
+
g.edges.push({ from: r, to: id, label: "reads", data: true });
|
|
169
174
|
const end = down ? "done" : "awaiting-approval";
|
|
170
175
|
for (const e of last)
|
|
171
176
|
route(end, e.from, down ? "every step finished" : "the handoff is written; a person approves it");
|
|
@@ -182,7 +187,7 @@ const emitsWorkflow = (w) => outputsOf(w).includes("workflow");
|
|
|
182
187
|
const mid = (id) => `n_${id.replace(/[^A-Za-z0-9_]/g, "_")}`;
|
|
183
188
|
const tid = (status) => `t_${status.replace(/[^A-Za-z0-9_]/g, "_")}`;
|
|
184
189
|
const esc = (s) => s.replace(/"/g, "'");
|
|
185
|
-
/** A Mermaid flowchart: steps, routes, loop back-edges and the terminals each step reaches. */
|
|
190
|
+
/** A Mermaid flowchart: steps, routes, loop back-edges, data edges (--o) and the terminals each step reaches. */
|
|
186
191
|
export function renderMermaid(g) {
|
|
187
192
|
const lines = ["flowchart TD"];
|
|
188
193
|
for (const n of g.nodes) {
|
|
@@ -194,7 +199,7 @@ export function renderMermaid(g) {
|
|
|
194
199
|
for (const s of statuses)
|
|
195
200
|
lines.push(` ${tid(s)}((("${s}")))`);
|
|
196
201
|
for (const e of g.edges) {
|
|
197
|
-
const arrow = e.back ? "-.->" : "-->";
|
|
202
|
+
const arrow = e.data ? "--o" : e.back ? "-.->" : "-->";
|
|
198
203
|
lines.push(` ${mid(e.from)} ${arrow}${e.label ? `|"${esc(e.label)}"|` : ""} ${mid(e.to)}`);
|
|
199
204
|
}
|
|
200
205
|
const seen = new Set();
|
package/dist/reads.js
ADDED
|
@@ -0,0 +1,75 @@
|
|
|
1
|
+
/** Fields left out of a summarized result: raw output and evidence that belong to its own task. */
|
|
2
|
+
export const SUMMARY_DROPS = ["failureOutput", "output", "failures", "foreignFailures"];
|
|
3
|
+
export function stepPlaces(w) {
|
|
4
|
+
const out = new Map();
|
|
5
|
+
let order = 0;
|
|
6
|
+
const visit = (steps, ancestors, loop) => {
|
|
7
|
+
for (const s of steps) {
|
|
8
|
+
out.set(s.id, { step: s, order: order++, ancestors, loop });
|
|
9
|
+
const inner = [...ancestors, s.id];
|
|
10
|
+
if (s.type === "parallel" || s.type === "sequential")
|
|
11
|
+
visit(s.steps, inner, loop);
|
|
12
|
+
if (s.type === "foreach")
|
|
13
|
+
visit(s.steps, inner, s.id);
|
|
14
|
+
if (s.type === "integration-loop")
|
|
15
|
+
visit(s.followup, inner, s.id);
|
|
16
|
+
}
|
|
17
|
+
};
|
|
18
|
+
visit(w.steps, [], null);
|
|
19
|
+
return out;
|
|
20
|
+
}
|
|
21
|
+
/** The ids a step and every step it holds. */
|
|
22
|
+
export function heldIds(s) {
|
|
23
|
+
const kids = s.type === "parallel" || s.type === "sequential" || s.type === "foreach" ? s.steps
|
|
24
|
+
: s.type === "integration-loop" ? s.followup
|
|
25
|
+
: [];
|
|
26
|
+
return [s.id, ...kids.flatMap(heldIds)];
|
|
27
|
+
}
|
|
28
|
+
/** Step types that only hold other steps: `reads` goes on the steps they hold. */
|
|
29
|
+
export const CONTAINER_TYPES = new Set(["parallel", "sequential", "foreach"]);
|
|
30
|
+
/** Why one `reads` entry of a step is not allowed, or null when it is. */
|
|
31
|
+
export function readIssue(w, places, step, entry) {
|
|
32
|
+
const here = places.get(step.id);
|
|
33
|
+
const there = places.get(entry);
|
|
34
|
+
if (!there)
|
|
35
|
+
return `reads "${entry}", which is not a step of ${w.id}`;
|
|
36
|
+
if (entry === step.id)
|
|
37
|
+
return `reads itself; its own results for the current item are always visible`;
|
|
38
|
+
if (here.ancestors.includes(entry))
|
|
39
|
+
return `reads "${entry}", a step that holds it; its results are not finished yet`;
|
|
40
|
+
if (there.order > here.order)
|
|
41
|
+
return `reads "${entry}", which runs after it`;
|
|
42
|
+
return null;
|
|
43
|
+
}
|
|
44
|
+
/**
|
|
45
|
+
* Per step id with `reads`: every step id it may read (the entries and the steps they hold). Steps
|
|
46
|
+
* without `reads` are absent: they see every earlier step.
|
|
47
|
+
*/
|
|
48
|
+
export function readsMap(w) {
|
|
49
|
+
const places = stepPlaces(w);
|
|
50
|
+
const out = {};
|
|
51
|
+
for (const [id, p] of places) {
|
|
52
|
+
const r = p.step.reads;
|
|
53
|
+
if (!r)
|
|
54
|
+
continue;
|
|
55
|
+
out[id] = [...new Set(r.flatMap((e) => (places.has(e) ? heldIds(places.get(e).step) : [e])))];
|
|
56
|
+
}
|
|
57
|
+
return out;
|
|
58
|
+
}
|
|
59
|
+
/** Per step id inside a loop: the id of that loop. */
|
|
60
|
+
export function loopMap(w) {
|
|
61
|
+
const out = {};
|
|
62
|
+
for (const [id, p] of stepPlaces(w))
|
|
63
|
+
if (p.loop)
|
|
64
|
+
out[id] = p.loop;
|
|
65
|
+
return out;
|
|
66
|
+
}
|
|
67
|
+
/** The plain-language rule for a step, for a skill or an orchestrator that passes the results itself. */
|
|
68
|
+
export function readsText(step) {
|
|
69
|
+
const r = step.reads;
|
|
70
|
+
if (!r)
|
|
71
|
+
return "";
|
|
72
|
+
return r.length
|
|
73
|
+
? `Reads only the results of ${r.map((e) => `\`${e}\``).join(", ")} (and of its own task and the tasks it depends on).`
|
|
74
|
+
: "Reads no results of earlier steps (only those of its own task and the tasks it depends on).";
|
|
75
|
+
}
|
package/dist/validate.js
CHANGED
|
@@ -6,6 +6,7 @@ import { SCHEMAS_DIR } from "./paths.js";
|
|
|
6
6
|
import { loadRawPack } from "./load.js";
|
|
7
7
|
import { applySpecializations } from "./specialize.js";
|
|
8
8
|
import { SKILL_STEP_TYPES, emits } from "./types.js";
|
|
9
|
+
import { CONTAINER_TYPES, readIssue, stepPlaces } from "./reads.js";
|
|
9
10
|
const SCHEMA_FILES = {
|
|
10
11
|
pack: "pack.schema.yaml",
|
|
11
12
|
"model-policy": "model-policy.schema.yaml",
|
|
@@ -351,6 +352,22 @@ function crossRefIssues(lp, files) {
|
|
|
351
352
|
}
|
|
352
353
|
}
|
|
353
354
|
});
|
|
355
|
+
// What each step's agents read from earlier steps (decision 55).
|
|
356
|
+
const places = stepPlaces(w);
|
|
357
|
+
for (const [id, p] of places) {
|
|
358
|
+
const r = p.step.reads;
|
|
359
|
+
if (!r)
|
|
360
|
+
continue;
|
|
361
|
+
if (CONTAINER_TYPES.has(p.step.type) || p.step.type === "approval") {
|
|
362
|
+
err(f, `step ${id}: reads applies to agent steps; ${p.step.type === "approval" ? "no agent runs an approval" : `set it on the steps ${p.step.type} holds`}`);
|
|
363
|
+
continue;
|
|
364
|
+
}
|
|
365
|
+
for (const e of r) {
|
|
366
|
+
const why = readIssue(w, places, p.step, e);
|
|
367
|
+
if (why)
|
|
368
|
+
err(f, `step ${id}: ${why}`);
|
|
369
|
+
}
|
|
370
|
+
}
|
|
354
371
|
approvalIssues(w, pack, upstreamApprovals, err.bind(null, f));
|
|
355
372
|
if (w.retro)
|
|
356
373
|
checkRef(f, "retro", w.retro, []);
|
|
@@ -22,6 +22,7 @@ steps:
|
|
|
22
22
|
# contracts instead of inventing their own, and every red test has a known owner.
|
|
23
23
|
- id: contracts
|
|
24
24
|
type: agent
|
|
25
|
+
reads: []
|
|
25
26
|
persona: architect
|
|
26
27
|
taskKind: decide
|
|
27
28
|
prompt: >-
|
|
@@ -38,6 +39,7 @@ steps:
|
|
|
38
39
|
not settle is a blocker: return blocked with the question.
|
|
39
40
|
- id: interfaces
|
|
40
41
|
type: agent
|
|
42
|
+
reads: [contracts]
|
|
41
43
|
persona: lead-developer
|
|
42
44
|
taskKind: integrate
|
|
43
45
|
prompt: >-
|
|
@@ -51,6 +53,7 @@ steps:
|
|
|
51
53
|
change it.
|
|
52
54
|
- id: orchestration
|
|
53
55
|
type: agent
|
|
56
|
+
reads: [contracts, interfaces]
|
|
54
57
|
persona: backend-engineer
|
|
55
58
|
taskKind: integrate
|
|
56
59
|
prompt: >-
|
|
@@ -71,6 +74,7 @@ steps:
|
|
|
71
74
|
# task's own paths, code only in the task's files, against the frozen interfaces.
|
|
72
75
|
- id: tdd
|
|
73
76
|
type: tdd-pair
|
|
77
|
+
reads: [contracts, interfaces, orchestration]
|
|
74
78
|
test: { persona: qa-engineer, taskKind: test-design }
|
|
75
79
|
impl: { persona: "{{stack}}", taskKind: "{{task.taskKind}}", allowedTaskKinds: [implement, scaffold, adapter] }
|
|
76
80
|
verify: { persona: qa-engineer, taskKind: verify }
|
|
@@ -81,12 +85,14 @@ steps:
|
|
|
81
85
|
# that goes back through the bottom-of-pyramid loop. Repeats until green or maxRounds.
|
|
82
86
|
- id: integrate
|
|
83
87
|
type: integration-loop
|
|
88
|
+
reads: [contracts, interfaces, orchestration, build]
|
|
84
89
|
integrate: { persona: "{{stack}}", taskKind: integrate }
|
|
85
90
|
testScope: [static, unit, integration, e2e]
|
|
86
91
|
maxRounds: 3
|
|
87
92
|
followup:
|
|
88
93
|
- id: followup-tdd
|
|
89
94
|
type: tdd-pair
|
|
95
|
+
reads: [contracts, interfaces, orchestration]
|
|
90
96
|
test: { persona: qa-engineer, taskKind: test-design }
|
|
91
97
|
impl: { persona: "{{stack}}", taskKind: "{{task.taskKind}}", allowedTaskKinds: [implement, scaffold, adapter] }
|
|
92
98
|
verify: { persona: qa-engineer, taskKind: verify }
|
|
@@ -97,6 +103,7 @@ steps:
|
|
|
97
103
|
# steward checks the controls. Only when the handoff holds pii.
|
|
98
104
|
- id: privacy-review
|
|
99
105
|
type: gate
|
|
106
|
+
reads: [contracts, orchestration]
|
|
100
107
|
when: pii
|
|
101
108
|
persona: data-analyst-pii
|
|
102
109
|
taskKind: analysis
|
|
@@ -105,6 +112,7 @@ steps:
|
|
|
105
112
|
onFail: { persona: backend-engineer, taskKind: integrate }
|
|
106
113
|
- id: security-review
|
|
107
114
|
type: gate
|
|
115
|
+
reads: [contracts, orchestration]
|
|
108
116
|
persona: security-steward
|
|
109
117
|
taskKind: review
|
|
110
118
|
prompt: Review the full diff against the security, data-classification, rules and config conventions and the handoff's decisions.
|
|
@@ -112,6 +120,7 @@ steps:
|
|
|
112
120
|
onFail: { persona: backend-engineer, taskKind: integrate }
|
|
113
121
|
- id: acceptance
|
|
114
122
|
type: gate
|
|
123
|
+
reads: [orchestration, build, integrate]
|
|
115
124
|
persona: lead-developer
|
|
116
125
|
taskKind: integrate
|
|
117
126
|
prompt: >-
|
|
@@ -123,6 +132,7 @@ steps:
|
|
|
123
132
|
onFail: { persona: backend-engineer, taskKind: integrate }
|
|
124
133
|
- id: pr
|
|
125
134
|
type: agent
|
|
135
|
+
reads: [orchestration, build, integrate]
|
|
126
136
|
persona: git-steward
|
|
127
137
|
taskKind: git
|
|
128
138
|
output: git
|
|
@@ -20,6 +20,7 @@ steps:
|
|
|
20
20
|
taskKind: verify
|
|
21
21
|
- id: contracts
|
|
22
22
|
type: agent
|
|
23
|
+
reads: []
|
|
23
24
|
persona: architect
|
|
24
25
|
taskKind: decide
|
|
25
26
|
prompt: >-
|
|
@@ -34,6 +35,7 @@ steps:
|
|
|
34
35
|
question.
|
|
35
36
|
- id: interfaces
|
|
36
37
|
type: agent
|
|
38
|
+
reads: [contracts]
|
|
37
39
|
persona: lead-developer
|
|
38
40
|
taskKind: integrate
|
|
39
41
|
prompt: >-
|
|
@@ -44,6 +46,7 @@ steps:
|
|
|
44
46
|
that consume each.
|
|
45
47
|
- id: orchestration
|
|
46
48
|
type: agent
|
|
49
|
+
reads: [contracts, interfaces]
|
|
47
50
|
persona: backend-engineer
|
|
48
51
|
taskKind: integrate
|
|
49
52
|
prompt: >-
|
|
@@ -62,6 +65,7 @@ steps:
|
|
|
62
65
|
steps:
|
|
63
66
|
- id: tdd
|
|
64
67
|
type: tdd-pair
|
|
68
|
+
reads: [contracts, interfaces, orchestration]
|
|
65
69
|
test: { persona: qa-engineer, taskKind: test-design }
|
|
66
70
|
impl: { persona: "{{stack}}", taskKind: "{{task.taskKind}}", allowedTaskKinds: [implement, scaffold, adapter] }
|
|
67
71
|
verify: { persona: qa-engineer, taskKind: verify }
|
|
@@ -69,12 +73,14 @@ steps:
|
|
|
69
73
|
maxRounds: 3
|
|
70
74
|
- id: integrate
|
|
71
75
|
type: integration-loop
|
|
76
|
+
reads: [contracts, interfaces, orchestration, build]
|
|
72
77
|
integrate: { persona: "{{stack}}", taskKind: integrate }
|
|
73
78
|
testScope: [static, unit, integration, e2e]
|
|
74
79
|
maxRounds: 3
|
|
75
80
|
followup:
|
|
76
81
|
- id: followup-tdd
|
|
77
82
|
type: tdd-pair
|
|
83
|
+
reads: [contracts, interfaces, orchestration]
|
|
78
84
|
test: { persona: qa-engineer, taskKind: test-design }
|
|
79
85
|
impl: { persona: "{{stack}}", taskKind: "{{task.taskKind}}", allowedTaskKinds: [implement, scaffold, adapter] }
|
|
80
86
|
verify: { persona: qa-engineer, taskKind: verify }
|
|
@@ -83,6 +89,7 @@ steps:
|
|
|
83
89
|
# The top of the prompt pyramid. Neither agent wrote the prompt (decision 25).
|
|
84
90
|
- id: eval-run
|
|
85
91
|
type: agent
|
|
92
|
+
reads: [contracts, interfaces]
|
|
86
93
|
level: eval-run
|
|
87
94
|
persona: qa-engineer
|
|
88
95
|
taskKind: verify
|
|
@@ -101,6 +108,7 @@ steps:
|
|
|
101
108
|
changing one reopens its level in prompt-discovery.
|
|
102
109
|
- id: eval-review
|
|
103
110
|
type: agent
|
|
111
|
+
reads: [contracts, eval-run]
|
|
104
112
|
level: eval-run
|
|
105
113
|
persona: security-steward
|
|
106
114
|
taskKind: review
|
|
@@ -115,6 +123,7 @@ steps:
|
|
|
115
123
|
blocked.reason starting "Level <id>:". Never fix anything yourself.
|
|
116
124
|
- id: privacy-review
|
|
117
125
|
type: gate
|
|
126
|
+
reads: [contracts, orchestration]
|
|
118
127
|
when: pii
|
|
119
128
|
persona: data-analyst-pii
|
|
120
129
|
taskKind: analysis
|
|
@@ -123,6 +132,7 @@ steps:
|
|
|
123
132
|
onFail: { persona: backend-engineer, taskKind: integrate }
|
|
124
133
|
- id: security-review
|
|
125
134
|
type: gate
|
|
135
|
+
reads: [contracts, orchestration]
|
|
126
136
|
persona: security-steward
|
|
127
137
|
taskKind: review
|
|
128
138
|
prompt: Review the full diff against the security, data-classification, rules and config conventions and the handoff's decisions. The approved prompt, examples and eval cases are not findings to fix here; a problem in one is a high finding naming its level.
|
|
@@ -130,6 +140,7 @@ steps:
|
|
|
130
140
|
onFail: { persona: backend-engineer, taskKind: integrate }
|
|
131
141
|
- id: acceptance
|
|
132
142
|
type: gate
|
|
143
|
+
reads: [orchestration, build, integrate, eval-run]
|
|
133
144
|
persona: lead-developer
|
|
134
145
|
taskKind: integrate
|
|
135
146
|
prompt: >-
|
|
@@ -143,6 +154,7 @@ steps:
|
|
|
143
154
|
onFail: { persona: backend-engineer, taskKind: integrate }
|
|
144
155
|
- id: pr
|
|
145
156
|
type: agent
|
|
157
|
+
reads: [orchestration, build, integrate]
|
|
146
158
|
persona: git-steward
|
|
147
159
|
taskKind: git
|
|
148
160
|
output: git
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@digital-agora/friday",
|
|
3
|
-
"version": "0.
|
|
3
|
+
"version": "0.11.0",
|
|
4
4
|
"description": "Friday: the source of truth for AI-assisted SDLC. Compiles YAML personas, workflows and conventions into agent bundles (Claude Code, OpenCode).",
|
|
5
5
|
"type": "module",
|
|
6
6
|
"license": "MIT",
|
|
@@ -118,6 +118,16 @@ $defs:
|
|
|
118
118
|
The checkpoint (pack.yaml checkpoints) this step builds, or an approval step approves
|
|
119
119
|
(decision 39). A person approves it; a change to it reopens every approval after it.
|
|
120
120
|
type: string
|
|
121
|
+
reads:
|
|
122
|
+
description: >-
|
|
123
|
+
The earlier steps whose results this step's agents are given (decision 55), by step id; a
|
|
124
|
+
step that holds others stands for all of them. Unset: every earlier step. Either way, a
|
|
125
|
+
result of the step's own loop is given only for the current item (whole) and the items it
|
|
126
|
+
depends on (summarized), and a per-item result of another loop is summarized. Not on
|
|
127
|
+
parallel, sequential or foreach: set it on the steps they hold.
|
|
128
|
+
type: array
|
|
129
|
+
uniqueItems: true
|
|
130
|
+
items: { type: string, pattern: "^[a-z][a-z0-9-]{1,40}$" }
|
|
121
131
|
override:
|
|
122
132
|
type: object
|
|
123
133
|
additionalProperties: false
|