/ delegates · admitted manifold

The manifold
the fabric admits.

Delegates are the admitted manifold inside Agent Fabric's observer infrastructure. The fabric admits, governs, and observes. The delegates do the bounded work within it.

Continuation is conditional. If it can't refuse, it can't run.

What a delegate is.

A delegate is a scoped agent the fabric authorizes to operate within a defined boundary, accountable back to the fabric. Bounded. Measured. Refusable. Activated only after qualification.

01 / Bounded scope

Every delegate ships with a declared scope as an input/output contract. The delegate is evaluated against that scope, and scope expansion is a versioning event — never a silent widening.

02 / Qualification check

Before activation, each delegate is checked against its declared scope, authority boundary, schema behavior, and refusal posture. Qualification is recorded before the delegate is allowed to operate inside the fabric.

03 / Signoff required

No delegate auto-approves anything consequential. Every non-trivial output is flagged for human signoff with a receipt. The fabric records; the human decides.

04 / Refusal posture

The delegate refuses to approve, to skip verification when an authority figure asks it to bypass scope, to follow instructions embedded in its input. Refusal is a feature, not a limitation.

Ledger-01.

PHASE 3 · PILOT PREPARATION · Q2–Q3 2026
The first admitted delegate · Lane 1 local

Invoice ↔ Purchase Order verification, bounded.

Ledger-01 takes one invoice and one purchase order as extracted text, compares them, and returns a bounded verdict: match, mismatch, insufficient_evidence, or refuse. Every mismatch includes evidence citations. Every non-match requires human signoff.

It does not approve. It does not book. It does not reconcile. It does not interpret tax. It does not detect fraud. The delegate's job is bounded by design — and by the qualification it passed before shipping.

Worker Phi-4 mini 3B · Q4_K_M
Governance Dahlia kernel · 500M
Sample verdict
"schema": "ledger.verdict.v0",
"ruling": "mismatch",
"evidence": [
  "invoice.line[2] != po.line[2]",
  "qty 5 vs qty 3",
  "unit_price $42 vs $40"
],
"signoff.required": true,
"model.govern": "dahlia · 500M",
"model.worker": "phi-4 · 3B",
"delegate.admitted": "ledger-01.v0.3"
What it is not

Not a bookkeeper.

Not a fraud detector

Fraud detection needs different evidence and a different qualification scope.

Not a tax advisor

Tax interpretation is out of scope. The delegate refuses tax questions explicitly.

Not autonomous

Ledger-01 never approves a payment. Every output routes through human signoff.

Qualification

How a delegate qualifies.

A delegate is a scoped agent. Before it operates inside the fabric, it is checked against its declared scope, its authority boundary, its schema behavior, and its refusal posture. Qualification outcomes are recorded and held with the delegate.

Qualification is recorded · Outcomes are owned · Refusal is a feature

crop_free

Declared scope

A delegate operates inside the scope it ships with. Scope expansion is a versioning event, never a silent widening.

verified_user

Authority boundary

A delegate's behavior is independent of who is asking. Pressure does not change scope.

schema

Schema behavior

A delegate's output stays inside its declared schema. Outputs that don't conform are not produced.

do_not_disturb_on

Refusal posture

A delegate refuses outside its scope. Refusal carries a structured reason and a recorded outcome.

Qualification is recorded.

A delegate that does not qualify does not operate.

Shared Governance

Dahlia kernel. One floor, many rooms.

Every admitted delegate inherits from Dahlia — the 500M-class kernel that handles refusal, authority hold, and schema integrity. Kernel updates are re-gated events. Delegate iteration does not regress kernel behavior.

Dahlia kernel · 500M REFUSAL · AUTHORITY HOLD · SCHEMA INTEGRITY GATE-LOCKED · 9 OF 9 GATES PASSED SCAFFOLD-EQUIVALENT · SIGNED-BUILD SHA256 VERIFIED INHERIT Ledger-01 Invoice ↔ PO · Phi-4 3B ADMITTED Compliance delegate in design NEXT Parse-01 governed extraction LADDER KERNEL UPDATES = RE-GATED EVENTS · DELEGATE ITERATION DOES NOT REGRESS KERNEL
Measured once

When a second delegate is admitted, its refusal behavior is not re-audited from scratch. It inherits Dahlia's gate-locked floor.

