# Six nested levels—not six separate times

SMONAD · 96 s · 2026-10-16

Reference English audio is generic synthetic speech, not the author’s voice.

## 00:00:00 — 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.

## 00:00:16 — 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.

## 00:00:32 — 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.

## 00:00:48 — 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.

## 00:01:04 — 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.

## 00:01:20 — 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 / المصادر

- DTT foundations · sections 2–5: https://www.smonad.com/time/
- Emergent geometry: https://www.smonad.com/geometry/
- The course: https://www.smonad.com/learn/