A Deterministic Cognitive Architecture

A mind navigating
a storm.

Most AI systems optimize a single objective.
Reality does not.

Survival, legality, morality, uncertainty, and opportunity compete in real time. When pressures conflict, how does a system decide?

Maelstrom models cognition as regime arbitration under constraint.

Not a unified planner.
A structured competition of incompatible objectives — resolved through deterministic arbitration.

Scroll to explore

The Core Loop

Five phases.
Every cycle.

Each decision passes through structured conflict:

Evaluate Clarity, risk assessment
Generate Optionality, alternative paths
Select Defensibility under regime constraints
Execute Commitment and action
Reflect Structural comparison and regret

Conflict is not failure.
It is the mechanism through which volition emerges.

Regime Arbitration

Six regimes.
One active at a time.

At any moment, one regime dominates because its penalty gradient is rising fastest.

r*(t) = argmaxr (ΔPr / Δt) The system does not "choose" a regime. The environment forces the shift.

Transitions are hysteretic:

Entry into crisis is fast.
Recovery is slow.

Arbitration is continuous.
Dominance is emergent.

Legality Deformation

Stress reshapes
what is admissible.

Stress is not a scalar penalty.
It deforms the legality graph — the space of procedurally valid transitions.

A'ij = Aij − αij · S(t) Admissibility shrinks under stress
W'ij = Wij + βij · S(t) Transition cost increases

High stress does not merely reprioritize options.
It removes entire pathways from consideration.

Deliberation operates within what remains admissible.

At low stress, all five transitions are admissible. The full deliberative loop operates.

Bypass Dynamics

When deliberation becomes
too expensive.

Under extreme stress or latency pressure, full evaluation may exceed the available budget.

The system collapses into a lawful shortcut — a bypass.

Bypasses are not bugs.
They are regime-appropriate compressions of the loop.

Bypasses trade completeness for viability.

Counterfactual Regret

The path not taken
is preserved.

Each cycle archives:

  • Vetoed proposals
  • Bypassed paths
  • Non-selected alternatives
Regret(t) = max(counterfactual_value) − executed_value Positive regret indicates a superior forgone alternative.

Regret is not emotion.
It is structural comparison.

Accumulated regret informs doctrine — persistent modifications to future behavior formed from repeated constraint.

The system learns without replaying catastrophe.

Perfect Determinism

Same input. Identical trace.
Every time.

Maelstrom is fully deterministic.

Given the same scenario specification and seed, the runtime produces bit-identical traces.

Validated over:

Every cycle is hashed.
Every regime shift, veto, bypass event, and regret score is logged.

Merkle-verified trace integrity.
Full post-hoc auditability.

Why It Exists

Performance alone
is insufficient.

Autonomous systems increasingly operate in environments where:

Maelstrom provides:

It is a foundation for systems where legitimacy, survivability, and recoverability matter as much as output quality.

View on GitHub →