TEXUS · SACL — Coordination layer · Patent pending

Make your AI agents cheaper, more reliable, and auditable.

SACL is a coordination & memory layer that wraps any model. Same answers — a fraction of the cost — with a built-in audit trail. Proven on public benchmarks and inside a real agent runtime.

Validated across
ClaudeGPTGeminiQwen

The problem

Why agents break at scale

They get expensive

Multi-agent context cost grows roughly quadratically — every agent re-reads everyone else's text.

They fail silently

As context grows, accuracy can collapse — while the agent stays confidently wrong.

They're unauditable

No record of why the system decided what it did. Useless in regulated, high-stakes domains.


The solution

One layer. Four wins.

Cheaper

Bounded, reducer-governed memory instead of re-sending growing context.

More reliable

Deterministic conflict resolution with full provenance — never silently wrong.

Auditable

Every committed fact carries provenance you can trace.

Model-agnostic

The guarantees come from the layer, not the model — no lock-in.


The proof

Validated on public benchmarks, not ours.

Same model, official datasets and scoring, SACL-on vs SACL-off. Accuracy ties on 2 of 3 benchmarks — the durable wins are cost and auditability. Every number reproducible.

Reproducible
Live visualization
Natural language coordination
context tokens:0
SACL packet coordination
context tokens:0

Baseline coordination cost grows ~O(N²). SACL stays ~O(N).

HotpotQA
0.00 vs 0.00
More accurate + 62% fewer tokens.
MuSiQue
Same accuracy
Tie · 79% fewer tokens.
RULER · needle-in-a-haystack
0% = 0%
Tie · up to 460× fewer tokens.
Cheap vs frontier

HotpotQA · same 30 questions

Exact-match accuracy (higher is better). SACL bars in amber.

Reproducible
Haiku
0.50
Haiku + SACL
0.60
Opus
0.67
Opus + SACL
0.73
Baseline With SACL
Scale 0.00 — 0.80
Frontier-class, fraction of the cost

A 15×-cheaper model + SACL nearly matches the frontier.

Haiku + SACL (0.60) lands near plain Opus (0.67) — at a fraction of the cost.

Savings rise with scale

97.5% fewer tokens at 128 agents (live).

4,000-agent run: 100% accuracy, $3.88 total.


How it works

Model proposes, reducer disposes.

01

Agents share structured, traceable state

Instead of re-reading each other's raw text, agents commit structured findings to shared state.

02

A deterministic reducer commits and records provenance

Conflicts resolved deterministically — no LLM in the resolution loop. Every commit is logged.

03

The model reads a compact, bounded, auditable state

No runaway context. Same intelligence — far less to chew on.

It drops into a real agent runtime in small, reversible steps — flag off = byte-identical, with a built-in kill switch.


Design-partner pilot

Run SACL on your workload.

Paid design-partner pilots — 4–8 weeks, $5k–$25k. We integrate SACL behind a flag into your agent stack and measure cost, reliability, and auditability on your own workload.

No commitment — a 20-min intro call to see if it fits.

or email us directly


Honest scope

Where it fits — and where it doesn't (yet).

Where SACL wins
  • Long-running agents that accumulate state
  • Many agents / high contention
  • Auditability in regulated, high-stakes domains
  • Cost at scale (hundreds → thousands of agents)
Where it doesn't (yet)
  • Short, simple tasks
  • Low-contention, single-shot work
  • Free-form conversational memory — in progress
  • Making a weak model smart

The limits are how you know the wins are real.