2026-10-11 17:09 UTC

Independent use will determine whether GraphArc’s runtime-authored agent graphs and deterministic pre-execution admission gates make dynamic workflows auditable while reliably enforcing policy, budget, registry, depth, and topology constraints.

state: expiredheat: lowuncertainty: highconvergesscott: highagent-harnesses dynamic-workflows deterministic-guardrailsGraphArc

What is this?

GraphArc appears to be an open-source, MIT-licensed agent harness in which a local Qwen3 8B model converts a natural-language question into a runtime-authored investigation graph. Before execution, a deterministic admission gate reportedly accepts or rejects the proposed topology with reasons, checking constraints such as policy, budget, registered components, graph depth, and topology; a cited demo shows a nine-node graph planned, admitted, and run in a browser. The supplied web snippets establish broader interest in dynamic workflow graphs, auditable orchestration, and pre-execution verification, but they do not independently identify GraphArc’s creators or validate that its gate reliably enforces all claimed constraints—the hypothesis still requires independent use and testing.

Why it matters to Scott

GraphArc independently implements Scott’s combined self-structuring-loop and deterministic-control-plane position: the model authors a workflow topology, but explicit code gates its policy, budget, capabilities, depth, and shape before execution. If independent testing supports the claims, it offers a strong dated-receipts and comparative-build opportunity for his Decision Authority Infrastructure and SiloOS work; the radar tracks adjacent guardrail and orchestration cases, but not this GraphArc development itself.
ip:framework.decision-authority-infrastructureip:concept.self-structuring-loopip:concept.autonomy-budgetdev:concept.deterministic-agent-control-planedev:project.silo-osradar:concept.agent-harnessesradar:concept.multi-agent-orchestrationradar:concept.agent-safetyradar:opencode-guardians-tool-call-verificationradar:claude-subagent-budget-exhaustion
queries asked of Scott's wikis
  • runtime-authored agent graphs versus fixed harnesses
  • deterministic admission control for agent plans
  • policy and budget enforcement before agent execution
  • auditable dynamic workflow topology
  • agent tool registry and capability constraints
  • bounded depth and fan-out in multi-agent orchestration

Measured heat

no measured readings yet — the hourly heat pass fills this in

How the heat travelled

no chain yet — the hourly chain pass fills this in

Evidence (5) — ⭐ canonical anchor

sourceobjectauthorscorecomments
🟠 redditWatch a local qwen3:8b turn one English question into a 9-node investigation graph - planned, admitted by a deterministic gate, and run live in the browser (open source, MIT)
LocalLLaMA
Desperate-Ad-9679412
🟠 redditGraph engineering ? Or we can say agents on steroids....
artificial
Desperate-Ad-967910
🟠 redditI built an "admission gate" for agent graphs aka graph engineerin (STEP1): the model proposes the topology, a deterministic checker admits or refuses it with reasons before anything executes.
OpenAI
Desperate-Ad-967910
🟧 echo.github ⭐This commit added the exact 33.27-second incident-demo video later uploaded to Reddit. The README describes it as “a local model turns one EShashank Shekhar Singh——
🟧 hnIntroducing Dogwood: runtime verification for AI agentsmatt_d10

Interpretation history

Decision trace