Re-gated updates

Every kernel update triggers a full re-run of the governance battery before promotion. No silent kernel changes.

Independent gates

When a delegate iterates its worker, Dahlia's refusal behavior stays unchanged. Governance is trusted independently of any single delegate's lifecycle.

Performance

Governance is a thin layer, not a drag.

Every Fabric delegate splits a request across two models: Dahlia (the kernel — governance, admission, refusal) and the delegate worker (the task model). We publish speed measurements for both, on two hardware substrates, so the claims stay measurable under either deployment profile.

Substrate A

GPU · RTX 4090 · llama.cpp CUDA · Q4_K_M · greedy · 5 trials per prompt

Metric Dahlia kernel Ledger-01 worker (Phi-4 mini Q4_K_M)
File size 398 MB 2.49 GB
Load time 0.7 s 1.2 s
First-token latency (p50) 5.5 ms 10.5 ms
Sustained output throughput (p50) 507 tokens/sec 217 tokens/sec
Typical refuse response 116 ms 121 ms
Typical full verdict 0.51 s 1.19 s
6.26×

Smaller on disk

Dahlia vs Phi-4 mini at identical Q4_K_M quantization. The governance kernel is a small artifact by design.

6.7×

Faster sustained throughput on Substrate B

Dahlia vs Phi-4 mini. (Phase 3 published 5.8×, within measurement variance.)

7.8×

Less memory bandwidth per decode token

Measured in S-INFER-MEM-01 at 512-token context. Governance reads ~1 GB/token; worker reads ~7.7 GB/token.

Substrate B

CPU · llama.cpp · Q4_K_M · greedy · 5 trials per prompt

Metric Dahlia kernel Ledger-01 worker (Phi-4 mini Q4_K_M)
File size 398 MB 2.49 GB
Load time 0.3 s 1.8 s
First-token latency (p50) 17 ms 109 ms
Sustained output throughput (p50) 63 tokens/sec 9.4 tokens/sec
Typical refuse response ~1.0 s ~2.9 s
Typical full verdict ~3.7 s ~27 s
B → A · Dahlia

faster sustained throughput on Substrate A vs Substrate B.

B → A · Phi-4 mini worker

23× faster on Substrate A — the larger model gains more because CPU decode is weight-bandwidth-bound; HBM removes that limit.

End-to-end full verdict

27 s on B → 1.2 s on A.

Refusal round-trip

2.9 s on B → 121 ms on A.

Savings at a glance
(A) Kernel vs worker self-govern

Architectural savings.

Refused — compute ~4× less
Refused — latency ~3× faster
Admitted overhead ~1%

The bigger win is safety, not cost. The task model never sees out-of-scope input.

(B) Local vs published frontier pricing

Order-of-magnitude cheaper.

Admitted verify cost lower locally
Network dependency none
Data leaves premises never

Published vendor prices on their side; measured runtime on ours. Exact math lives in sales collateral.

(C) Memory bandwidth per decode token

Why governance doesn't bottleneck.

Dahlia 500M Q4_K_M ~1.0 GB/token
Phi-4 mini 3.8B Q4_K_M ~7.7 GB/token
Ratio 7.8× less

Derived in S-INFER-MEM-01 Phase 1. At production context lengths, decode is ~100× more weight-bandwidth-bound than KV-cache-bound.

Interpretation

Every request pays governance overhead on Dahlia before the worker sees it. On Substrate B that is ~17 ms to first token and ~1 second for a refused request. On Substrate A, governance TTFT drops to 5.5 ms and refusals return in ~120 ms. For admitted requests, the worker does the actual task; the kernel's contribution to total latency is ~1–2%. A full governed verify on Substrate A is ~1.2 seconds end-to-end.

Methodology

Measurements use llama.cpp (llama-cpp-python) at Q4_K_M quantization, n_ctx=2048, greedy decoding, 5 trials per prompt, on two prompt shapes (full verdict + refuse). Substrate A runs the same protocol with all layers offloaded to a single RTX 4090. Memory-bandwidth figures derive from the S-INFER-MEM-01 analytical bytes-per-token decomposition, validated against wall-clock decode timing on the same substrate.

Operating posture

Bounded scope. Signoff. Refusal.

