A conceptual plan — where the bits live, where the arithmetic happens, and why those are not the same cavity.
The tempting idea is that the replicator's build volume, being a programmable holographic cavity already, should double as the machine's computer. It should not, and the reason is a mode count.
A cavity's information capacity scales as its volume divided by the cube
of the wavelength it operates at — N ≈ 8πV/3λ³. The build
volume is 18.5 L. Run that number for each carrier the machine actually
uses:
| carrier in the build volume | λ | independent modes |
|---|---|---|
| acoustic, 100 kHz in air | 3.4 mm | 3.8 × 10⁶ |
| acoustic, ~1 MHz in melt | ~5 mm | 1.2 × 10⁶ |
| microwave, 10 GHz | 30 mm | 5.7 × 10³ |
| optical, 500 nm | 0.0005 mm | 1.2 × 10¹⁸ |
Twelve orders of magnitude. The same 18.5 litres holds a million-ish addressable modes for sound and a quintillion for light. The build chamber is a poor computer because it is a good replicator: moving matter needs long wavelengths and real forces, and long wavelengths are exactly what makes a cavity information-poor.
Note the ordering trap in that table: microwave has fewer modes than acoustic in the same box — 10 GHz is a longer wavelength than 100 kHz sound. The EM channel earns its place by speed, bandwidth and sensing precision, not capacity.
So the ruling is: do not merge the cavities. Build one architecture instantiated at three wavelengths, each sized for what it is good at, and let them share the mathematics and the compiler rather than the volume.
What justifies calling this one system is that the same operation runs in all three: interfere a reference wave with an object wave, store the interference, then re-illuminate to reconstruct. Memory, actuator and processor are that one operation wearing three hats.
| cavity | λ / medium | role | status |
|---|---|---|---|
| Build chamber | acoustic + µwave, 18.5 L | the actuator: shape matter, scan objects. ~10⁶ modes is plenty for shaping and far too few for arithmetic | specified — construction paper |
| Compute cavity | optical, toroid, cm-scale | the processor: recurrent EML graph, settles to a fixed point in ns; depth set by Q | PROTOTYPED — $10 toroid |
| Store | optical, phase-change medium | the memory: non-volatile, rewritable, associative; ceiling (V/λ³)×bits-per-mode ≈ 10¹–10² TB/cm³, real limit set by M# (§3.1) | plan — this document |
The compiler is what makes them one machine. The field compiler already emits boundary field states for the build chamber; the same synthesis step — record reference against object, modulate the surface — is what programs a holographic aperture, and what writes a page into the memory volume. One toolchain, three back-ends.
An earlier draft of this plan proposed a four-level hierarchy with an SLM/LCD fast boundary and a write-once photopolymer archive on the ends. Both ends collapse, and the architecture is better for it:
What remains is two layers and a bridge:
| layer | medium | timescale | persistence | holds |
|---|---|---|---|---|
| Live state | the optical compute core — the field standing in the cavity | ps–ns, reconfigured at the drive rate | one coherence time | the working set: whatever is being computed, scanned or reconstructed right now |
| Store | phase-change material (GST, Sb₂S₃) | ns switching, finite endurance | non-volatile, no power | everything persistent: patterns, transforms, weights |
The core is the bridge, and it runs in both directions. Every path in the machine passes through the live state: chamber → core (scan data in), core → PCM (consolidate), PCM → core (recall), core → chamber (drive out). Reading and writing are the same optical operation run with the reference and object waves exchanged, which is why one element can serve both.
An earlier version of this section quoted ~200 MB/cm² per layer, derived from "one bit per (λ/2)² spot." That figure was wrong, and wrong in an instructive way: it is a binary optical disc model — one bit per resolvable spot on a surface — applied to a medium that does not work that way. A hologram does not put a bit in a place; it writes a distributed interference pattern across a volume, and many such patterns coexist there, separated by Bragg selectivity in angle, wavelength, shift or phase code. Capacity scales with thickness, and the correct accounting is mode counting, not spot counting.
| accounting | modes or bits per cm³ | note |
|---|---|---|
| one mode per λ³ | 8 × 10¹² modes → 1 TB/cm³ at 1 bit/mode | the conventional statement of the bound |
| one mode per (λ/2)³ (Nyquist cell) | 6.4 × 10¹³ modes → 8 TB/cm³ | the aggressive but defensible cell size |
| × 4 bits/mode (amplitude × phase × polarisation) | 32 TB/cm³ | the multidimensional-encoding direction (Optica 13, 591, 2026) |
| × 8 bits/mode | 64 TB/cm³ | optimistic on SNR |
So the sugar-lump claim comes back, and larger than before: at 4 bits per mode, 1 cm³ holds ~32 TB ≈ 320 000 objects. Storage is emphatically not the constraint.
η = (M#/M)² — the medium's M-number over the page count,
squared. With a good M# of 20: 100 pages gives η ≈ 4 × 10⁻²; 1 000 pages
gives 4 × 10⁻⁴; 10 000 pages gives 4 × 10⁻⁶. Recall signal collapses
quadratically in the very quantity we are trying to maximise. The λ³
ceiling is never what stops a real system — the detector noise floor is.
Any capacity number in this plan is therefore a ceiling awaiting an M#
measurement, and step 2 of §7 exists to get one.Counting modes rather than spots changes not just the arithmetic but the unit. The medium's natural quantum is not a bit. It is a stored interference pattern — which is to say, a chord.
That matters because a hologram is natively associative: illuminate it with a probe and every stored page responds at once, each with its own correlation, in the time light takes to cross the volume — a bank of matched filters all firing in parallel. "What is at address n" and "what do you have that looks like this" are different questions, and the second is the one this machine actually asks.
Storing chords rather than bits deletes a whole layer. The
.pattern format is already complex poles and port-vectors; the
medium already stores complex interference patterns. Serialising chords into
bits, writing bits into a medium that wanted patterns, then reconstructing
chords on readout is a round trip through a representation neither end
needed. Write the chords.
So the honest figure of merit for this store is not bytes but distinguishable, retrievable patterns per volume — limited by the same M# budget, because what degrades with load is precisely the ability to tell stored patterns apart. Capacity in bits is a sanity check on the object library; capacity in chords is what the architecture actually spends.
It also settles §5's second return. "Which stored chord does this echo match?" is not a search over a database — it is one illumination, answered by every page simultaneously. That is why a holographic correlator belongs in the Tbit/s scan loop and a lookup table does not.
(M#/M)² curve: the more chords stored, the more alike the
weak ones look. Associative capacity and recall fidelity are the same
budget spent twice, and no encoding scheme escapes that.In this architecture, "a model need not be a large weight file" is literally true rather than a manner of speaking — worth stating precisely, because it is easy to overclaim.
A hologram performs a linear transform on whatever illuminates it: that is what a diffractive element is. A neural network layer is a matrix–vector product followed by a nonlinearity. So a weight matrix written as an interference pattern is not data that gets loaded into a processor — the light passing through it is the multiply, executed at the speed of propagation, with no memory bus in the path. This is established art: diffractive optical networks and programmable nanophotonic meshes both work this way.
The scale is the surprising part. At the 1 bit/λ³ density, a 1024 × 1024 weight matrix occupies a cube about 51 µm on a side — a speck at the edge of visibility. The "weight file" does not shrink; it stops being a file.
And plasticity follows from the medium rather than from a training loop: because PCM is rewritable in place, learning is re-exposure. A weight update is a local optical or electrical pulse that nudges the crystalline fraction of one site. That is the honest technical content of "neuroplasticity" here — not a metaphor, but also not free.
An earlier draft of this plan asserted that "there is no good optical transistor; cascading layers without electronic regeneration remains the central unsolved problem of optical computing." That is a correct general statement about optical computing and the wrong statement about this architecture — it imports the machine-learning stack (linear layer, then an activation function bolted on) onto a machine that does not use it.
Two things make it not apply:
eml(x, y) = exp(x) − ln(y), which is a nonlinear function of
both arguments and is universal for the entire elementary-function
family in the way NAND is universal for Boolean logic. There is no activation
to add afterwards, because there is no linear layer to activate.The correction changes what to worry about. The ceiling on this machine is not "can it be nonlinear" — it is "how deep a composition can it sustain."
Three concrete returns, in increasing order of how much they matter:
This plan inherits the scan lane's discipline: every chord, and every
reconstruction it feeds, carries measured | inferred provenance,
and the viewer renders the difference. The reason is specific to this
machine: the scan output
is also the build acceptance criterion, so an inferred interior becomes a
fabricated-from-a-guess interior. Both a wrong Green's function and
a confident prior produce sharp, convincing, meaningless images.
That rule bites here because the returns in §5 are inference. A holographic correlator that answers "which stored chord does this echo match?" is proposing a match — it is not measuring one. So:
The model may propose; only the aperture asserts. Anything
the compute core recalls, completes, denoises or pattern-matches is tagged
inferred and stays tagged through every downstream use. The
optical core is allowed to be fast and clever; it is not allowed to launder a
guess into a measurement by being either.
Two corollaries worth writing down now, before there is code to argue with:
inferred — which means the "weights are the medium" claim of §4
buys speed, not epistemic standing.| # | step | why it is first | gate |
|---|---|---|---|
| 1 | Write and read one hologram in a phase-change film with the existing 450 nm optics; recover a known bit pattern | establishes the write/read chain before any capacity claim | bit-error rate on a known page |
| 2 | Measure the medium's M# — multiplex N pages, plot η vs N, fit (M#/M)² | this, not λ³, is what limits a real store; every capacity claim in §3.1 is a ceiling awaiting this number | M# with its η-vs-N curve; capacity restated as a fraction of the mode ceiling |
| 3 | One matrix–vector product through a written hologram; compare against the digital reference | this is the whole "weights are the medium" claim, reduced to one falsifiable step | relative error vs digital Wx |
| 4 | PCM rewrite cycle: write a transform, run it, rewrite it, run again | separates "non-volatile store" from "reprogrammable transform" — the plasticity claim lives here | contrast retained over N cycles |
| 5 | Correlator against the chord dictionary — feed a scan echo, get a match | the first step where compute serves the replicator rather than standing alone | match rate vs the software matcher |
| 6 | Score on the four axes (Osika), reporting all three energy denominators | keeps this lane commensurable with the toroid and with digital baselines | a filled axis table with named verification type |
Steps 1–3 are a bench sequence, not a program. Nothing after step 3 should be argued for until step 3 produces a number.