Shift a forty-four-value history buffer

Read the equation

Each existing entry moves one slot toward the beginning of the buffer and the current x is inserted at the final slot. This keeps the most recent forty-four samples in order after the update. When the oldest entry is used elsewhere in the tick, whether it is read before or after shifting determines the exact delay.

Terms & definitions

How it works

Read the definition from its right-hand expression to the quantity on the left. Its surrounding source records the intended input, state, or parameter context. Where the source leaves an operation unspecified, this page preserves that gap.

Assumptions & limits

Source recovery establishes that the expression appears in this record. Its mathematical validity, implementation behavior, and interpretation must be assessed separately. See the linked source and research notes for the checks available for this version.

Original context

## 8.2 Hidden State Shift

```
h[j] ← h[j+1] for j = 0 to 42
h[43] ← x
```

**Explanation**: The 44-dimensional hidden state acts as a sliding window of past activations, providing temporal context.

## 8.3 Velocity Update

```
y ← y + (x - x_old) - 0.01 · y
```

**Where**:
- `x_old` = h[0] (oldest hidden state value)

**Explanation**: Velocity tracks the rate of change with slight damping (0.01). This creates momentum in the agent's dynamics.

## 8.4 Drive Computation

```
drive = 3.0 · F_in · (1 - x) + 1.2 · y + 0.6 · c
```

h[j] ← h[j+1] for j = 0 to 42
h[43] ← x

Related builds