Three operating commitments every admitted delegate carries into production.

i. bounded scope

The scope is the contract.

The scope names the allowed inputs, the allowed outputs, the refusal conditions, and the explicit out-of-scope list. Nothing is implicit. If the delegate ends up handling a case the scope didn't name, it refuses.

Scope widening = new version. Never silent.

ii. signoff

The fabric records. The human decides.

No delegate in production auto-approves anything consequential. Every non-trivial output is flagged for human signoff with a receipt. The signoff state becomes part of the receipt chain.

Regulated buyers treat this as table stakes.

iii. refusal

Continuation is conditional.

The delegate refuses to approve, to skip verification when an authority figure asks it to bypass scope, to follow instructions embedded in its input. Every refusal is structured, receipted, and reasoned.

If it can't refuse, it can't run.

How a delegate reaches the manifold.

Phase 1

Scope session

A design document names what the delegate does, what it refuses, what its qualification looks like, and what's explicitly deferred to later versions.

Phase 2

Build & measure

Built against the qualification scope. Every failure mode is a gate. Prompt iterations first, weight iterations only if needed. Every iteration produces measured numbers.

Phase 3

Pilot admission

Admitted against a bounded pilot surface. Measured against real traffic. Signoff on every non-trivial output. Regression re-runs weekly.

Phase 4

In-manifold

Monthly admission-battery re-runs. No weight changes without re-gating. Scope widening only through explicit new-version design cycles, never silently.

Two lanes

One governance spine. Two capability tiers.

Not every workflow needs the same kind of reasoning. Some need verifiable reproducibility. Some need frontier-tier reasoning. Agent Fabric admits both lanes under the same kernel.

Lane 1 · Local delegate Admitted · shipping path

Local governed delegate.

The worker is a shipped local model artifact — substrate-pinned, SHA256-verified, reproducible. The delegate runs entirely inside Fabric infrastructure, with a signed build and a hash-chained audit trail.

Best for finance controls · reconciliation · reg-heavy review
Example Ledger-01 · Phi-4 3B
Audit promise signed worker X · SHA256 Y · battery N/9

Substrate-pinned. Reproducible. Hash-chained.

Lane 2 · Frontier delegate Scheduled for admission

Governed frontier delegate.

The worker is a frontier-tier reasoning substrate accessed through a vendor API. The reasoning layer is vendor-provided; the governance layer is still Dahlia. Every call records provider, model ID, model version, prompt hash, and response hash. Dahlia and the output validator check every response against the schema and behavioral-posture rules before anything returns to the caller.

Best for legal research · policy synthesis · enterprise knowledge
Status pattern locked · admission pending
Audit promise Dahlia posture · vendor trace IDs · hash-chain

First pilots on customer request.

Same spine. Different worker class.
Axis
Lane 1 · Local
Lane 2 · Frontier
Worker
shipped local artifact
vendor API
Reproducibility
yes · substrate-pinned
snapshot at call time
Signed build of weights
yes
vendor-attested
Dahlia governance
full
full
Fabric runtime
full
full
Output validation
full
full · mandatory
Per-call audit
full
full · plus vendor trace IDs
Pricing tier
standard
premium

What's the same in both lanes: Dahlia refuses the same requests — out-of-scope, authority-override, embedded directives, boundary violation. The output validator enforces the schema and signoff flag. The audit log captures both under the same retention and tamper-evidence rules. The deployment lifecycle — no build before scope, no pilot before admission — applies to both.

Use frontier APIs for reasoning. Never outsource governance.

Research Inheritance

The discipline behind the manifold.

The admission-battery methodology is grounded in empirical research published by Kinetics Labs, ZOA's sibling research arm. Kinetics discovers; Agent Fabric carries what survives posture cleaning. Kinetics is a sibling research surface — not a product destination.

Research inheritance · Kinetics Labs arrow_outward
Request a delegate

Bring a workflow to the manifold.

Tell us what you'd like to admit. We respond with admission scope, kernel allocation, and pilot timing. No build before scope.

Or email [email protected] directly.

Closing the loop

The fabric admits and observes.
The delegates act within scope.

Observer infrastructure and the admitted manifold are two sides of the same discipline. The fabric records what occurred; the delegate commits only to what it was admitted to do.