02 / 03 · HOW TIME BECOMES SPACE
Specified mathematical modelSix nested levels—not six separate times
Step a six-digit binary counter, inspect its paired readout, and separate the working buffer from a completed record.
Natural AI-generated English narration, synchronized to the chapter scenes. English and Arabic subtitles are included. This is not the author’s voice or a human recording. The film is a model illustration, not footage of a physical process.
The complete narration
One counter, six dependent digits
This animation implements one binary counter with six digits. Only one counter advances. Higher digits change through carries from lower digits, so the six levels are dependent rather than separately driven clocks.
The paired-readout rank
Group the digits into three pairs. In this supplied readout, each pair contributes one signed coordinate. As more digits become available, the possible readout ranks are one, one, two, two, three, three.
64 addresses; 27 readout sites
All six binary digits give sixty-four addresses. Each paired difference is minus one, zero or plus one. Together they give twenty-seven distinct readout sites, not sixty-four different positions.
A position can forget information
Several addresses can share a site. The centre has eight addresses; each corner has one. Equal visitation of addresses therefore gives unequal site weights. The animation displays this multiplicity rather than hiding it.
A definite completion rule
For this teaching model, completion means that a sixty-four-entry buffer has been filled in counter order. A single publication event makes that whole buffer available. This is an explicit rule, not a physical law derived here.
What is verified; what is supplied
The construction verifies the rank and counting statements for the chosen map. Its frame, pairing, length unit and completion rule are inputs. Their physical origin, and the calibration of observable clocks, remain research questions.
Sources and further reading
Model, equations and limits
One binary counter and a specified map
The state includes a single counter, a working buffer and an ordered list of completed buffers. Each inner operation appends the next addressed readout. After all 64 entries are present, the completion rule publishes that buffer, clears the working buffer and begins another scan. The repeated examples do not add a matter law or a calibrated duration.
Why the rank sequence is exact
Within the first 2ᵃ addresses, only the first a digits vary. Each newly opened odd digit supplies a new independent coordinate direction; its following even partner changes the same coordinate. These directions are present and span the image, giving ranks 1, 1, 2, 2, 3, 3.
| a | 2ᵃ | Sites | Rank |
|---|---|---|---|
| 1 | 2 | 2 | 1 |
| 2 | 4 | 3 | 1 |
| 3 | 8 | 6 | 2 |
| 4 | 16 | 9 | 2 |
| 5 | 32 | 18 | 3 |
| 6 | 64 | 27 | 3 |
Multiplicity and the completion input
There are 64 addresses and 27 sites. A coordinate equal to zero has two bit-pair realizations; a nonzero coordinate has one. A site with z zero coordinates therefore has 2ᶻ addresses. The centre has weight 8/64 and a corner 1/64 under uniform address visitation. These are discrete weights for this map, not a measured spatial density.
The coordinate frame, three pairings, length ℓ and “all 64 entries” acceptance rule are explicit inputs. The buffer retains address multiplicity; the cloud is a projection of that record. The model does not prove that these inputs are uniquely required by a pre-spatial source.
Sources
Explanatory source: SMONAD DTT foundations, accessed 16 October 2026. The code is an explicit teaching implementation; it is not an independent verification of the complete research programme.