1
00:00:00,500 --> 00:00:04,280
This animation implements one binary counter with six digits.

2
00:00:04,530 --> 00:00:13,670
Only one counter advances. Higher digits change through carries from lower
digits, so the six levels are dependent rather than separately driven clocks.

3
00:00:16,545 --> 00:00:23,425
Group the digits into three pairs. In this supplied
readout, each pair contributes one signed coordinate.

4
00:00:23,705 --> 00:00:31,535
As more digits become available, the possible
readout ranks are one, one, two, two, three, three.

5
00:00:32,500 --> 00:00:35,590
All six binary digits give sixty-four addresses.

6
00:00:35,930 --> 00:00:39,760
Each paired difference is minus one, zero or plus one.

7
00:00:40,150 --> 00:00:45,700
Together they give twenty-seven distinct readout
sites, not sixty-four different positions.

8
00:00:48,500 --> 00:00:54,220
Several addresses can share a site. The centre
has eight addresses; each corner has one.

9
00:00:54,730 --> 00:00:58,550
Equal visitation of addresses
therefore gives unequal site weights.

10
00:00:58,980 --> 00:01:02,580
The animation displays this multiplicity rather than hiding it.

11
00:01:04,500 --> 00:01:10,210
For this teaching model, completion means that a
sixty-four-entry buffer has been filled in counter order.

12
00:01:10,550 --> 00:01:13,990
A single publication event makes that whole buffer available.

13
00:01:14,420 --> 00:01:18,070
This is an explicit rule, not a physical law derived here.

14
00:01:20,500 --> 00:01:24,490
The construction verifies the rank and
counting statements for the chosen map.

15
00:01:24,850 --> 00:01:29,310
Its frame, pairing, length unit and completion rule are inputs.

16
00:01:29,710 --> 00:01:35,190
Their physical origin, and the calibration of
observable clocks, remain research questions.