Invention 4
Lookup-in-storage memory tier
The design / Invention 4
Built fromresearch/02-corerope-design.md (edit)
The memory tier lives in storage that computes: each memory die gathers the rows a token asks for, sums them with their gate weights on the die, and returns one small vector. Only about 4 KB per lookup crosses the bus instead of every retrieved row, and tens of terabytes of knowledge cost about as much as a few hundred gigabytes of HBM.
Two levels, split by when the address is known.
| Level | Addressed by | Stored in | Size | Why it works |
|---|---|---|---|---|
| Static memory | Hashed N-grams of the input tokens, Engram style | 3D NAND with on-die reduction logic | 10 to 50T parameters | Addresses are known the moment a token arrives, so ~20 to 50 microsecond page reads are prefetched and hidden inside a ~20 ms decode step |
| Contextual memory | Learned product keys from the hidden state | DRAM beside the core | ~1T parameters | Addresses depend on computation, so they need DRAM latency |
Engram's deterministic addressing is what makes the NAND level possible: DeepSeek already prefetches its table over PCIe for that reason. The table is read-only between updates, so NAND write endurance is not a concern; read disturb and error correction are, and need a refresh budget.
Shared by everyone. A thousand concurrent streams read the same tables, so storage capital per token is negligible: the cost model charges ~$0.00005 per million tokens. Updates from the ROM core, RAM mind contract are table rewrites, done as rolling bank swaps.
Open question. NAND pages are 16 KB or larger while a memory row is a few hundred bytes, so a naive layout wastes most of each read. Tables must be packed so rows that fire together share pages, which is a training-time clustering problem nobody has solved for this use.
Source: research/02-corerope-design.md, lines 99 to 112Edit on GitHub