One loop
Measure a gap, act to shrink it, then check again. Simple, cheap, and often the right answer.
measure → act → check → repeat
01 A control architecture for honest improvement
Graph Engineering connects execution, verification, audit, arbitration, and human judgment so a system can improve without learning to fool itself.
Not “more agents.” Better evidence, authority, and stopping rules.
02 The plain-language version
Measure a gap, act to shrink it, then check again. Simple, cheap, and often the right answer.
measure → act → check → repeat
Different loops act, verify, audit, and arbitrate. Their edges define evidence and authority.
act → verify → constrain | veto
At least one protected signal must touch reality outside the optimizing machinery.
claim → independent evidence → decision
03 Why a perfect loop can fail perfectly
Single-loop failures are not random. They follow from what the loop cannot see or govern.
Once a proxy becomes the target, the system discovers cheap ways to move the number without delivering the outcome.
A loop can optimize a reference value, but it cannot decide whether that reference was wise.
Speed, quality, safety, and cost can each improve locally while the whole system gets worse.
Sensors drift, definitions change, and dashboards keep agreeing with reports produced by the same broken pipeline.
04 The minimum grounded graph
A node is a control responsibility. It may be implemented by a person, a deterministic test, a service, a model, or an agent.
05 The part topology cannot supply
A second agent is not independent if it reads the same corrupted table. A second dashboard is not a reality check if both dashboards share the same pipeline.
Independent verification requires both an independent evaluator and independent evidence provenance.
06 Four layers of understanding
One loop improves one number. A graph makes the loops watch, constrain, and correct one another.
Name every responsibility, evidence artifact, veto, escalation, cadence, and human owner.
Persist the graph in machine-readable JSON with frozen anchors, verification checks, and stop conditions.
Implement only the nodes that need persistent loops, then verify outcomes against fresh anchors.
07 Use the smallest architecture that works
One bounded action. No useful feedback cycle. Solve it directly.
Example: translate one sentence.One dominant goal, one trustworthy verifier, meaningful retries.
Example: repair a failing test.Several goals, speeds, verifiers, conflicts, or authorities interact.
Example: improve support without harming retention.08 A working Codex Skill, not just an essay
The repository includes an installable Skill, a graph initializer, a structural validator, a complete customer-support example, regression tests, and dependency-free CI.
$ npx skills add 2023Anita/graph-engineering-architect
# Invoke in Codex
Use $graph-engineering-architect to design the minimum grounded architecture for this workflow.
# Verify the repository
$ make verify
09 Five rules worth keeping
Do not create one agent per node by default.
Do not call shared-data self-review independent verification.
Do not let fast loops rewrite slow goals or protected tests.
Do not let improvement machinery grant itself more authority.
Do not declare success without fresh anchored evidence and a usable handoff.