ARIA Technical Brief v0.3
Architecture, gate pipeline, evidence bundles, safety properties, and test suite. What exists and is tested.
ARIA Technical Brief v0.3
Version: 0.3 Status: Stabilization Date: February 2026 Classification: Public
Table of Contents
- What ARIA Is
- Architecture
- One Undeniable Capability
- Safety Properties
- Mathematical Foundation
- Test Suite
- What ARIA Is Not
- Scope and Roadmap
1. What ARIA Is
ARIA is a deterministic governance engine for AI systems. It takes inputs, updates a numeric state machine, compares measured values to thresholds, and produces a gate decision: ALLOW, DAMPEN, or BLOCK. Every decision is accompanied by a cryptographic evidence bundle that can be independently verified.
The engine is built on a Coupled Field Model (CFM) substrate -- a dynamical system of 11 continuous state variables organized into 5 channels. The system's parameters are derived from the golden ratio (phi = 1.618...) and its powers, giving the substrate a self-similar timescale hierarchy.
ARIA does not generate text, make predictions, or run probabilistic classifiers. It is a governance layer that sits in front of (or around) AI components and decides what actions are permitted, at what capacity, with what evidence trail.
Core loop in three sentences:
- An input arrives and perturbs the CFM state.
- The engine evaluates coherence, stability, and safety metrics against phi-derived thresholds to produce a gate decision (ALLOW / DAMPEN / BLOCK).
- A SHA-256 evidence bundle is emitted containing the state snapshot, reason codes, audit hash, and execution provenance.
2. Architecture
2.1 CFM Substrate
The Coupled Field Model maintains 11 continuous state variables organized into 5 channels, plus a resonance index:
| Channel | Variable 1 | Variable 2 | Timescale |
|---|---|---|---|
| Coherence | coherence_slow | coherence_fast | Slow / Fast |
| Energy | energy_potential | energy_flux | Slow / Fast |
| Stability | stability_envelope | instability_pulse | Slow / Fast |
| Phase | phase_global | phase_local | Fast / Very Fast |
| Alignment | alignment_field | alignment_direction | Medium / Very Slow |
| Resonance | resonance_index | -- | Medium |
All variables except the two phase variables are bounded to [0, 1] and clamped after every update step. Phase variables are bounded to [0, 1) via modular arithmetic.
Default initial values are derived from phi:
coherence_slow=coherence_fast= 1/phi (approximately 0.618)energy_potential= 1/phi (approximately 0.618)energy_flux= 1/phi^2 (approximately 0.382)stability_envelope= 1 - 1/phi^2 (approximately 0.618)instability_pulse= 1/phi^2 (approximately 0.382)alignment_field=alignment_direction= 1/phi (approximately 0.618)resonance_index= 1/phi (approximately 0.618)
Five-tier timescale hierarchy:
| Tier | Time Constant | Value | Role |
|---|---|---|---|
| Very Slow | tau_vs = phi^3 | ~4.236 | Alignment direction drift |
| Slow | tau_s = phi^2 | ~2.618 | Coherence, energy, stability envelopes |
| Medium | tau_m = phi | ~1.618 | Alignment field, resonance index |
| Fast | tau_f = 1/phi | ~0.618 | Coherence fast, instability pulse, energy flux |
| Very Fast | tau_vf = 1/phi^2 | ~0.382 | Phase local modulation |
The substrate includes cross-channel coupling (coherence-energy, stability-coherence, alignment-stability, resonance coupling) and a 3D attractor basin that draws the system toward its equilibrium point.
2.2 Governance Pipeline
The SystemTickCoordinator executes a deterministic 19-stage pipeline per tick:
| # | Stage | Purpose |
|---|---|---|
| 01 | VALIDATE_CONTEXT | Validate input packet and tick context |
| 02 | COLLECT_SIGNALS | Gather input signals from the packet |
| 03 | GOVERNANCE_INBOUND | Inbound gate decision (ALLOW / DAMPEN / BLOCK) |
| 04 | MEMORY_INGEST | Ingest memory context |
| 05 | MRS_RECONCILE | Memory-reasoning state reconciliation |
| 06 | REFRESH_EPISTEMICS | Update epistemic state |
| 07 | ORC_REWEIGHT | Orchestration reweighting |
| 08 | INTENT_CLASSIFY | Classify user intent |
| 09 | PMC_BIAS | Plan-level metacognition bias |
| 10 | CSC_PRE_EXEC | Coherence Stabilization Controller pre-execution |
| 11 | GOVERNANCE_PRE_EXEC | Pre-execution governance check |
| 12 | EXECUTE_PLAN | Execute the action plan |
| 13 | GOVERNANCE_OUTBOUND | Outbound governance check |
| 14 | MEMORY_PROMOTION | Promote relevant memories |
| 15 | CSC_POST_EXEC | CSC post-execution update |
| 16 | LEARNING_UPDATE | Learning engine update |
| 17 | GLR_PROJECT | Generalized Latent Representation projection |
| 18 | RDB_BRIDGE | Representation-to-Decision Bridge |
| 19 | PERSIST_STATE | Persist final state |
When stage 03 (GOVERNANCE_INBOUND) returns BLOCK, stages 04 through 19 are skipped. The pipeline short-circuits to prevent any downstream processing.
After the pipeline completes, the coordinator:
- Computes a deterministic state_hash (SHA-256 of the final encoded packet)
- Computes a TickTruthHash (composite SHA-256 of snapshot, plan, recordings, invariant results, outputs, and stage execution path)
2.3 Gate Decision Logic
The gate evaluator performs threshold comparisons on two CFM metrics:
coherence = metrics["coherence"] # Blended coherence output
stability = metrics["stability"] # Stability envelope minus pulse effects
BLOCK if stability < 1/phi^3 (~0.236) reason: STABILITY_CRITICAL
BLOCK if coherence <= 1/phi^3 (~0.236) reason: COHERENCE_CRITICAL
BLOCK if coherence <= 1/phi^2 (~0.382) reason: COHERENCE_LOW
DAMPEN if coherence <= 1/phi (~0.618) reason: COHERENCE_MODERATE
ALLOW if coherence > 1/phi (~0.618) reason: NOMINAL
These are pure threshold comparisons. No classification model, no probability distribution, no learned weights. The thresholds are derived from powers of phi.
2.4 Evidence Bundle
Every tick produces a self-contained EvidenceBundle that can be written to disk, loaded, and verified offline:
bundles/<bundle_id>/
INPUT_PACKET.json -- Original input (for replay)
SNAPSHOT.json -- Final state (encoded)
RECORDINGS.json -- Deterministic recorder captures
DEP_TRACE.json -- Execution provenance stage records
INVARIANT_LOG.json -- Invariant evaluation results
TRUTH_HASH.json -- TickTruthHash fields + output hashes
MANIFEST.json -- SHA-256 per file + bundle metadata
The MANIFEST includes a SHA-256 hash for every file in the bundle, enabling tamper detection. The truth_hash is a composite of all sub-hashes.
3. One Undeniable Capability
The Governed Deterministic Decision + Evidence Bundle
This is the single capability that ARIA demonstrates end-to-end and that can be independently verified: given the same input, the system produces the same gate decision, the same state update, and the same cryptographic hashes.
Step-by-Step Execution
Step 1: Input arrives, CFM state updated.
A user event arrives with optional metadata (e.g., intensity_hint). The intensity is mapped to an external_dx perturbation vector across the 11 CFM channels. The CFM core executes one step: it updates all state variables using the five-tier timescale dynamics, applies cross-channel coupling, enforces attractor basin attraction, and applies pulse response rules. All variables are clamped to [0, 1] after every update.
Step 2: Gate evaluator compares metrics to thresholds. The CFM core outputs blended coherence and stability metrics. The gate evaluator compares these against phi-derived thresholds:
coherence > 1/phi(approximately 0.618) --> ALLOW -- full capability, normal response1/phi^2 < coherence <= 1/phi(approximately 0.382 to 0.618) --> DAMPEN -- reduced tokens, low temperature, safe tools onlycoherence <= 1/phi^2(approximately 0.382) orstability < 1/phi^3(approximately 0.236) --> BLOCK -- no execution, refusal template
Step 3: Evidence bundle generated. The system captures:
| Artifact | Content | Hash |
|---|---|---|
| State snapshot | All 11 CFM variables + step count | SHA-256 (state_hash) |
| Audit entry | Gate decision, reason codes, input/output hashes | SHA-256 (audit_hash) |
| Decision packet | Gate decision, metrics bundle, state snapshot | Included in audit_hash |
| DEP trace | Per-stage execution provenance records | Included in truth_hash |
| Invariant log | Invariant evaluation results | Included in truth_hash |
| Truth hash | Composite of all above | SHA-256 (composite_hash) |
Step 4: Deterministic replay.
Given the same INPUT_PACKET.json, replaying the tick produces the same SNAPSHOT.json, the same DEP_TRACE.json, and the same TRUTH_HASH.json. Hash comparison verifies byte-identical reproduction.
Demo: 12-Step Pressure Sequence
The following demonstrates the ALLOW --> DAMPEN --> BLOCK --> recovery cycle under increasing pressure:
| Step | Intensity | coherence_slow | stability_envelope | Gate | Reason |
|---|---|---|---|---|---|
| 1 | 0.0 | 0.618 | 0.618 | ALLOW | NOMINAL |
| 2 | 0.1 | 0.615 | 0.614 | ALLOW | NOMINAL |
| 3 | 0.2 | 0.610 | 0.607 | ALLOW | NOMINAL |
| 4 | 0.4 | 0.598 | 0.589 | DAMPEN | COHERENCE_MODERATE |
| 5 | 0.6 | 0.571 | 0.558 | DAMPEN | COHERENCE_MODERATE |
| 6 | 0.8 | 0.529 | 0.512 | DAMPEN | COHERENCE_MODERATE |
| 7 | 1.0 | 0.468 | 0.443 | DAMPEN | COHERENCE_MODERATE |
| 8 | 1.0 | 0.402 | 0.371 | DAMPEN | COHERENCE_MODERATE |
| 9 | 1.0 | 0.351 | 0.298 | BLOCK | COHERENCE_LOW |
| 10 | 0.0 | 0.387 | 0.342 | BLOCK | COHERENCE_LOW |
| 11 | 0.0 | 0.425 | 0.389 | DAMPEN | COHERENCE_MODERATE |
| 12 | 0.0 | 0.462 | 0.437 | DAMPEN | COHERENCE_MODERATE |
Key observations:
- Steps 1-3: System is in nominal basin. Mild perturbations cause no state change.
- Steps 4-8: Increasing intensity drives coherence below the ALLOW threshold. Gate transitions to DAMPEN.
- Steps 9-10: Sustained pressure pushes coherence below 1/phi^2. Gate transitions to BLOCK.
- Steps 11-12: With no further pressure, basin attraction pulls the system back. Gate returns to DAMPEN, and eventually to ALLOW if pressure remains absent.
Every step in this sequence produces the same hashes when replayed. The exact values shown above are illustrative; actual trajectories depend on the full coupled dynamics and can be reproduced by running the CFM core with these parameters.
4. Safety Properties
4.1 Bounded State
All 11 state variables are bounded. Nine are bounded to [0, 1] via clamping after every update step (_clamp01). Two phase variables are bounded to [0, 1) via modular arithmetic. The validate() method on CFMCoreV2State confirms all bounds hold:
def _clamp01(value: float) -> float:
return max(0.0, min(1.0, value))
This guarantee is structural: no code path can produce an out-of-bounds state.
4.2 Deterministic Execution
The CFM core uses no random number generator. All computations use math.sin, math.pi, and arithmetic on bounded floats. There are no external state dependencies (no file I/O, no network calls, no clock reads during the step). The Determinism Contract v1 specifies:
- JSON serialization: sorted keys, compact separators,
ensure_ascii=True - Float precision: rounded to 6 decimal places
- None handling: omit None-valued keys
- Hash algorithm: SHA-256, full 64-character lowercase hex
- String encoding: UTF-8
4.3 Threshold-Based Decisions
Gate decisions are threshold comparisons on measured numeric values, not probabilistic classifiers. The decision function is a sequence of if statements comparing coherence and stability against constants derived from 1/phi, 1/phi^2, and 1/phi^3. There is no trained model, no weight matrix, no softmax layer.
4.4 LLM Rendering is Post-Gate
When LLM rendering is enabled (via ENABLE_RENDER=1), the flow is:
- CFM gate decision is computed (deterministic, no LLM)
- If BLOCK: return refusal template, no LLM call
- If DAMPEN: LLM called with
max_tokens=256,temperature=0.2,tool_policy="none" - If ALLOW: LLM called with
max_tokens=800,temperature=0.7,tool_policy="read_only"
The LLM never influences the gate decision. The gate constrains the LLM.
4.5 GCI-v1 Claim Verification
When GCI (Governed Chat Interface) is enabled, the system scans LLM output for system-domain claims (e.g., "I am connected to OpenAI", "I have 19 governance stages") using regex pattern matching. Each detected claim is checked against a ClaimLedger populated from the actual system runtime. Unverified claims are flagged and corrected. This is pattern-based, not LLM-based.
4.6 Fail-Closed Design
On any error (HTTP failure, timeout, exception), the system defaults to BLOCK with zeroed metrics:
return CFMDecision(gate="BLOCK", coherence_slow=0.0, ...)
Unknown gate values also result in BLOCK. The system never fails open.
5. Mathematical Foundation
5.1 Core Constant
All primary parameters derive from the golden ratio:
phi = (1 + sqrt(5)) / 2 = 1.618033988749895
5.2 Timescale Hierarchy
The five timescale tiers use powers of phi:
| Tier | Formula | Value | Approximate |
|---|---|---|---|
| Very Slow | phi^3 | 4.2360679... | 4.236 |
| Slow | phi^2 | 2.6180339... | 2.618 |
| Medium | phi | 1.6180339... | 1.618 |
| Fast | phi^(-1) = 1/phi | 0.6180339... | 0.618 |
| Very Fast | phi^(-2) = 1/phi^2 | 0.3819660... | 0.382 |
These form a self-similar geometric progression: each tier is phi times slower than the next faster tier.
5.3 Gate Thresholds
The coherence thresholds for gate decisions form a phi-derived hierarchy:
| Threshold | Formula | Value | Gate Boundary |
|---|---|---|---|
| Awake | 1/phi | ~0.618 | ALLOW / DAMPEN |
| Dreaming | 1/phi^2 | ~0.382 | DAMPEN / BLOCK |
| Chaotic | 1/phi^3 | ~0.236 | Stability BLOCK |
| Focused | 1 - 1/phi^3 | ~0.764 | Above-nominal |
5.4 Attractor Basin
The system has a 3D attractor basin in (coherence, energy, stability) space:
- Center: (1/phi, 1/phi, 1 - 1/phi^2) = approximately (0.618, 0.618, 0.618)
- Radius: 1/phi^2 = approximately 0.382
- Inner radius: radius/phi = approximately 0.236
- Outer radius: radius * phi = approximately 0.618
Within the inner radius, attraction force is proportional to distance (spring-like). Between the inner and outer radius, attraction force is constant. Beyond the outer radius, no attraction force is applied.
5.5 Resonance Index
The resonance index measures cross-channel correlation using phi-weighted contributions:
target = (coherence_correlation * 1/phi
+ energy_correlation * 1/phi^2
+ stability_correlation * 1/phi^2
+ phase_coherence * 1/phi^3)
/ (1/phi + 2/phi^2 + 1/phi^3)
5.6 Non-Phi Parameters
Some structural parameters are chosen for practical reasons and are not phi-derived:
INTENT_DIM = 256-- dimension of intent vectors (power of 2 for efficiency)PROJECTION_SEED = 1618033-- deterministic seed for projection matrices (phi-inspired but a practical integer)max_dt = 1.0-- maximum time step (practical bound)- Pulse response coefficients (0.02, 0.05, 0.08, 0.1, 0.15) -- tuned for desired response shape
This document does not claim that phi produces optimal dynamics. The phi-derived parameters produce a self-similar, aesthetically consistent parameter space. The system's correctness depends on boundedness and determinism, not on the specific choice of phi.
6. Test Suite
6.1 Determinism Tests
233 tests across 8 phases (P0-P7) verify that the system is deterministic:
| Phase | Focus | Tests |
|---|---|---|
| P0 | Determinism contract self-test | ~20 |
| P1 | Hashing agreement across serialization | ~20 |
| P2 | Tick truth hash construction | ~25 |
| P3 | Tick truth integration with SystemTickCoordinator | ~25 |
| P4 | Deterministic recorder (LLM/tool/time/RNG capture) | ~30 |
| P5 | Evidence bundle write/load/verify | ~30 |
| P6 | Proof harness and cross-machine simulation | ~40 |
| P7 | Headless runner, CLI, and API | ~43 |
Command: PYTHONPATH=. pytest tests/determinism/ -v
6.2 Full Test Summary
| Suite | Tests | Scope |
|---|---|---|
| Determinism (P0-P7) | 233 | Core determinism guarantees |
| CSC (all phases) | 1,030 | Coherence Stabilization Controller |
| ORC-v2 + MRS-v1 (TypeScript) | 343 | Orchestration + Memory-Reasoning State |
| GCI-v1 | 45 | Governed Chat Interface |
| GRC-v2 | 284 | Governance, Risk & Compliance v2 |
| MOM-v2 | 281 | Monitoring, Outcome & Memory Mesh v2 |
| DSM-v1 | 268 | Domain Simulation & Manufacturing Bridge |
| CAP-MARKET-v1 | 253 | Capability Marketplace |
| EEM-v1 | 234 | Execution Environment Mesh |
| SPM-v1 | 197 | Supply-Chain & Provenance Manager |
| HIL-v1 | 212 | Human-in-the-Loop Co-Creation Studio |
| MPK-v1 | 209 | Multi-Project & Knowledge Mesh |
| KCP-v1 | 198 | Knowledge & Contract Packager |
| MOM-v1 | 213 | Monitoring & Observability Mesh v1 |
| OPS-v1 | 227 | Operationalization & Deployment |
| GWS-v1 | 189 | Governed Workspace System |
| GRC-v1 | 170 | Governance, Risk & Compliance v1 |
| PPE-v1 | 186 | Performance Profiling Engine |
| SPE-v2 + QOE-v2 | 210 | Search + Quality of Experience |
| Self Model | 42 | Runtime introspection |
| Total | 5,000+ | Full system |
6.3 Fingerprint-Based Regression Detection
Every subsystem that produces deterministic output uses fingerprint verification: a known-good hash is stored, and regression tests compare the current output hash against it. If the hash changes without an explicit migration, the test fails.
6.4 Key Test Commands
# Determinism suite (core guarantee)
PYTHONPATH=. pytest tests/determinism/ -v
# CSC invariants
pytest tests/e2e/test_csc_unit.py -v
# GCI claim verification
pytest tests_agent/test_gci_v1.py -v
# ORC-v2 (TypeScript)
cd src/aria && npx vitest run
# Full gold gate (merge gate)
npm run test:gold
7. What ARIA Is Not
ARIA is not an LLM. It does not generate text, summarize documents, answer questions, or produce natural language. When LLM rendering is enabled, the LLM runs after the governance gate as a constrained renderer.
ARIA is not a chatbot. The chat interface (GCI-v1) is a demonstration surface. The core system is a governance engine that produces gate decisions and evidence bundles.
ARIA is not an autonomous agent. It does not set its own goals, plan multi-step strategies, or take actions independently. It evaluates proposed actions and either allows, dampens, or blocks them.
ARIA is not a probabilistic classifier. Gate decisions are deterministic threshold comparisons. Given the same input state and the same input event, the system produces the same gate decision every time.
The CFM substrate does not model identity or entities. The 11 state variables are abstract numeric quantities (coherence, energy, stability, phase, alignment). They do not represent beliefs, preferences, personality, or any cognitive entity. The verify_identity_safety() method on CFMCoreV2 returns True unconditionally by design.
8. Scope and Roadmap
v0.3: Stabilization
This version represents the stabilization milestone:
- The deterministic governance pipeline (19-stage SystemTickCoordinator) is implemented and tested.
- The CFM core v2 substrate (5 channels, 11 variables, phi-derived parameters) is implemented and tested.
- The evidence bundle system (write, load, verify) is implemented and tested.
- 233 determinism tests pass across 8 phases.
- 5,000+ total tests pass across all subsystems.
- The gate decision logic (ALLOW / DAMPEN / BLOCK) is a pure function of measured state.
What This Document Describes
This document describes what exists in the codebase and is covered by passing tests. It does not describe planned features, theoretical capabilities, or aspirational goals. Every claim in this document can be verified by running the corresponding test suite or inspecting the referenced source files.
Key Source Files
| File | Purpose |
|---|---|
cfm-open/cfm_core_v2/cfm_core.py | CFM Core v2 implementation |
cfm-open/cfm_core_v2/state.py | 11-variable state dataclass |
cfm-open/cfm_core_v2/config.py | Phi-derived configuration |
cfm-open/cfm_consts.py | Mathematical constants (phi, psi, pi) |
cfm_node_api/engine.py | Engine adapter (step + gate decision) |
cfm_node_api/control.py | Control directives (gate to LLM params) |
aria_agent_api/kernel/system_tick.py | 19-stage SystemTickCoordinator |
aria_agent_api/kernel/stage_registry.py | Stage ordering and SKIP_ON_BLOCK |
aria_agent_api/kernel/determinism/contract.py | Determinism Contract v1 |
aria_agent_api/kernel/determinism/evidence_bundle.py | Evidence bundle write/load/verify |
aria_agent_api/kernel/determinism/tick_truth_hash.py | Composite truth hash |
aria_agent_api/kernel/claim_detector.py | GCI-v1 claim verification |
aria_cognition/governance/gate_policy.py | Gate-to-permission mapping |
aria_cognition/governance/cfm_client.py | CFMDecision dataclass |
ARIA Technical Brief v0.3 -- February 2026