×
Canonical State-Vector N-Back Protocol (≥0.90 G-Load)
CORE CONCEPT: This is deterministic state-vector simulation with persistent canonical identity. Each symbol maintains an immutable ID across ALL trials, accumulating transformations through multi-dimensional state vectors that compound over time.
Compliance guardrails
These constraints keep Compressed Math Mode aligned with canonical verification.
Compliance guardrails — Compressed Math Mode
- Max 9 tokens per premise (e.g.,
a × b - c ÷ d + e).
- Allowed tokens only: letters a–e (optionally
√ prefix, % postfix, or a single digit suffix), and operators × - ÷ + =.
- Surface is still presentation only: MATCH depends on the canonical trajectory.
- “=” means the left group must balance the right at check time.
- Match ≠ Repeat: When a match is required, the surface must change. At least
MIN_SURFACE_DELTA tokens must differ from the reference, ignoring case (default: 3). Case-only changes never count.
- Canonical-invariance: Math-mode matches are generated by re-rendering the same underlying operator plan; only the surface varies.
- Allowed “no-op” markers for surface variety: suffix
0 (now) and postfix % (hold) are permitted; both compile to no state change.
- Side-swap allowed: Swapping both sides of
= is permitted and preserves the same balance check.
Surface Diversity (Why words change)
Premises always use five simple words, but the same hidden IDs and operations can appear with different words (e.g., HOUND = DOG, PRESS = PUSH).
Matches are judged by the hidden simulation, not by repeated words. If a match is possible, the surface will still look different on purpose.
I. Theoretical Foundation: From Topology to Trajectory
Unlike pattern matching, this requires genuine mental physics simulation. Each symbol is a quantum-like entity with:
- Canonical Identity (ID): Persists across entire session
- State Vector: {x, y, z, energy, momentum, phase, information}
- Accumulated History: States compound across all premises
- Scheduled Effects: Operations can execute in future trials
- Conservation Laws: Total energy/momentum must balance
II. Progressive Difficulty Levels
Level 1 (0.85g): Current topology matching
Level 2 (0.90g): Canonical tracking + state accumulation
Level 3 (0.93g): + Scheduled effects + conservation
Level 4 (0.95g): + Recursive effects + counterfactuals
Level 5 (0.97g+): + Quantum superposition + entanglement
III. Dual-Layer Representation
Each premise has two layers:
- Surface: 5 simple words you see (DOG, CAT, etc.)
- Canonical: Hidden persistent IDs (D1, C1, etc.)
Synonyms map to same ID: DOG→D1, HOUND→D1, CANINE→D1
IV. Example 1: Basic Identity Tracking
Trial 1: "CIRCLE pushes SQUARE moving rightward"
Internal: C1 pushes S1, C1{x:-1, energy:9}, S1{x:+2, energy:11}
Trial 3: "SPHERE pushes SQUARE moving rightward"
Internal: C1 pushes S1 (SPHERE maps to same C1!)
MATCH! CIRCLE and SPHERE both → canonical ID "C1"
V. Example 2: State Accumulation
Setup: DOG starts at position (0,0), energy 10
Trial 1: "DOG runs toward CAT quickly"
After: DOG{x:+3, energy:8}, CAT{x:0, energy:10}
Trial 2: [unrelated premise]
Trial 3: "HOUND sprints toward FELINE rapidly"
Must check: Does HOUND (=DOG) start from x:3, energy:8?
DOG's state from Trial 1 carries forward!
Match requires identical evolution from accumulated state.
VI. Example 3: Conservation Laws
Trial 1: "ENGINE pushes CART forward strongly"
Internal: E1{momentum:-2}, C1{momentum:+2}
Total momentum: 0 ✓ (conserved)
Trial 3: "MOTOR pushes WAGON forward strongly"
Internal: M1{momentum:-1}, W1{momentum:+3}
Total momentum: +2 ✗ (violation!)
NO MATCH - conservation law broken!
VII. Example 4: Scheduled/Delayed Effects
Trial 1: "TRIGGER activates TIMER counting down"
Schedules: TIMER will explode at Trial 3 (t+2)
Trial 2: [unrelated - but TIMER still counting]
Trial 3: [TIMER explodes automatically!]
You must track this was scheduled, not new.
Delayed effects create temporal dependencies.
VIII. Example 5: Recursive Effects (Level 4+)
Trial 1: "OSCILLATOR triggers WAVE repeating periodically"
Schedules: WAVE pulses every 2 trials recursively
Trial 3: WAVE pulses (first scheduled pulse)
Trial 5: WAVE pulses (second scheduled pulse)
Trial 7: WAVE pulses (continues recursively)
Must track recursive patterns mentally!
IX. Example 6: Counterfactual Verification (Level 4+)
Trial 1: "RED-ATOM splits forming TWO-PARTICLES"
To verify match with Trial 3:
1. Primary hypothesis: Same split pattern ✓
2. Counterfactual 1: What if RED≠BLUE? Test...
3. Counterfactual 2: What if energy differs? Test...
4. Counterfactual 3: What if momentum unbalanced? Test...
Match only if robust to all plausible alternatives.
X. Transformation Operators
PUSH → Δmomentum_x = +2, Δenergy = -1
PULL → Δmomentum_x = -2, Δenergy = -1
SPLIT → divide energy equally, mark original as consumed
MERGE → combine energies, mark originals as consumed
ROTATE → swap momentum components, Δphase = π/4
CASCADE → propagate 50% effect to connected symbols
TRIGGER → schedule future effect at t+k
XI. Proof Trace Requirements
Every match determination includes:
- Symbol mapping (surface → canonical ID)
- State evolution for each symbol
- Conservation verification at each step
- Counterfactual robustness check (Level 4+)
- Confidence score ≥0.90 for match claim
XII. Cognitive Load Amplification
Your working memory must simultaneously:
- Maintain identity mappings (surface → canonical)
- Track multi-dimensional state vectors
- Hold n-back history while processing current
- Simulate temporal evolution forward
- Verify conservation constraints
- Monitor scheduled effects queue
- Test counterfactual alternatives (Level 4+)
- Handle quantum superposition (Level 5)
XIII. Why This Achieves ≥0.90 G-Load
This protocol transforms n-back from pattern recognition into genuine mental physics simulation. No heuristics suffice—only complete computational modeling succeeds. The mind becomes a deterministic state machine, tracking each symbol's journey through abstract phase space while maintaining global conservation laws.
The Beautiful Paradox: Though the surface remains five simple words, beneath lies a complete computational universe demanding total cognitive commitment. Every neuron recruited, every quantum of attention consumed, all to answer: "Does this universe evolve identically to the one I witnessed n trials ago?"
Remember: Pattern matching will fail. You must track actual symbol states through time. This is pure fluid intelligence at its limit.