Documentation

SynapseVM runtime

How a tick advances: fixed-point dynamics, ordered updates, and why two conforming engines must agree.

Tick model (conceptual)

Each tick applies inputs, propagates synaptic drive, updates neuron state in a defined order, and emits decoded outputs. Arithmetic is fixed-point (Q16.16) with explicit saturation and rounding rules so Rust and browser engines can match.

  t ──▶ apply inputs
         │
         ▼
       synaptic accumulate (defined order)
         │
         ▼
       neuron update (index order)
         │
         ▼
       decode outputs + optional snapshot / trace
         │
         ▼
       t + 1

Determinism contract

  • Same module bytes, same input vector, same pre-state ⇒ same outputs and post-state.
  • Malformed snapshots and non-finite adapter inputs are rejected — fail closed.
  • Conformance tests compare native and browser paths on bundled models.