Pulse Core Lexicon
Recursive Capacity Law
Definition
The Recursive Capacity Law is the relation f(r) = (2r)² by which structural capacity grows quadratically as the data's reach widens two cells across every Pulse Rhythm, and which decides when that capacity exceeds the containment of the Toroidal Substrate.
The book cites it in the chapter-3 summary: the law determines when accumulated computational capacity exceeds Toroidal Substrate containment, triggering dimensional reorganization at the threshold Rhythm r* = ceil(√χ_∂ / 2). It is the engine of Toroidal Genesis and Data Nova Escalation, the reason, in the book's account, that dimensional expansion happens through quantized structural transitions rather than smooth inflation. When the data it counts and that data's null together fill the Bifold's record, the null reorganizes into the closed-loop Toroidal Substrate.
f(r) = (2r)², where f(r) is the structural capacity after r Rhythms, in cells, and r the data's count in Pulse Rhythms, both dimensionless [∅]. It is the same relation as Recursive Capacity Growth; until 2026-11-14 it read f(n) = (n + 1)² in Tempos.
It connects to Recursive Capacity Growth, Containment Crossing Condition, The UniSpheral Data Nova Threshold Law, Pulse Mirror, Toroidal Genesis, Data Nova Escalation and Toroidal Substrate.
Mathematical Expression
From the book · Chapter 3 · Data Novas and Dimensional Evolution
f(r) = (2r)² [∅]
Dimensional analysis:
Where (from the book): 2 [∅], f(r) [∅], r [∅]
[∅]
([∅] × [∅])² = [∅]² = [∅]
[∅] = [∅] ✓ Valid PulseCore Verified ✓
The data's reach grows two cells across every Pulse Rhythm, one Pulse Diameter on each side, so its capacity grows as an area: one Tempo fills 4 × 4 = 16 cells, the Zinf.
Technical Details
Category Concept
Chapter Chapter 3
Importance
In the book #287 of 1,511 terms · used 5 times