2026-05-05· 11 min read

Three repos, one thesis - bounded loops, bounded evidence, bounded graphs

One thesis now lives in three codebases. Each repo pushes determinism into a different layer: loop boundary, evidence boundary, or graph boundary.

agentsdeterminism-ladderproof-of-workanthropicopenailanggraph

A thesis earns trust under repetition.

One essay can sound sharp. One repo can look lucky. Three repos under three different runtimes start to show whether the same architectural instinct still holds once the job shape changes.

StoneyTECH keeps making one claim: push responsibility out of the model and into the smallest inspectable control surface closing the job. The phrase can sound abstract until code starts carrying it. Three working repos now carry it:

  • StoneyTECH-Trinity-Learning-Agent
  • StoneyTECH-Trinity-Evidence-Agent
  • StoneyTECH-Trinity-GVAR-Engine

Not the same app copied three times. Not a benchmark contest. Three different jobs. One repeated thesis.

One sentence, three placements

The thesis stays stable. The placement changes.

RepoJobWhere determinism livesRuntime purchase
StoneyTECH-Trinity-Learning-Agentbounded teaching loopfixed run boundary, concept picker, prompt template, SM-2 ledgersmall loop stays obvious
StoneyTECH-Trinity-Evidence-Agentbounded evidence briefstructured output, source URL, narrow brief shapemanaged tools and traces without graph weight
StoneyTECH-Trinity-GVAR-Engineverifier workflowexplicit state, explicit nodes, explicit edges, explicit loop exittopology becomes inspectable

The point is not variety for its own sake. The point is pressure from three directions:

  • small-loop pressure
  • bounded-research pressure
  • graph-orchestration pressure

If the same thesis survives all three, the thesis starts looking less like branding and more like architecture.

StoneyTECH-Trinity-Learning-Agent - determinism at the loop boundary

StoneyTECH-Trinity-Learning-Agent carries the smallest job in the set. Pick one concept. Generate one draft. Stop. Or pick one due concept. Send one study prompt. Stop.

Determinism lives outside the model in a few plain places:

  • the concept catalog
  • prerequisite gating
  • the picker rules
  • the output path
  • the study ledger
  • the grading schedule

The model still does meaningful work. The model writes or explains. The surrounding loop decides scope, cadence, and finish line.

This is the first thesis proof: a useful agent does not need a society of abstractions when the job has one bounded objective. Keep the loop small. Keep the exit obvious. Put memory in files and rules before putting memory in agent myth.

StoneyTECH-Trinity-Evidence-Agent - determinism at the evidence boundary

StoneyTECH-Trinity-Evidence-Agent carries a different problem. The job is no longer “write the next draft.” The job is “return one bounded evidence brief from public sources.”

Here the important boundary is not only the run. The important boundary is the brief itself:

  • one subject
  • one primary source URL
  • one bounded claim
  • one evidence summary

The shape matters. A dossier about a company could drift into generic research assistance or career tooling. A bounded evidence brief stays much closer to the site thesis. The output asks for a claim with a source, not for a vibe with citations sprinkled on top.

This is the second thesis proof: agentic research gets safer and more legible when the output contract narrows early. Tool access alone does not buy rigor. A small evidence schema buys rigor.

StoneyTECH-Trinity-GVAR-Engine - determinism in the graph itself

StoneyTECH-Trinity-GVAR-Engine carries the hardest job in the set. The problem is no longer one loop or one brief. The problem is a verifier workflow with state transitions:

  • generate
  • verify
  • adjudicate
  • refine
  • loop or exit

Once the risk moves onto the edges, plain loops stop being enough. A hidden branch can waste a run. A stale state field can poison convergence. A missing exit rule can turn “agent” into “hang.”

So determinism moves again, this time into first-class graph structure:

  • shared typed state
  • named nodes
  • named edges
  • explicit loop return
  • explicit convergence exit
  • trace records at every step

This is the third thesis proof: some jobs do not need stronger prompts. Some jobs need visible topology.

What stayed the same

Three runtimes changed. One discipline stayed put.

Each repo asks the same sequence:

  1. What is the bounded job?
  2. Where should non-model responsibility live?
  3. What can become inspectable before autonomy grows?
  4. What is the smallest control surface closing the gap?

StoneyTECH-Trinity-Learning-Agent answers with local loop discipline.

StoneyTECH-Trinity-Evidence-Agent answers with a bounded evidence contract.

StoneyTECH-Trinity-GVAR-Engine answers with explicit graph state.

Different answers. Same method.

Why this matters more than another comparison chart

A comparison chart can still stay too airy. A strong chart says where to reach first. A proof set says why the recommendation survives contact with code.

Without the repos, the prior article could only argue:

  • Anthropic TypeScript SDK fits the small bounded loop
  • OpenAI Agents SDK fits the structured agent application
  • LangGraph fits the explicit workflow

With the repos, the argument gets teeth:

  • the small bounded loop exists
  • the bounded evidence brief exists
  • the explicit graph exists

The article stops sounding like taste. The article starts sounding like repeated placement.

The real convergence

Convergence does not mean the three repos start to resemble one giant platform. Convergence means each repo keeps rediscovering the same rule:

move control outward until the failure mode gets boring.

For StoneyTECH-Trinity-Learning-Agent, boring means a run ends after one bounded artifact.

For StoneyTECH-Trinity-Evidence-Agent, boring means a brief comes back with one source and one constrained claim.

For StoneyTECH-Trinity-GVAR-Engine, boring means the graph can show exactly why the loop continued or stopped.

Same thesis. Different boring.

What comes next

The next gain is not another scaffold. The next gain is stronger proof around each lane:

  • StoneyTECH-Trinity-Learning-Agent: watcher sibling, auto-PR flow, stronger study loop
  • StoneyTECH-Trinity-Evidence-Agent: verifier handoff, richer source discipline, claim packs
  • StoneyTECH-Trinity-GVAR-Engine: real provider calls, checkpoints, replay, service wrapper

The shape is good now. The codebase trio finally says the same thing the site keeps saying:

bounded, audited AI starts with placement.

Axioms applied in this essay

This article tested 6 of the StoneyTECH engineering axioms. Each verdict is the result of applying that axiom in this specific argument.