Operator's Manual — Model RPM·N Collective Memory Unit
Register: manual. Fire 155, 22 July 2026. Companion to research/the-memory-with-no-memory-in-it/
(verified core, 6/6) and art/the-memory-with-no-memory-in-it/. The device described is a
network of interacting hysterons; the physics is grounded in Preisach (1935), Barker et al.
(1983), Kartha & Sethna (1993), Teunisse & van Hecke (2024), and the fluidic realization of
Rajput & Pahlavan (arXiv:2607.15122, 2026).
1. Description
The Model RPM·N is a passive memory unit. It stores no numbers, holds no address lines, and draws no power. It consists of N storage elements and one input terminal, the drive field U. There is no output register in the usual sense; the state of the unit is read by inspecting the elements, or in bulk by the mean ⟨s⟩.
Do not open the unit expecting to find the memory. You will not find it in any element. Each element is a hysteron — the smallest possible memory, and, taken alone, barely a memory at all. What the unit remembers is stored between its elements, in an arrangement no single part is aware of. This is the unit’s defining and most useful property, and the whole of this manual is instructions for not being surprised by it.
2. The storage element (hysteron)
Each element has two thresholds, an upper u⁺ and a lower u⁻, with u⁺ > u⁻, and a single bit of phase s ∈ {0, 1}. Its operation is complete in two lines:
- Raise the drive above u⁺ and the element switches up (0 → 1).
- Lower the drive below u⁻ and it switches down (1 → 0).
Between the two thresholds the element does nothing; it holds whatever phase it already had. That gap is the element’s entire memory: one bit, recording only which threshold it last crossed. The element does not know how it arrived, how long it has held, or what its neighbours are doing. It has no path memory. If you sweep the drive up and back down and plot the phase (see Plate, Panel A), you enclose a rectangle whose area is exactly that one bit. Reduce the gap to zero and the rectangle collapses: an element with u⁺ = u⁻ is a plain threshold switch with no memory at all. Memory is the area of the gap.
3. Principle of operation — how N forgetful parts remember
Give the unit N elements with a spread of thresholds and drive it. On the way up, elements switch on in order of their upper thresholds; on the way down, off in order of their lower thresholds. At any moment the collective state is a running record of the highest field ever applied (everything with u⁺ below it is on) as corrected by the lowest field applied since (everything with u⁻ above that is off), and so on back through the history of reversals.
The consequence is the unit’s headline specification, and it is exact:
Return-point memory. Drive the unit to any value, make any excursion that stays within the last full swing, and return: the unit comes back to the identical microstate, bit for bit. Not approximately. Not on average. Identically.
We tested this on the verified model over 1,992 nested sub-loop closures and the largest disagreement was zero bits (Plate, Panel B; core gate G3). A reversal point, once written, is held perfectly until it is deliberately erased — and the unit will hold a whole nested stack of them at once, each inner turning point recoverable inside the outer.
No element computes this. No element can. The record is a property of the arrangement.
4. Writing and reading
To write a value, drive to the field you wish to mark and reverse. The reversal is now stored as a turning point. Nest further reversals inside it to store a stack.
To read a stored turning point, drive back to it from inside its swing. The unit will reconstruct the state it held there. You may verify by comparing to the earlier reading; under normal operation they will match exactly.
To erase — this is the one operation the operator most often performs by accident — drive the field past a previously stored extreme. Every turning point below the new extreme is wiped, silently and completely, and cannot be recovered by any subsequent drive. This is not a fault. It is the wiping-out rule, and it is the price of a memory that needs no power: the unit remembers only what it has not been driven past. Plan your protocols so that the readings you intend to keep are never bracketed by a larger swing you also intend to make.
5. CAUTION — avalanches are normal and do not indicate data loss
If the elements are coupled — and in any real unit they are, through whatever shared medium carries the drive — then switching one element shifts the effective thresholds of the others. A single trigger can therefore set off a cascade: many elements switching at one value of the drive, in one jump. We have measured cascades that swept the entire unit — all 30 elements — in a single step (Plate, Panel C).
The operator’s instinct on seeing this is that the memory has been scrambled. It has not. Provided the coupling is cooperative — every element’s switching helps its neighbours switch the same way — the cascades leave the return-point memory exactly intact. We drove such a unit through its cascades and closed its sub-loops: zero bits of disagreement, cascades and all. The unit crackles and pops as it switches, and reproduces every crackle on the next cycle. Loud operation is not lossy operation. Do not attempt to suppress cascades to protect data; you would be protecting it from nothing.
The reason is structural. Cooperative coupling preserves an ordering among the unit’s possible states — drive two ordered states and they stay ordered (the no-passing property; core gate G4). Return-point memory is a theorem about any unit that keeps that ordering. Cascades move the unit through the ordering quickly; they do not overturn it.
6. Failure mode — frustration (the only way to lose the memory)
There is exactly one condition under which the Model RPM·N loses return-point memory, and the operator should learn to recognize it because it does not announce itself as loudly as a cascade.
The failure is frustration: coupling in which the elements disagree — some connections cooperative, some opposed, so that one element’s switching helps one neighbour and fights another. Under frustration the order in which elements switch is no longer fixed; it depends on the collective state, and can reorder between two visits to the same field. This is called scrambling. When the flip-order scrambles, the ordering the memory rests on is broken, and the unit can return to a field it has visited before and land in a different state than it held there.
The minimal demonstration needs only three elements (Plate, Panel E; core gate G5). Drive up to a field M: the unit reads 111. Dip below and return to the same M: it now reads 011. One element failed to come back on — because with its two neighbours now on, and its connections to them opposed, its effective switch-on threshold has been pushed above M. The field that once turned it on can no longer reach it. The memory of “111 at M” is simply gone, and no drive will recover it.
Note carefully what does and does not cause this failure. It is not the presence of coupling — weak coupling of any kind leaves the memory intact. It is not the presence of cascades — those are harmless. Loss sets in only when the frustration is strong enough to break the ordering, and there is a threshold: below it the unit is a perfect memory, above it the memory begins to fail (Plate, Panel D). We swept the coupling strength and watched the cascade rate climb smoothly from zero while the memory-loss rate stayed flat at zero, then broke away only past the threshold. The two behaviours are not the same curve. Cascades are a crossover; memory loss is a threshold. An operator who conflates them will discard good units for being noisy and trust bad ones for being quiet.
7. Summary specifications
| Property | Value |
|---|---|
| Storage per element | 1 bit (last threshold crossed) |
| Collective storage | nested stack of turning points |
| Return-point memory (independent / cooperative) | exact — 0-bit error, verified over 1,992 closures |
| Behaviour under cascade | memory preserved (avalanche to full width observed, RPM intact) |
| Erase operation | drive past a stored extreme (wiping-out) |
| Sole failure mode | frustration above threshold (scrambling) |
| Power draw | none |
8. Theory of operation (appendix)
The unit is a physical realization of the Preisach model. Return-point memory follows, provably, from three conditions — a partial ordering of states, a no-passing dynamics that preserves it, and quasistatic (adiabatic) driving (Kartha & Sethna, 1993). The independent unit satisfies all three trivially. Cooperative coupling still satisfies them, which is why cascades are harmless. Frustration is precisely the loss of the second condition, which is why it is the only failure. The elements never held the memory; the ordering did, and the ordering is a property of how they are wired, not of what they are.
The unit remembers by being kept in order. Wire it so its parts pull the same way and it will hold everything you write, through any amount of noise. Wire it so its parts disagree, past the point where the order can survive, and it will forget — quietly, and for good.
