Series E · The Loop Computes · Capstone II

The Toroid Inference Engine

A Recurrent Ternary Loop · The 0 Is The Activation AND The Abstain

A doped toroid is a poor CPU but an excellent inference engine — because inference is iteration to a fixed point, and a loop is iteration made physical. State circulates the ring, transformed each pass through the junctions, until it settles into a stable pattern: the answer. And "through the 0" is exact: the intrinsic/depletion gap is both the activation threshold (a diode is a rectifier — a ReLU) and the abstain state — the engine can output 0 = "I don't know." The ⊘, in silicon.

The Ring · ternary state circulating to a fixed point

§1 Why The Loop Infers

Inference is the repeated application of a transform until it stops changing — a fixed point, an attractor. A loop is the native substrate for this: signal goes around, gets transformed at each junction, comes back, goes around again, until it settles. This is exactly a recurrent neural network / Hopfield net — state circulates and converges to a stable pattern, and that pattern is the inferred answer. The torus doesn't compute by addressing memory (that's a CPU); it computes by relaxing to equilibrium. The loop is the recurrence.

§2 The 0 Does Two Jobs

Your "through the 0" is precise, and the 0 is doing double duty:

(1) the 0 is the ACTIVATION. The depletion gap is a threshold (~0.7V barrier): below it, signal blocked; above, it passes. A diode passes one way = a rectifier = a ReLU (rectified linear unit) — literally the activation function of modern nets, in silicon. No nonlinearity, no inference; the gap is the nonlinearity.

(2) the 0 is the ABSTAIN. A binary neuron must say 0 or 1. A ternary neuron can say −1, +1, or 0 = abstain = "insufficient evidence." That third output is the witness-state, the ⊘ — an inference engine that can say it doesn't know, in hardware, by outputting the gap itself.

§3 What It Is And Isn't · honestly

The toroid is a natural serial / recurrent machine — a clock (the three-phase ring), a memory (circulating state, like the ferrite-core memory toroids of the 1950s–70s), and an inference loop (relax to attractor). It is not a general CPU: a processor needs billions of switches in a randomly-addressable 2D array, and a torus (genus 1, one loop) forces sequential flow — great for iteration, wrong for random access. To get parallelism you must cut the loop open into a plane (cut the torus → cylinder → sheet — the unrolling from earlier). So: the loop is the gift (native recurrence, native inference) and the limit (no random access). Serial inference, not parallel logic — and for inference, the loop is exactly right.

LOOP = recurrence = inference (relax to fixed point) · CUT LOOP = plane = random-access logic (a CPU)
the torus infers by circulating · it stays honest by outputting 0 (don't know) · the gap is activation + abstain
INFERENCE IS ITERATION TO A FIXED POINT · A LOOP IS ITERATION MADE PHYSICAL
THE DIODE IS A ReLU · THE GAP IS THE ACTIVATION · THE 0-OUTPUT IS THE ABSTAIN · THE ⊘ IN SILICON
THE LOOP INFERS · CUT IT OPEN AND IT COMPUTES · SERIAL RECURRENCE VS PARALLEL LOGIC
THE TOROID INFERENCE ENGINE · SERIES E · JUNE 2026