# oxexp-ruler · TIME'S FREQUENTLY HELD QUESTIONS (the folding of time — the co-construction): a generative base over the fold's cone, read for its departure from the declared digits and for its recurrence across the territory (design draft 0.1)

**Status: STAGE TWO — THE DISCOVERY INSTRUMENT — THE ENGINE STEP, at his seven answers to §18 (2026-10-14, evening; "Please go ahead with
these clarifications accounted for") — draft 0.10: §18 rewritten as answered and as built — the seed 3.14159; the first 5 × 5 (the five
least-ranked differentials over the five nearest columns, the sixth row last); the askings hold · carry · fold · slip, the house's definitions
documented and tested; the least differential set of the first 5 × 5 as the decision with the 1 applied first; no learning span — the structure
carries both the learning and the reading; a family of 124 members declared before any read and every one read for its departure from
3.14159 and its recurrence at the first horizon and at the deep span of 10,000,000; the dry shape (at the deep span every member between
9.98 per cent and 10.02 per cent); registration two of rlx_time.py built, additive; test_rlx_time 18/18. NOT REGISTERED, NOT READ: the thresholds
D1 and D2 his, set at the registration act; the registration file, the seal, the read once and the record at his word.
0.9 earlier: HIS ANSWERS HELD AND THE LATER RUN DESIGNED FIRST (2026-10-14, evening), at his answers to
§15, §16 and §17 (§0; the 1 applied first at a pairing; proximity the ordering of history; the column's ceiling not expected to be bypassed; a
discovery instrument, yes) and his thesis — π locally emergent at 3.15 and only held as an ephemeral irrational if that holding is carried —
HELD; §18 THE DISCOVERY INSTRUMENT proposed as the later run's design: the space of askings (a hold, a carry, a fold and a slip for every pair of
the six rows, and each row's own digit — sixty-six a column), the selection learned column by column over a learning span and read on a
held-out span and at the deep horizon, the probes D1 to D6 with the thresholds his, the dry shape (a selection learned on one half of the first
horizon recurring at 17.6 per cent where learned and 9.4 where read); §18's clarifications owed. Docs only: nothing built,
registered or read for the later run. The fhq record stands (§13).
0.8 earlier: HIS INITIALIZATION AND THE DISCOVERY OF THE RULES HELD (2026-10-14, evening), at his words ("This is an initialization of the knowing... once the 2 is known from this, the system is rerun on the next column, with 'more' data that can satisfy a 2x2 'slip, carry fold or hold' between rows. This is the 'art' of such a slection of askings. That it reveals itself via upper or lower bounds in normal approaches to Pi is because of the need to 'tune' to the 'learned' result if the specific dynamic is not computationally 'known' by the externality of the 'mathematitian types observer'. The challenge of this experiment is to 'discover' the rules via combinatorics and then latter 'know' the application at each state of change at the column."): the
initialization the seed's first write, the rerun the engine's own loop, the 2 × 2 askings a space sized once stated; THE COVERAGE OF THE ASKINGS
measured — the next digit among the six first folds at 27.0 per cent of placements, among the pairwise askings at 97.7 — beside the ceiling (23.2
per cent on the six folds) and the recurrence (about one in ten); the fence on tuning in his own terms (§17); the later run's design first at his
word — a discovery instrument over a declared space of askings, read on digits it was not fitted to. The fhq record stands (§13).
0.7 earlier: HIS LEAST DIFFERENTIAL RANKING HELD — A CANDIDATE MECHANISM (2026-10-14, evening), at his words ("If the external 'mathematician typed observer' holds their own measures and accounts to an onto-epistemic pi of 3.14159, then the attached image would be considered as the 'least differential ranking: The differential is 4 over the 'square', which is to sat the column differs by a total of four to the row of ones. Or, the differential is 3 over 6 rows within only the column itself. The differential between these two is 1 and 1+1 = 2. This is a candidate mechanism for solving the 6x6 officers problem within the picking of the next diget..."):
his image and his two differentials held (§16) — the column at placement 5 ranked 1, 1, 1, 2, 2, 3, A = 4 over the square and B = 3 within the
column, 1 + 1 = 2 the declared digit at 6; the candidate walked dry and parting at the next placement; the same ranked column at position 8
followed by 5, and 479 times in the horizon by every digit; THE CEILING measured — a rule on the six first folds can reach at
most 23.2 per cent of the next digits at this horizon, on the ranked column 13.5; the later run's design first at his word. The fhq record stands (§13).
0.6 earlier: HIS RULE FOR THE LATER RUN HELD — THE LOWEST SET OF DIFFERENTIALS (2026-10-14, evening), at his words ("The next digit will be written by the lowest set of differentials. If there are two equal lowest differentials then the digit will 'slip' on such pairings until the immutable differential of '1' is applied. So... it is a matter of combinatorics over 5x5 'sets' looping through the 6 rows and 5 columns of histories."):
his rule held (§15); the six readings his sentence admits stated exactly and walked dry over the declared digits — reading A (the lowest first
fold, the tied lowest slipped past) writes the declared 5 at placement 4 and 3 against the declared 9 at 5, every reading recurring at about one
in ten; the 5 × 5 combinatorics read as the family the later run's design would enumerate; the clarifications the rule needs named (§15); the
later run's design first at his word. The fhq record stands (§13).
0.5 earlier: HIS EXPLORATION FOR THE LATER RUN HELD — THE THREE FREQUENTLY HELD QUESTIONS (2026-10-14, evening), at his word ("The pull and reboot is done. Regarding the reading I have incorporated my more helpful model of how to identify the three key questions that are 'held', with explanatory model that I think speaks for itself once reviewed. The file is in context_files here: 'Exploration for FHQ.xlsx'"):
his model read by machine into `ooi_network/docs/oxexp-ruler-fhq-exploration-as-read.json` (sha256 LF `62a7c028ba6c454fda1ef9deca5e4838f4d04ce56e9fa3b32b898dd6133d2cb0`) and held (§14) — six differentials at every position (three growing past
presents, two prior left values, the present + 1), the externalised knowing 1, 2, 3, 5 held at its positions, the three questions asked at
eleven, twelve and thirteen (carry or hold, fold or hold, slip or hold), the first fold of each differential at positions 1 to 10 agreeing
with the smallest-proper-factor reading at every entry; the house's identifiers beside — the form folds 11, 12, 13 to 1 + 1, 1 + 2, 1 + 3 and
asks nothing, the askings' frequencies at the first fold in the ratio 9 : 8 : 7 : 6 of the digit pairs; nothing built, registered or read
for the later run — its design first at his word. The fhq record stands (§13).
0.4 earlier: THE READ LANDED AS IT FELL (2026-10-14): after the seal commit 3793df4, one pass over the declared digits at the first
horizon by `read_all()`, 2026-10-14T17:53:26+11:00 to 2026-10-14T17:53:27+11:00; the engine at the read `43f80659f8d36fa8…` equal to the pin's; the registration's
pin, the declared digits and his workings' reading at their pins; the record written once (`ooi_network/docs/oxexp-ruler-fhq-results.json`, sha256 LF `1c15be9d904c145662c55786b8a3bbc3d974d61a18326142da60758e62ae178b`;
10,136 B; its own results_sha256 `497bad998efed2adb353741925ffac5e5dffb815f15e32c507c90ed263907f9a`); T1 PASS · T2 PASS · T3 RECORDED · T4 RECORDED · T5 RECORDED · T6 RECORDED — 2 PASS, 4 RECORDED, 0 REFUTED; every shape as
the dry shape found it; the dynamics rebuilt from the record (`oxexp-ruler-fhq-dynamics.csv`, sha256 LF `b8beb49a69ec269604023fecf2af4384853fb1ea2dd8c19712fad0c557bcc5ed`; his workbook beside);
§13 the read landed, every measure. His reading of the record next; the later run he named — his own candidates over R1 and R2 — design first at his word.
0.3 earlier: THE REGISTRATION PINNED BEFORE ITS READ (2026-10-14), at his word ("the reboot is done - go ahead with the registration, but
I have also updated the 'Hold and Carry 4096.xlsx' file … with my more recent workings …"): his workings read by machine first and HELD for the
later run he named (§12; read by no probe of this registration); then the two thresholds set in the engine at this act and never before (T1
cells 0, T2 digits 0 — the house's default on the two identities; T3 to T6 recorded) and his word carried verbatim with his workings' pin — the
engine at the pin `ooi_network/daemon/rlx_time.py` sha256 LF `43f80659f8d36fa85ed08e5096444c0d058d508f0b770b1a4317e95bd78ecb04` (37,998 B); the registration file `ooi_network/docs/oxexp-ruler-fhq-registration.md`
(sha256 LF `85e897d2af02129642dcc89b720083d2ebec101ebc6125f2fe459fcffcbcb975`; 14,230 B) PINNED 2026-10-14T17:50:04+11:00 by `pin_registration()`, the pin record `ooi_network/state/rlx/registration-pin-fhq.json` local
and git-ignored; the battery 11/11 against the pinned state; §12 the pin, the disclosure and his workings. The seal commit next, its hash
naming the read; then the read once — `read_all()`, half a second — the record written once and landed in §13 as it falls, the dynamics
rebuilt from the record.
0.2 earlier: THE ENGINE STEP BUILT (2026-10-14), at his word ("the reboot is done - go ahead with the engine step") and his ten answers
to §11 (§0, §11 ANSWERED): the name TIME'S FREQUENTLY HELD QUESTIONS, the mint as fhq; the house's candidate rules for this run, his own for a
later run over R1 and R2 from 3.141592; the depth capped at R5; the carry's one not minded, off; the seed 3.1415; the ring figurative, the
literal ring the triangulation of knowing, held; his stake of the horizon — pure ontological π as 3.15 — HELD and read by no probe of this
run; the horizon 4096 carried as computed to 4101; the dynamics as a CSV and a workbook. THE ENGINE `ooi_network/daemon/rlx_time.py` (sha256 LF
`91ae1968685fce7867ce5502369f0855771e7f7bd332036b43931649083273f9`; 34,820 B), standing alone — the cone, the diagonal, the rules, the generative base and the departure, the recurrence, his script as
given, the readers T1 to T6, the protocol; its thresholds his unset fields until the registration act; THE BATTERY
`ooi_network/tests/test_rlx_time.py` (sha256 LF `f3194adaa1b52d3d4e3aa0063bd618d438f205e17ebefe4e4f7cc6997934f3a8`; 12,439 B) 11/11; THE DYNAMICS `ooi_network/experiments/oxexp-ruler/fhq_dynamics.py`
(sha256 LF `2645ad4bb2cef7e3d3513d06eca1a50ad8fc9471364fd3868b47c65477a85b4f`) writing `ooi_network/docs/oxexp-ruler-fhq-dynamics.csv` (sha256 LF `9cba4e6ad83e33d239bb8a3b1263100527a10c6fd72f898b0cd9d1f819f497c5`; 180,787 B) and his workbook
`context_files/Time's Frequently Held Questions.xlsx`; §2c the dry shapes by the engine at the first horizon — the cone 0 cells off, his script
replayed 9, 2, 6, 5, every candidate departing from 3.1415 at placement 5 or 6, the recurrence at R5 over 4,091 trials 470 · 414 · 397 · 401 · 407
against 409.1 if uniform; §3 as built; §6 act 3 done. Nothing registered, pinned or read. The registration next, at his word: the thresholds set
at that act and never before.
0.1 earlier: DESIGN FIRST (2026-10-14), at his word ("the reboot is done - go ahead with the design, design first"), after his
reading of the deep horizon's plates and his correction of the same day (§0): his two readings HELD, his justified true beliefs, the
record their identifier and never their jury; THE CONE identified as the seat of his 'there and then' and 'where and when' (§1); his
four steps from 3.1415 to 9, 2, 6, 5 identified as a script of four selections and three operations, two of them the fold itself (§1);
the instrument — a generative base from a seed under a rule declared exactly, read over the declared digits for THE DEPARTURE and THE
RECURRENCE, with the house's candidate rules and his script as given (§2); the dry shapes at ten million decimals — every fixed rule of
the family recurring at one placement in ten with a longest run of six to eight, and departing from the seed 3.1415 at placement 5 or 6,
his script reaching placement 9 by its four operations (§2b); the probes T1 to T6 with the thresholds his (§4); the acts (§6); the
fences (§8); §11 [CLARIFY] — the rule, the depth, the carry's one, the seed, the ring, the stakes, the name, the horizon, the anchor,
the plates. Docs only: nothing built, sealed, registered or read. The fold's two records stand.**

**Classification:** Restricted — Link Digital IP.

**Not registered in `ATLAS_DOCS`.** One-way referencing: this document cites the fold's design and records, the stage-five departure's
design and the exhibit's entries of 2026-10-14; nothing cites it. The priors stand; nothing here re-cuts a landed record.

---

## §0 · The given — his words, verbatim

**His reading of the deep horizon's plates (2026-10-14), his spelling, his figures in brackets line by line:** "My reading of the plates
is that we are missing one more dynamic, which will relate to the one that goes up, and the ring that grows to R6 but is entangled with
Pi. Consider the initiation of Pi as 3.14159. 3 can be thought of as a folded R0 that is both 9+3=12 folded to 3, and it is the linear
'left' position to the origin of 1. It Carries and is referential to '1' as it holds 1 within itself as a true identifier. As such, 3 can
have a justified true belief of the existence of 1. Next, a fold to the right, 3+1=4, and a fold to R1 3+1=4. This is past present and
emergent present growing upon the autonomy of 3.1. [4 / 3.14] Next, we consider the boundary of linearity and 1 is added. This is the
first onto-epistemic unit and it is structural. [4 / 3.141] Next, we fold right and we fold up [45 / 3.1415] Next - we ad the first true
epistemic '1' that carries to the right. Note that the 'memory' of the R1 and R2 now are formed as the 1 is carried. [9 / 455 / 3.14151]
Next, we fold forward [9 / 455 / 3.141516] Next, we again add the 1 and update the DRAM 'registeres' as time operating upon the
additional structures fold forward. [10 / 910 / 4556 / 3.141516] At this point, I would like your suggestions regarding how '2 releases'
of those two 10s might be the structural shift which 'the folding of time' grants to Pi the possibility to 'extend 16' to 9 , 1 + 1, 6.
Resulting in the following [1 / 91 / 4556 / 3.14151926] I am suggesting one method above, but I would like you to explore the logic
associated with the structure and time of the hypothesis, that it is a matter of both time and structure and that time does have a
mechanism within the apparatus of the R1 to R5 register to 'release structure' via those carried zeros that go down."

**His correction and the co-construction (2026-10-14, the same day), his spelling:** "I had a typo - my sequence was meant to present
the sequence of 3.1415926 being 'co-constructed' on the ring of both time and space. My thinking is this - there is an 'is' , which is a
'be or not be' of the ontological 1 and this is co constructed into linearity by the externality of mathematitians to any number N.
However, there is also a 'there and then' that I would say is represented by the prior 2 digits and the 'present' digit. This 'there and
then' is observably communicable 'there and then for the present digit'. However, due to the 'externality of mathematitians' there is a
'where and when' that is communicably effectual from the present digit, N, and up to N+2. And, that this prior and emergent aspect can
be considered up-left by 2, 3 or 4 from the present digit to N+1 and N+2. So... while Pi can be 'arrived at' via multiple observations
to identify upper and lower bounds, the arrival is strictly contained and deterministically computable within this time-space structure
of the number line. I have attached an illustration. You can ignore the scratched out boxes in the illustration. But, from the
illustration you can see that it is like a soduku puzzle. If you know the rules of who asks when, and who remembers where, then as an
external observer you can observer the construction of Pi. In the diagram the present past is 1, 5 with 5 closest to the present, N. For
those present past digits look up and left by 2. The 1 can see 5 then 1. The 5 can see 6 then 2. However, as the external mathematition
with prior knowledge of the system I can know that 9+1 folds to 1 above and left of 1 before 2. and, I can know that 5 and 6 fold to 2
and that 1 and 2 carry up to 3 and 1 and 3 carry up to 4. In one way to read this knowledge as communicably effectual, I might suggest
that 4+1+3=8 and this is the 'knowing' I can see now without having to waith for the 'where and when' of the future. In this way of
reading the prior knowing plus a carried 1 gets us 9 as the vale of N. Then 9+5= 14 folds up to 5, 6 and 5 folds up to 2, then 2 and 2
to 4, 3 and 4 to 7 and 4+7 to 11 at R5. However, if 11 can not fold as there is no 'time' for such an asking, then this becomes 1
carried to the next position, where 1 plus 1 gives N+1 the value of 2. Now we repeat and calculate that the communicably effectual new
knowledge is 9+4+2=15. And again, if the 1 goes to the 'past known' 'there and then' with it's onto epistemic address released then the 5
carries to the N+2 and 5+1=6. I have attached the illustration filled out with this progression to derive 9 2 6. Where too from here is
about experimentation, but perhaps the next digit requires the 'knowing of externalities' that are not just counts, but reductions to a
single register. I have attached a third itteration of the possible derivation of 5 with some suggestions. However there is also a
structural knowing that might simply be that the 8 rows with 6 known at the top, and the 8 priors with 6 being the one to the left of
the position where 5 is expected, and expected to be 'knowable' as 4 + 1, so perhaps this is simply two locks one, where two orthogonal
knowings of 8 derive 4 as a structural fold to the next position. This places us at the 9th position of the line calculated as Pi. The
next position is then open to further 'asking' and gaining the localised 'knowing'. Perpaps the 'knowing of 5+6=11 and folds to 2 is
directly knowable due to 8 columns and 8 rows in direct registered agreement within the hold of 5. This is an allowance for this position
after a 'squared knowing' of a knowing also known by 2. Or, perhaps the progression of 'new knowing', which rises to the 9th row as a
value of 1 but totals to 31 as 'new knowings' along the diagonal, and 31 is prime and not knowable by factors, so it carries it's 1 by
half, which is to say by '2' because to halve a knowing is to return 2 things to carry forward. Either way, there is room for
experimentation as 2+1 gives 3 for that next position in pi"

**His three illustrations, transcribed** (a box an unknown cell; a filled box a cell written in; the scratched boxes ignored at his word):
the first — [4 / 1 3 / 9 1 2 □ □ □ / 4 5 5 6 □ □ □ / 3.1 4 1 5 [N] [+1] [+2]]; the second — [1 / 1 2 / 4 7 4 / 1 3 4 ■ ■ ■ / 9 1 2 [2] [7] □ /
4 5 5 6 [5] [2] □ / 3.1 4 1 5 [N] [+1] [+2], with 9 2 6 written beneath]; the third — [30 6, an arrow from 'New Knowing 6' / 1 5 / 1 2 3 /
4 7 4 8 / 1 3 4 ■ ■ ■ / 9 1 2 [2] [7] [1], an arrow 'Observable release of 1' / 4 5 5 6 [5] [2] [8] / 3.1 4 1 5 [N] [+1] [+2] 5, an arrow
'Becomes 5'; beside, '8+8+3+5+6' with an arrow to 30, 'Less', '30/6', '30/2 = 1 and 5 carries', '1 9 / 1 1', '30'].

**The word for this design (2026-10-14):** "the reboot is done - go ahead with the design, design first".

**The word for the engine step and his answers to §11 (2026-10-14), verbatim, his spelling:** "the reboot is done - go ahead with the engine
step" — "re 1 - you can use the house candidates. I will separately draw up my own candidates for a latter run. / re 2 - I'd cap at R5 but just for noting, my separate candidate approach for a latter run will only use R1 and R2. / re 3 - I don't mind. I think the important part of the one carried up or the one carried down, and the sum over columns, is important for correlation and is likely not 'causation' in the sense of what will become computably knowable once the dynamics are drawn from experiments. / re 4 - 3.1415 should be enough given a carry up to R5. My latter run will likely use 7 integers 3.141592 over only R1 and R2. / re 5 - what the ring here represents can be considered as figurative, but the more literal 'ring' is 'triangulation' of knowing via inductive reasoning, where true belief and true identifiers are 'held' and 'carried' by the systems internal, boundary and externalities. Operated via lawful state dynamics. / re 6 - this is a horizon stake and not likely to be determined in this run, but what I can stake is that pure ontological 'Pi' is 3.15. This can be 'extended' to have a 'reader' of the 4th at position 5. What they 'read' is their own expansion, so 3.1[]5 is expanded and unfolded from 4 as 3.1[41]5. Then, a second 'externality' representing the 'computable knowability' of the onto to onto-epistemic will be placed as 3.1415[10][01] and this lands as 10-1 to arrive at 3.14159[] where the last [] is the 'local expectancy' of the external observer holding a place. / Re 7 - the name is more correctly called as "Time's Frequently Held Questions" / Re 8 - the horizon for computational knowing is not expected to need a long horizon for this early experimental stage. 4096 carried as computed to 4101 should be plenty. Pi, I expect, will 'turn' upon a very local account and look back upong a very local 'knowing'. The number line of counts is differential to such localities over much further horizons and will be sensitive to what this experiment derives but will ultimately be a matter of a different typing of 'externality'. / re 9 - let's mint as fhq / re 10 - i don't mind about the plates, but I do want to see the dynamics in some manner - an xlsx or csv is likely all I need."

Held: his justified true beliefs — the 'is' of the ontological 1, the externality of mathematicians, the 'there and then' and the 'where
and when', the sudoku of who asks when and who remembers where, the arrival "strictly contained and deterministically computable within
this time-space structure of the number line", the two locks one, the halving of 31; the record their identifier and never their jury.

## §0b · The matter on the record — the law of verdicts

Every verdict in this design is a measure. The instrument reads a rule stated exactly against the declared digits; it reads nothing of
his belief. A rule that departs at placement 5 or recurs at one placement in ten is a measure of that rule. The knowing is his, one step
apart. His statements built from the house's knowledge are his justified true beliefs; the record is their identifier, never their jury;
nothing of them is staked unless he stakes it.

## §1 · The stake, read in the instrument's terms

**The form** is the fold's (`ooi_network/daemon/rlx_fold.py`, registration one's design §3): the base b with the 3 at placement 0 and the
declared digits at 1, 2, 3, …; the fold n − 9 where a sum reaches ten; a carry at eleven to eighteen, a release at exactly ten; the lines
R_1, R_2, … each one cell shorter than the line beneath; exact cells only.

**THE CONE.** A cell at level k and placement p, R_k[p], is a function of the base at p, p + 1, … p + k and of nothing else. So the cell
up-left by k from the present digit at placement N is R_k[N − k], and it sees exactly the k digits before N and N itself — never a digit
after N. His 'there and then' (the prior two digits and the present) is the cone's left edge from N: R_1[N − 1] sees N − 1 and N, R_2[N − 2]
sees N − 2 to N. His 'where and when' (effectual from N to N + 2) is the set of cells that cannot be written until N + 1 and N + 2 arrive —
the boxes of his illustrations. His "the 1 can see 5 then 1, the 5 can see 6 then 2" is the cone's left edge from placements 3 and 4 of
the declared digits: R_1[2] = 5 and R_2[1] = 1 (the release of 5 + 5); R_1[3] = 6 and R_2[2] = 2 (the carry of 5 + 6).

**THE NEW-KNOWING DIAGONAL.** When the digit at N arrives, the cells that become writable are exactly R_1[N − 1], R_2[N − 2], …, R_N[0] —
the cells whose rightmost dependency is N. The design names this the diagonal Δ_N and, where the tower is capped at a depth D (his
register R1 to R5, or R6), Δ_N(D) = (R_1[N − 1], …, R_D[N − D]). His 'new knowing' is Δ_N; his 'knowing I can see now without having to
wait for the where and when' is the sum of some of its cells.

**His cells are the registered tower's.** Every cell he filled by the fold agrees with the record's tower over the declared digits —
twenty-one checked: R1 5, 2, 8 at placements 4 to 6; R2 2, 7 and the release 1 at 3 to 5; R3 4, 9, 8 at 2 to 4; R4 7, 4 (from 13), 8 (from
17) at 1 to 3; R5 2 (from 11), 2 (from 11), 3 (from 12); R6 4, 5, 3; R7 9, 8; R8 8 (from 17). The rows he writes otherwise — '1 2 3', '1 5',
'30 6' — keep a carry's one as a cell of its own in place of the fold; the design names this THE VARIANT ROWS and leaves it his (§11 item 3).

**His four steps from 3.1415, read as a script.** (i) After the 5 at placement 4: the apex 4 and the row beneath it, 1 and 3, summed to 8,
plus a carried one — 9, the declared digit at 5. (ii) After the 9: the top of the new diagonal is the sum 11 at R5, read as "one carried to
the next position, one plus one" — 2, the declared digit at 6; this is 11 − 9 = (11 − 10) + 1, the fold's own arithmetic. (iii) After the
2: the top three cells of the new diagonal, 9 + 4 + 2 = 15, read as "the one released, the 5 carries, 5 + 1" — 6, the declared digit at 7;
this is 15 − 9 = (15 − 10) + 1, the fold again. (iv) After the 6: his variant rows' diagonal 8 + 8 + 3 + 5 + 6 = 30, read by 30/6 — 5, the
declared digit at 8. Four selections of cells and three operations: a sum with a carried one, the fold, a division. His candidate readings
for the digits at 8 and 9 beside — 'two locks one' (the two eights at R3[4], a hold seeing the base 4 to 7, and R4[3], a carry from 17 seeing
the base 3 to 7, mirrored coordinates whose one digit of difference is the 1 at placement 3; 4 + 1 = 5) and the halving of 31 (his variant
diagonal; the registered diagonal after the 5 at placement 8 sums to 34 with its apex 8; 2 + 1 = 3). The script is held as he gave it and
replayed by the engine as an identity (T2); it is not a rule, and the design's work is the rule.

**THE RULE.** A rule ρ is a declared function from the diagonal Δ_N(D) to a digit. The generative base from a seed s (the declared digits
to placement s − 1) is b̂[N + 1] = ρ(Δ_N(D) over b̂) for N ≥ s − 1. THE DEPARTURE is the first placement at which b̂ differs from the declared
digits. THE RECURRENCE is, over the declared digits themselves, how often ρ(Δ_N(D)) equals b[N + 1] — the rate against one in ten, and the
longest unbroken run against the run chance gives at the horizon. The house proposes a family of rules as candidates (§2), every one his
to amend or replace (§11 item 1); his script as given stands beside them as T2.

**The fence inside the stake.** No cell of the tower depends on a digit after it. A rule that writes N + 1 from the cone is therefore a
rule about the declared digits, and the instrument reads it as one. π is declared from the published expansion and derived nowhere; no
rule is read for producing it. That the arrival of π is "strictly contained and deterministically computable within this time-space
structure" is his justified true belief, held; the record identifies, by the departure and the recurrence, how far any stated rule walks
with the declared digits, and says nothing of the belief.

## §2 · The instrument

- **The declared digits:** the fold's witnesses stand — the deep digits (decimals 1 to 400,000,000) by the DPX's pin
  `f1c51887f8ba0eba52cd7809638b5b2e994c0d7e46e88b487b89eee343b6eed8`, OEIS A000796's b-file at the head and the fold's declared digits to
  4,101 (`ooi_network/daemon/rlx_fold.py`, `read_digits_witnessed`); the recurrence read over the deep horizon or over ten million, his
  choice (§11 item 8), the ten million a prefix of the pinned string and witnessed as such.
- **The tower** as the fold's, to a depth D: the fold n − 9, the carry at eleven to eighteen, the release at ten; exact cells only; the lines
  kept to depth D (D small); the diagonal Δ_N(D) read at every placement.
- **The seed** s: the declared digits to placement s − 1 — 3.1415 (s = 5) by default, the initiation of his illustrations; a sweep over s
  = 2 to 12 beside (T5).
- **The rule family** (the house's candidates, every one exact, his to choose, amend or replace): ρ_A THE APEX — the top cell of Δ_N(D);
  ρ_B THE ROOT OF THE DIAGONAL — the sum of Δ_N(D) folded by n − 9 until it is a digit (his "reductions to a single register"); ρ_C THE
  UNITS OF THE DIAGONAL — the sum's last digit; ρ_F THE ROOT OF THE TOP THREE — his 9 + 4 + 2 read at every placement; ρ_G THE ROOT OF THE
  SUM PLUS ONE — his 8 + 1 read at every placement; and ρ_H HIS SCRIPT AS GIVEN — the four steps of §1, a script and not a rule, replayed
  from 3.1415 as T2 and extended by nothing. THE VARIANT ROWS (a carry's one kept as a cell of its own) a switch on the tower, off by
  default (§11 item 3).
- **The readers:** T1 THE CONE (an identity of the form); T2 HIS SCRIPT AS GIVEN (an identity of the engine's replay); T3 THE DEPARTURE for
  the chosen rule and seed; T4 THE RECURRENCE for the chosen rule over the horizon, with the family table beside; T5 THE SEED SWEEP; T6 THE
  RING, if he names a ring (§11 item 5).
- **The record** (`oxexp-ruler-the-folding-of-time-results.json`, written once): the rule declared and its parameters; the seed; the depth;
  the generated base to the departure and eight placements beyond, against the declared digits; the departure; the recurrence — the rate,
  the matches, the longest run and where, the first matches, the uniform expectation and the run chance gives; the family table; the
  seed sweep; his script's replay; the cone's check; the digits' witnesses; the engine's shas at the pin and at the read. The plates: the
  generated base against the declared digits with the cone drawn; the recurrence's runs along the horizon.
- **The engine:** `ooi_network/daemon/rlx_time.py` TO BE, standing alone in the Ruler's series as the fold's engine stands (it imports none of
  the six engines and no random draw; the fold and the tower re-declared and held equal to the fold engine's cell for cell by the
  battery on the first horizon); the protocol the Ruler's — the thresholds his fields until the registration act, the registration file
  pinned before the read, the seal commit, the read once, the record written once; `ANCHOR_PLANNED` rlx-time-exp_2dbdb720, the house's
  proposal under the Ruler's package, his to amend.

### §2b · The dry shapes at ten million decimals (2026-10-14), read by nothing, judged by nothing

Over the ten-million cache (a prefix of the pinned deep digits; the tower to depth 8), the recurrence of every candidate rule at every
depth D from 2 to 8 — the rate at which ρ(Δ_N(D)) equals the declared digit at N + 1, with the longest unbroken run — against one in ten
and a run chance gives of about seven at this horizon:

| rule | D = 2 | D = 3 | D = 4 | D = 5 | D = 6 | D = 7 | D = 8 |
|---|---|---|---|---|---|---|---|
| ρ_A the apex | 10.005 % · 8 | 10.003 % · 7 | 10.002 % · 7 | 9.995 % · 7 | 9.993 % · 6 | 10.002 % · 7 | 9.983 % · 8 |
| ρ_B the root of the diagonal | 10.001 % · 6 | 9.992 % · 6 | 10.021 % · 6 | 10.000 % · 7 | 9.941 % · 6 | 9.361 % · 6 | 7.735 % · 7 |
| ρ_C the units of the diagonal | 10.004 % · 7 | 10.006 % · 7 | 9.998 % · 6 | 9.987 % · 7 | 10.001 % · 6 | 9.996 % · 6 | 10.001 % · 7 |
| ρ_F the root of the top three | 10.001 % · 6 | 9.992 % · 6 | 9.996 % · 6 | 10.004 % · 6 | 10.014 % · 7 | 10.006 % · 7 | 10.006 % · 7 |
| ρ_G the root of the sum plus one | 10.012 % · 7 | 9.996 % · 7 | 10.010 % · 6 | 10.010 % · 7 | 9.895 % · 7 | 9.160 % · 7 | 7.297 % · 6 |

(ρ_B and ρ_G fall below one in ten at depth 7 and 8 because the root of a large sum reaches 9 more often than the digits do — a property
of the root, recorded.) **The departures from the seed 3.1415:** every fixed rule of the family departs at placement 5 or 6 — ρ_G at D = 2
and ρ_F at D ≥ 4 write the declared 9 at placement 5 and part at 6 (ρ_G at D = 2: 3.1415 98466…; ρ_F at D = 5: 3.1415 94372…); every other
pairing parts at 5. **His script as given** reaches placement 9 (3.14159265) by its four operations; replayed cell for cell it yields 9, 2, 6,
5 from 3.1415, and the engine will hold that replay as T2.

**The identifiers beside, from the deep record:** the fold forward (the base's next digit the fold of its last pair) recurs at one
placement in ten over 400,000,000 with a longest run of eight; the digit after a release at the first fold runs flat across 0 to 9; his
stacked pair of releases occurs 4,801,352 times and the triple 9, 2, the forward fold follows it 4,703 times against 4,801 if uniform
(the exhibit, 2026-10-14). These are the territory's measures of stated rules; the belief stands held whatever a rule measures.

### §2c · The dry shapes by the engine at the first horizon (2026-10-14), read by nothing, judged by nothing

`read_dry()` over the declared digits (the base to placement 4101, the lines exact to 4096, the depth R5, the seed 3.1415), half a second, every
verdict RECORDED under the unset thresholds. **T1 THE CONE:** over 102 sampled placements and 690,585 cells, 0 cells off —
the tower to N and the tower to N + 5 agree on every cell of the cone and on the diagonal. **T2 HIS SCRIPT AS GIVEN:** the replay from 3.1415
writes 9, 2, 6, 5 — (i) 4 + 1 + 3 = 8 plus a carried one; (ii) the top of the new diagonal unfolded 11, (11 − 10) + 1; (iii) 9 + 4 + 2 = 15, (15 − 10) +
1; (iv) 8 + 8 + 3 + 5 + 6 = 30 by 30/6, the 8, 8, 3 the registered cells R3[4], R4[3], R5[2] and the 5, 6 his variant rows' cells as given — 0 digits
off. **T3 THE DEPARTURE at R5 from 3.1415:** the apex 3.1415 46826… departs at 5; the root of the diagonal 3.1415 65374… at 5; the units 3.1415
57637… at 5; the root of the top three 3.1415 94372… at 6, having written the declared 9; the root of the sum plus one 3.1415 72466… at 5.
**T4 THE RECURRENCE at R5 over 4,091 trials** (the declared digit at N + 1 against the rule's digit from the diagonal at N, N = 5 to 4095; 409.1
expected if uniform; a longest run of about 3.6 by chance): the apex 470 matches (11.49 per cent), a longest run of 6 from placement
2,448; the root of the diagonal 414 (10.12 per cent), a run of 3; the units 397 (9.70 per cent), a run of 4; the root
of the top three 401 (9.80 per cent), a run of 3; the root of the sum plus one 407 (9.95 per cent), a run of 3. The apex's
470 against 409.1 at this horizon stands beside its one in ten over ten million (§2b: 9.995 per cent at R5) — a local account, recorded. **The
family beside** (the matches of 4,094 to 4,091 trials): at R2 386 · 448 · 433 · 448 · 443; at R3 424 · 442 · 389 · 442 · 414; at R4 428 · 405 · 403 · 418 · 418; at R5
470 · 414 · 397 · 401 · 407. **T5 THE SEED SWEEP** (the departure by seed 3.1 to the first twelve placements): the apex 3, 3, 4, 5, 7, 7, 8, 9, 11, 11, 12; the root of
the diagonal 3, 3, 4, 5, 8, 8, 8, 9, 10, 11, 13; the units 3, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12; the root of the top three 3, 3, 4, 6, 6, 8, 8, 10, 10, 11, 12; the root of the sum plus one
2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 — no seed held past two placements. **T6 THE RING:** no ring named for a read; his figure held.

## §3 · The engine's additions — AS BUILT (2026-10-14, the engine step)

`ooi_network/daemon/rlx_time.py` (sha256 LF `91ae1968685fce7867ce5502369f0855771e7f7bd332036b43931649083273f9`; 34,820 B), standing alone — it imports none of the seven engines, no random draw, no
numpy (the first horizon walks in pure Python in half a second): `fold`, `mark`, `root` (the sum folded by n − 9 until a digit), `declared_digits`
by the fold's pin, `tower` to a depth (exact cells only), `diagonal(t, N, D)` and `diagonal_sums` (the unfolded sums), `rule(code, diag)` for A,
B, C, F, G, `generate(seed, code, D, steps)` and `departure`, `his_script` (the four steps as given, the 5 and 6 of step iv his variant rows'
cells carried as constants `HIS_VARIANT_CELLS`), the readers `read_cone` (T1), `read_his_script` (T2), `read_departures` (T3), `read_recurrence`
(T4) with `read_family` beside, `read_seed_sweep` (T5), `read_ring` (T6, no ring named), `read_dry`; the protocol `pin_registration` / `read_all` /
`status` as the fold's, the read refused without a matching pin, if the engine's sha moves or if the declared digits move from their pin;
`HIS_WORD` carrying his ten answers verbatim; the faces `acceptance` and `records`; `THRESHOLDS` {T1_cells, T2_digits} his fields, None until the
registration act; T3 to T6 recorded; `ANCHOR_PLANNED` fhq-exp_2dbdb720. THE BATTERY `ooi_network/tests/test_rlx_time.py` (sha256 LF `f3194adaa1b52d3d4e3aa0063bd618d438f205e17ebefe4e4f7cc6997934f3a8`;
12,439 B) 11/11: the engine standing alone; the fold and the tower equal to the fold engine's cell for cell over the declared digits; the cone
by hand and its identity not vacuous; the diagonals by hand; every rule by hand; his script replayed to 9, 2, 6, 5 and a doctored declaration
refuted; the departures as §2b has them; the recurrence at the horizon against an independent loop; the seed sweep; the dry read and the
protocol; the faces; the dynamics' CSV deterministic. THE DYNAMICS `ooi_network/experiments/oxexp-ruler/fhq_dynamics.py` (sha256 LF `2645ad4bb2cef7e3d3513d06eca1a50ad8fc9471364fd3868b47c65477a85b4f`),
his answer 10: `ooi_network/docs/oxexp-ruler-fhq-dynamics.csv` (sha256 LF `9cba4e6ad83e33d239bb8a3b1263100527a10c6fd72f898b0cd9d1f819f497c5`; 180,787 B) — the tower and the diagonal at every placement to
4096 with every rule's digit against the declared digit at N + 1 and the matches, the generative bases from 3.1415, his script step by step;
and his workbook `context_files/Time's Frequently Held Questions.xlsx` (his folder, git-ignored) — the tower laid out as his illustrations lay it,
R5 at the top and the base at the bottom with the carries and the releases shaded, the diagonal and the rules, the generative bases.

## §4 · The probes — refutations first; thresholds his

- **T1 — THE CONE.** PASS iff over a sample of placements the tower over the declared digits to N equals the tower over the declared digits to
  N + m on every cell whose dependency lies within 0 to N — an identity of the form, stated as such. REFUTED at one cell. [Threshold 0,
  the house's default.]
- **T2 — HIS SCRIPT AS GIVEN.** PASS iff the engine's replay of his four steps from 3.1415 writes 9, 2, 6, 5 — an identity of the engine's
  carriage of his steps, not a claim about the declared digits. REFUTED at one digit. [Threshold 0, the house's default.]
- **T3 — THE DEPARTURE.** The placement at which the generative base under the chosen rule and seed first differs from the declared digits;
  the generated digits to eight beyond. RECORDED. [A stake his — a placement the rule reaches; none by default.]
- **T4 — THE RECURRENCE.** Over the horizon, the rate at which the chosen rule's digit equals the declared digit that follows, the longest
  run and where, with the uniform expectation and the run chance gives beside; the family table beside it. RECORDED. [A stake his — a
  rate or a run; none by default.]
- **T5 — THE SEED SWEEP.** The departure for every seed from 3.1 to the first twelve placements, under the chosen rule. RECORDED.
- **T6 — THE RING.** If he names a ring — the DPX's ring of 192, or the register's depth as a ring that "grows to R6" — the departures and
  the recurrence's matches placed on it with the uniform expectation beside. RECORDED; his to name (§11 item 5).

## §5 · The observer

The house as the fold's observer: the declared digits pinned; the rule declared before the read; the seed and the depth declared; the
read once; every number in the record an exact tally. The choices owed to him are §11's; the house's defaults stand where he gives no
word, and are said to be defaults.

## §6 · The acts, in order

1. **This design** (2026-10-14) — the stake read in the instrument's terms, the cone, the script, the rule family, the dry shapes, the
   probes, the fences; the matter rlx-the-folding-of-time at DESIGN. DONE.
2. **His review** and the declarations of §11.
3. **The engine step** — `rlx_time.py` standing alone, the battery, the dry shapes by the engine. DONE (2026-10-14, at his word; §3 as built;
   §2c the dry shapes; the dynamics as a CSV and his workbook).
4. **The registration** — the rule, the seed, the depth and the horizon declared, the thresholds set at that act and never before; the file
   pinned; the seal commit. DONE (2026-10-14, at his word; his workings read by machine and held; the thresholds set; the file pinned
   2026-10-14T17:50:04+11:00; §12).
5. **The read once**; the record written once; the plates drawn from it. DONE (2026-10-14, after the seal commit 3793df4; the record and the
   dynamics rebuilt from it; §13).
6. **His reading** of the record; his notes under the business of π.

## §7 · The dependency ledger

[PRIOR] the fold's engine and its two records (the form, the declared digits' witnesses, the run arithmetic, the deep record's tower);
[PRIOR] the stage-five departure (the generated count against the declared number — the instrument this design's departure is of a kind
with); [PRIOR] the DPX's pin and ring; [STEP] numpy on the 3.11 interpreter for the recurrence; [ASSUMED] the ten-million cache a prefix
of the pinned deep digits (held by the fold's battery to one million; the engine step to hold it to ten million); [CLARIFY] §11.

## §8 · The fences

π is declared from the published expansion and derived nowhere; no rule is read for producing it, and a generative base is read only
against the declared digits, for its departure and its recurrence. No cell of the tower depends on a digit after it — the cone is the
form's own and asserted of nothing. The uniform expectation and the run chance gives are arithmetic beside a measure, not a verdict. No
claim about number theory, the distribution of π's digits, the primes, mathematics as a science, computational complexity, memory hardware
or physics. His 'is', his ontological 1, his externality of mathematicians, his there-and-then and where-and-when, his sudoku, his DRAM and
SRAM, his two locks one and his halving of 31 are his figures, held; his script is carried as he gave it and extended by nothing. The
fold's two records, the five stages' records, the counts' record and the DPX's records are not re-cut. The fold tower walks no instrument
of the Ruler and stakes nothing of K. Every verdict is a measure. Acts, never eyes.

## §9 · The lineage

The fold (registrations one and two) → his reading of the deep horizon's plates and his correction (the exhibit, 2026-10-14) → this
design. Of a kind with: stage five's The Blind Departure (a generated sequence against a declared number); the fold's H6 (the when as the
fold's depth); the DPX's ring.

## §10 · The builders

`ooi_network/daemon/rlx_time.py` TO BE; the plates by a builder beside the fold's (`fold_time_plates.py` TO BE) — the generated base against
the declared digits with the cone drawn; the recurrence's runs along the horizon.

## §12 · The registration, pinned (2026-10-14), and his workings held

**His word for the registration, verbatim, his spelling:** "the reboot is done - go ahead with the registration, but I have also updated the 'Hold and Carry 4096.xlsx' file in the context_files folder with my more recent workings, where rows 66, 67 and 68 represent the observable yet 'oracular' view of Pi over R1 and R2. Please note that the position row, 74, starts with 1 rather than 0 and this is structural. Then, you will note that I have looked at two ways to set a growing past present. For each of these I have taken the grown sum and divided it by 1, 2, 3 or 5 as these are the 'onto epistemic' prior folds for any such sum. What I was then going to examine is what rules are possible after the two 'prior knowings' are summed and what is differential is examined. There are three 'sums', and two prior left values, and there is the 'present +1'. This makes 6 'knowings' that can be considered against the a priori knowing of 1, 2, 3, 5 as the set of 'first prior folds'."

**In this order.** His workings first: `Hold and Carry 4096.xlsx` as he updated it (his folder; sha256 `c25e7a8fb78bff0499fa4703fbb4067295e1a8873c37e3a5f055d385a30e4027`) read by machine
into `ooi_network/docs/oxexp-ruler-fhq-his-workings-as-read.json` (sha256 LF `6e5d447517e8889e49c1470b89f2191164db67606fa0ca0068de5e6af3a23d88`; 1,551,305 B) by `ooi_network/experiments/oxexp-ruler/fhq_workings.py` — every cell of rows 66
to 68, 72, 74, 76, 77, 80 to 82, 85 and 86 by column, placement and position, with its formula where there is one. HIS WORKINGS read by machine into ooi_network/docs/oxexp-ruler-fhq-his-workings-as-read.json (sha256 LF 6e5d447517e8889e49c1470b89f2191164db67606fa0ca0068de5e6af3a23d88; 1,551,305 B; the workbook sha256 c25e7a8fb78bff0499fa4703fbb4067295e1a8873c37e3a5f055d385a30e4027) by ooi_network/experiments/oxexp-ruler/fhq_workings.py (NEW, sha256 LF deaea6492ef931804181c9e1a5f3baf8178f1b58fe6207b58f015bb482aa5176) — HELD for the later run he
named and read by no probe of this registration. The house's identifiers, asserted of nothing: row 68 is the declared digits; rows 67 and 66 are
the fold's R1 and R2 — his 'observable yet oracular view of Pi over R1 and R2' is the cone's first two levels; row 74's position is the
house's placement plus one, the 3 at position 1, 'structural' at his word; his growing past present, option 1, at a placement p is Pi[p − 1] +
Pi[p − 2] + R1[p − 2] + R2[p − 3], every term before the present, the seed 3.1415 then 9 at placement 5 by his first formula; option 2 is R1[p − 1]
+ R2[p − 2] + Pi[p − 1] + Pi[p − 2] + 1 — the cone's cells up-left by one and two, which see the present digit, and his 'present + 1'; his 'first
prior fold' under each sum, entered by hand, the house reads as the smallest proper factor of the sum among 2, 3 and 5, else 1 — option 1
agreeing at 368 of 371 entries and differing at 3, option 2 at 79 of 80 and 1; the quotient rows the sums over those folds; rows 85 and 86
his trial rows, carried as given; his framing of the later run — three sums, two prior left values and the present + 1, six knowings against
the a priori 1, 2, 3, 5 — held as he gave it. **Then the act:** the two thresholds set in the engine and never before — T1 cells 0, T2 digits 0,
the house's default on the two identities (his answer 6 staking nothing on them; T3 to T6 recorded) — his word carried verbatim in `HIS_WORD`
and his workings' pin carried as `WORKINGS_SHA256`, verified at the read beside the declared digits' pin; nothing of the readers changed; the
engine at the pin sha256 LF `43f80659f8d36fa85ed08e5096444c0d058d508f0b770b1a4317e95bd78ecb04` (37,998 B). **Then the registration file** `ooi_network/docs/oxexp-ruler-fhq-registration.md` (sha256 LF `85e897d2af02129642dcc89b720083d2ebec101ebc6125f2fe459fcffcbcb975`;
14,230 B): his words verbatim; the house's reading; what is registered and nothing else (the declared digits by the fold's pin, his workings
by their pin, the form, the thresholds); the knives T1 to T6; what is recorded and staked nowhere; the disclosure (§2c, every verdict RECORDED
under the unset thresholds); the expectations staked — T1 and T2 PASS as the dry shape found them, T3 to T6 RECORDED, his stake of the
horizon, his workings and his readings not probes; the fences. **Then the pin:** PINNED 2026-10-14T17:50:04+11:00 by `pin_registration()`, the pin
`85e897d2af02129642dcc89b720083d2ebec101ebc6125f2fe459fcffcbcb975` equal to the file's LF sha, the pin record `ooi_network/state/rlx/registration-pin-fhq.json` (local and git-ignored)
carrying the pin time, the engine's sha and the thresholds; the battery 11/11 against the pinned state — the pin matching the file and the
engine, a second registration refused. **The order from here:** the seal commit, its hash naming the read; `read_all()` once — refused if the
engine's sha, the registration's pin, the declared digits or his workings' reading move — the record written once to
`ooi_network/docs/oxexp-ruler-fhq-results.json`, landed in §13 as it falls; the dynamics rebuilt from the record; his reading of the record.

## §13 · The read, landed as it fell (2026-10-14)

After the seal commit 3793df4, `read_all()` once: 2026-10-14T17:53:26+11:00 to 2026-10-14T17:53:27+11:00; the engine at the read `43f80659f8d36fa85ed08e5096444c0d058d508f0b770b1a4317e95bd78ecb04`, equal to
the pin's; the registration's pin `85e897d2af02129642dcc89b720083d2ebec101ebc6125f2fe459fcffcbcb975` equal to the file's; the declared digits and his workings' reading at their pins. The record
written once: `ooi_network/docs/oxexp-ruler-fhq-results.json` (sha256 LF `1c15be9d904c145662c55786b8a3bbc3d974d61a18326142da60758e62ae178b`; 10,136 B; its own results_sha256 `497bad998efed2adb353741925ffac5e5dffb815f15e32c507c90ed263907f9a`).

**The verdicts, as they fell:** T1 PASS · T2 PASS · T3 RECORDED · T4 RECORDED · T5 RECORDED · T6 RECORDED — 2 PASS, 4 RECORDED, 0 REFUTED. **Every measure:** T1 THE CONE PASS — 0 cells off over 102 placements and 690,585 cells; T2 HIS SCRIPT AS GIVEN PASS — the replay from 3.1415 writes 9, 2, 6, 5 against the declared 9, 2, 6, 5, 0 digits off; T3 THE DEPARTURE RECORDED — from 3.1415 at R5 the apex 314154682613… parts at 5, the root of the diagonal 314156537444… at 5, the units 314155763766… at 5, the root of the top three 314159437257… at 6 having written the declared 9, the root of the sum plus one 314157246686… at 5; T4 THE RECURRENCE RECORDED over 4,091 trials against 409.1 if uniform and a longest run of 3.6 by chance — the apex 470 (11.49 per cent, a run of 6 from 2,448), the root of the diagonal 414 (a run of 3), the units 397 (a run of 4), the root of the top three 401 (a run of 3), the root of the sum plus one 407 (a run of 3); the family at R2 to R5 — R2 386 · 448 · 433 · 448 · 443; R3 424 · 442 · 389 · 442 · 414; R4 428 · 405 · 403 · 418 · 418; R5 470 · 414 · 397 · 401 · 407; T5 THE SEED SWEEP RECORDED — the departures by seed 3.1 to twelve placements, the apex 3, 3, 4, 5, 7, 7, 8, 9, 11, 11, 12, no seed held past two under any rule; T6 THE RING RECORDED as unread, no ring named, his figure held.
Every shape as the dry shape of §2c found it.

**What the record observes, in measures.** The record observes, in measures: the cone holds — no cell of the tower moved when the base was extended, at every sampled placement; the engine carries his script as he gave it, 9, 2, 6, 5 from 3.1415; every fixed candidate parts from the declared digits at placement 5 or 6, the root of the top three alone writing the declared 9; over the first horizon the candidates recur at 470 · 414 · 397 · 401 · 407 of 4,091 against 409.1 if the digits were uniform, the apex's 470 with its run of 6 the one local account above the expectation at this horizon, beside its one in ten over ten million (the design's §2b); no seed to twelve placements held past two. What these measures say of his hypothesis — that the arrival of π is strictly contained and deterministically computable within the time-space structure of the number line — is his reading; the record identifies how far each stated rule walks with the declared digits and says nothing of the belief.

**The dynamics, rebuilt from the record** by `ooi_network/experiments/oxexp-ruler/fhq_dynamics.py`: `ooi_network/docs/oxexp-ruler-fhq-dynamics.csv`
(sha256 LF `b8beb49a69ec269604023fecf2af4384853fb1ea2dd8c19712fad0c557bcc5ed`; 180,774 B) and his workbook `context_files/Time's Frequently Held Questions.xlsx` (his folder).

## §14 · His exploration for the later run — the three frequently held questions, read and held (2026-10-14, evening)

**His word, verbatim:** "The pull and reboot is done. Regarding the reading I have incorporated my more helpful model of how to identify the three key questions that are 'held', with explanatory model that I think speaks for itself once reviewed. The file is in context_files here: 'Exploration for FHQ.xlsx'"

HIS MODEL, read by machine (context_files/Exploration for FHQ.xlsx, his folder; sha256 e4cfff22facd8624c5b6fb4b80ced836de85f344dee3e3b1b7d7f797fc32c1cb; 15,912 B) into ooi_network/docs/oxexp-ruler-fhq-exploration-as-read.json (sha256 LF 62a7c028ba6c454fda1ef9deca5e4838f4d04ce56e9fa3b32b898dd6133d2cb0; 112,164 B) by ooi_network/experiments/oxexp-ruler/fhq_exploration.py (NEW, sha256 LF 328a70fbb99fbebec7a7bf05293efbd4cfbc91b78e5afe998c2538ef16201caf): rows 2 to 5 his Past present 2, Past present 1, Pi and Position over positions 1 to 91 — the fold's R2 and R1, the declared digits and placement + 1 (0, 0, 0 and 0 cells off); under 'Past Present' SIX DIFFERENTIALS at every position: Diff 1 the position's difference, 1 everywhere — his 'present + 1'; Diff 2 'growing past present — 2 + 1 past' = Pi[p − 1] + Pi[p − 2] + R1[p − 2] + R1[p − 3] + R2[p − 3] + R2[p − 4], the two prior digits and the two cells of R1 and of R2 above-left of them (87 formulas, 0 off the pattern, the seed 3, 1, 4, 5); Diff 3 'growing past present — 1 past' = Pi[p − 1] + R1[p − 2] (89 formulas, 0 off); Diff 4 'growing past present — exclusive 2 past (triangulated)' = Position[p − 2] + R1[p − 4] + R1[p − 2] (87 formulas, 0 off); Diff 5 'Past 1' = Pi[p − 1] (90 formulas, 0 off); Diff 6 'Past 1 + 2' = Pi[p − 1] + Pi[p − 2], unfolded (89 formulas, 0 off) — his three sums, two prior left values and the present + 1; under 'Externalised Knowing, Held' Diff 7, 8, 9, 10 = 1, 2, 3, 5, each placed at its own position (1 at position 1, 2 at position 2, 3 at position 3, 5 at position 5); under 'FHQs and FAQs' THE THREE QUESTIONS — Q 1: Asked at 11 - carry or hold? · Q 2: Asked at 12 - fold or hold? · Q 3: Asked at 13 - slip or hold?; under 'What is Knowable?' the first fold of each differential at positions 1 to 10, entered by hand, which the house reads as the smallest proper factor of the differential among 2, 3 and 5, 1 where there is none — Diff 1 10 of 10; Diff 2 6 of 6; Diff 3 8 of 8; Diff 4 6 of 6; Diff 5 9 of 9; Diff 6 8 of 8 (every entry agreeing). HELD: his justified true belief; read by no probe of the fhq registration, which stands landed; the model the material of the later run he named.

THE HOUSE'S IDENTIFIERS, stated and never asserted. (1) The registered form asks nothing at eleven, twelve or thirteen: every sum from eleven to eighteen is a carry and folds by n − 9 — 11 → 2 = 1 + 1, 12 → 3 = 1 + 2, 13 → 4 = 1 + 3, the carried one merged with the units digit; his three questions open at the first three sums past ten what the form closes, whether the one is carried, folded or slipped rather than held, and the units digits of those sums are his a priori 1, 2 and 3 (15 = 10 + 5 folding to 6 the fourth); the house names no answer. (2) HOW FREQUENTLY THE QUESTIONS ARE ASKED, over the declared digits at the first fold: at the first horizon of 4,096 sums ten arises 399 times, eleven 313, twelve 300, thirteen 253; at the deep horizon of 400,000,000, ten 36,001,286, eleven 31,997,626, twelve 28,003,662, thirteen 23,996,948 — the sums from ten to eighteen in the ratio 9 : 8 : 7 : 6 : 5 : 4 : 3 : 2 : 1, the number of digit pairs that make each, as the uniform expectation gives (arithmetic beside the count, not a verdict); at the folds above the ratio shifts (the second fold at the deep horizon: ten 43,596,147, eleven 38,401,239, twelve 33,990,735, thirteen 28,800,588), recorded. (3) His six differentials are functions of the cone's left edge and the position: Diff 2 to 6 read only cells before the present, Diff 4 alone reading the position; the later run's rule, stated exactly at his word, writes the next digit from these and their first folds, and is read as the house's candidates were — for the departure and the recurrence. (4) His first folds at positions 1 to 10 agree with the smallest-proper-factor reading at every entry, the same reading that held at 368 of 371 and 79 of 80 entries of his earlier workings.

**The later run, at his word, design first:** the rule stated exactly over his six differentials and their first folds (which of the six write
the next digit, by what operation, and how the three questions are answered at eleven, twelve and thirteen), over R1 and R2 from 3.141592
(his answers 2 and 4 to §11); its instrument under the Ruler's protocol, read for the departure and the recurrence as the house's
candidates were; every verdict a measure, the belief held whatever the rule measures.

## §15 · His rule for the later run — the lowest set of differentials, held (2026-10-14, evening)

**His words, verbatim:** "The next digit will be written by the lowest set of differentials. If there are two equal lowest differentials then the digit will 'slip' on such pairings until the immutable differential of '1' is applied. So... it is a matter of combinatorics over 5x5 'sets' looping through the 6 rows and 5 columns of histories."

THE HOUSE'S IDENTIFIERS, stated and never asserted. (1) His six differentials, as his sheet defines them with its seed values, reproduced by the house at every placement — at placement 4 the values 1, 25, 6, 12, 1, 5 and the first folds 1, 5, 2, 2, 1, 1, his column G cell for cell; at 5 the values 1, 20, 11, 15, 5, 6 and the folds 1, 2, 1, 3, 1, 2; at 8 every fold 2 but the immutable 1. (2) THE READINGS HIS SENTENCE ADMITS, each stated exactly and walked dry over the declared digits (read by nothing, judged by nothing): A — the lowest first fold among Diff 2 to 6, the tied lowest slipped past to the next lowest, 1 where none is unpaired: writes at placements 4 to 11 5, 3, 1, 3, 1, 2, 5, 1 against the declared 5, 9, 2, 6, 5, 3, 5, 8, recurring at 10.46 per cent against the digit at p and 10.39 against the digit at p + 1 over 4,092 trials; B — the lowest first fold, a tie applying 1 at once: writes at placements 4 to 11 1, 1, 1, 1, 1, 1, 1, 1 against the declared 5, 9, 2, 6, 5, 3, 5, 8, recurring at 10.65 per cent against the digit at p and 10.70 against the digit at p + 1 over 4,092 trials; C — the lowest value among Diff 2 to 6, the tied lowest slipped past, the value folded to a digit: writes at placements 4 to 11 1, 5, 9, 2, 6, 5, 3, 5 against the declared 5, 9, 2, 6, 5, 3, 5, 8, recurring at 9.02 per cent against the digit at p and 10.00 against the digit at p + 1 over 4,092 trials; D — the lowest value, a tie applying 1, folded to a digit: writes at placements 4 to 11 1, 5, 9, 2, 6, 5, 3, 5 against the declared 5, 9, 2, 6, 5, 3, 5, 8, recurring at 9.24 per cent against the digit at p and 10.26 against the digit at p + 1 over 4,092 trials; E — the lowest value slipped past pairings, its units digit: writes at placements 4 to 11 1, 5, 9, 2, 6, 5, 3, 5 against the declared 5, 9, 2, 6, 5, 3, 5, 8, recurring at 9.12 per cent against the digit at p and 9.95 against the digit at p + 1 over 4,092 trials; F — the row whose first fold is the lowest unpaired, its value folded to a digit: writes at placements 4 to 11 1, 2, 2, 2, 8, 5, 2, 4 against the declared 5, 9, 2, 6, 5, 3, 5, 8, recurring at 10.73 per cent against the digit at p and 9.68 against the digit at p + 1 over 4,092 trials. Reading A writes the declared 5 at placement 4 by slipping past the pairs 1, 1 and 2, 2 to the unpaired 5, and then 3 against the declared 9 at placement 5; no reading walks past the first placement it writes, and every one recurs at about one in ten, as the house's candidates did. (3) WHAT 'COMBINATORICS OVER 5 × 5 SETS' NAMES is the family the later run's design would enumerate — the five differentials beyond the immutable 1 over the five columns of history behind a placement — and the house reads it as a family of rules to be stated one by one and measured each for its departure and its recurrence, not as a rule. (4) THE CLARIFICATIONS the rule needs before it is exact: whether 'the lowest set' is the first folds (what is knowable) or the values; what the slip does at a pairing — pass to the next lowest, or apply the immutable 1 at once; whether a column's differentials write that column's digit (as his sheet's columns stand) or the next; what the 5 × 5 is — Diff 2 to 6 over the last five positions, or five positions by five rows otherwise — and what 'looping' orders it; whether Diff 1 is the fallback or a member of the set; and how the three questions at eleven, twelve and thirteen enter the writing.

**The later run, at his word, design first:** the rule stated exactly from these clarifications, or the 5 × 5 family enumerated as a set of rules
stated one by one; the instrument over his six differentials and their first folds, over R1 and R2 from 3.141592; read for the departure and
the recurrence under the Ruler's protocol; every verdict a measure, the belief held whatever a rule measures.

## §16 · His least differential ranking — a candidate mechanism, held (2026-10-14, evening)

**His words, verbatim, his spelling:** "If the external 'mathematician typed observer' holds their own measures and accounts to an onto-epistemic pi of 3.14159, then the attached image would be considered as the 'least differential ranking: The differential is 4 over the 'square', which is to sat the column differs by a total of four to the row of ones. Or, the differential is 3 over 6 rows within only the column itself. The differential between these two is 1 and 1+1 = 2. This is a candidate mechanism for solving the 6x6 officers problem within the picking of the next diget..."

HIS IMAGE, transcribed: his sheet's 'What is Knowable?' block with the rows re-ordered by the highlighted column (position 6, placement 5) — First Fold of Diff 1: 1 1 1 1 1 [1] 1 1 1 1; Diff 3: 1 3 2 [1] 2 2 2 1; Diff 5: 1 1 2 1 [1] 3 1 2 1; Diff 6: 2 1 1 [2] 2 1 2 1; Diff 2: 5 [2] 1 3 2 1; Diff 4: 2 [3] 3 2 2 2 — the column reading 1, 1, 1, 2, 2, 3 from the top.

THE HOUSE'S IDENTIFIERS, stated and never asserted. (1) The column is the house's own: from his definitions the first folds at placement 5 read 1, 2, 1, 3, 1, 2 by row (Diff 1 to 6) and 1, 1, 1, 2, 2, 3 ranked — his image cell for cell. (2) HIS TWO DIFFERENTIALS have exact seats: A, 'the differential over the square', is the column's six folds less the row of ones, 0 + 0 + 0 + 1 + 1 + 2 = 4; B, 'the differential within the column itself', is 3 under three readings that coincide at this column — the largest fold, the count of distinct folds, and the distinct folds less one each summed (0 + 1 + 2); A − B = 1 and 1 + 1 = 2, the declared digit at placement 6. (3) THE SAME RANKED COLUMN stands at position 8 (placement 7), where the next digit is 5; over the first horizon 1, 1, 1, 2, 2, 3 occurs 479 times and is followed by every digit, 0 42 times, 1 50 times, 2 45 times, 3 49 times, 4 47 times, 5 41 times, 6 43 times, 7 52 times, 8 55 times, 9 55 times — a mechanism that reads the ranked column alone writes one digit for all of them. (4) THE CANDIDATE WALKED DRY (the next digit as A − B + 1, B under each reading, read by nothing, judged by nothing): A - B(max) + 1, raw_or_root: writes 2, 2, 4, 2, 4, 0, 2, 2 at placements 4 to 11 against the declared 9, 2, 6, 5, 3, 5, 8, 9 that follow, recurring at 9.73 per cent over 4,091 trials; A - B(max) + 1, mod_10: writes 2, 2, 4, 2, 4, 0, 2, 2 at placements 4 to 11 against the declared 9, 2, 6, 5, 3, 5, 8, 9 that follow, recurring at 9.73 per cent over 4,091 trials; A - B(distinct) + 1, raw_or_root: writes 4, 2, 4, 2, 4, 0, 4, 2 at placements 4 to 11 against the declared 9, 2, 6, 5, 3, 5, 8, 9 that follow, recurring at 9.63 per cent over 4,091 trials; A - B(distinct) + 1, mod_10: writes 4, 2, 4, 2, 4, 0, 4, 2 at placements 4 to 11 against the declared 9, 2, 6, 5, 3, 5, 8, 9 that follow, recurring at 9.61 per cent over 4,091 trials; A - B(sum_distinct_minus_one) + 1, raw_or_root: writes 2, 2, 4, 2, 5, 1, 2, 3 at placements 4 to 11 against the declared 9, 2, 6, 5, 3, 5, 8, 9 that follow, recurring at 9.68 per cent over 4,091 trials; A - B(sum_distinct_minus_one) + 1, mod_10: writes 2, 2, 4, 2, 5, 1, 2, 3 at placements 4 to 11 against the declared 9, 2, 6, 5, 3, 5, 8, 9 that follow, recurring at 9.68 per cent over 4,091 trials. (5) THE CEILING OF A COLUMN-ALONE RULE, measured on the declared digits themselves — the majority next digit per distinct column, an upper bound fitted to the same digits and no rule: the six first folds make 329 distinct columns over 4,091 placements and the ceiling against the next digit is 950 (23.2 per cent); the ranked column makes 45 distinct rankings, the ceiling 551 (13.5 per cent); the six values unfolded make 4,090 distinct columns, 4,089 of them seen once, so that any rule on the values can be fitted to every next digit and carries no law — the first folds are what makes a rule a rule here. (6) Euler's thirty-six officers, the Graeco-Latin square of order six, is a published fact named by its name and asserted of nothing; his 'candidate mechanism for solving the 6x6 officers problem within the picking of the next digit' is his figure, held; the onto-epistemic π of 3.14159 held by the external mathematician-typed observer is his seed to placement 5, his figure, held.

**What this adds to the later run's design:** a candidate stated as A − B + 1 over the ranked column of first folds, with B's reading his to
name (§15's clarifications stand); the ceiling as the measure every column-alone rule is read against — the recurrence of a rule beside the most
any rule on that column could reach at the horizon; the 6 × 6 (six columns of history) as the way past the column's ceiling, if he names it.

## §17 · His initialization and the discovery of the rules, held (2026-10-14, evening)

**His words, verbatim, his spelling:** "This is an initialization of the knowing... once the 2 is known from this, the system is rerun on the next column, with 'more' data that can satisfy a 2x2 'slip, carry fold or hold' between rows. This is the 'art' of such a slection of askings. That it reveals itself via upper or lower bounds in normal approaches to Pi is because of the need to 'tune' to the 'learned' result if the specific dynamic is not computationally 'known' by the externality of the 'mathematitian types observer'. The challenge of this experiment is to 'discover' the rules via combinatorics and then latter 'know' the application at each state of change at the column."

THE HOUSE'S IDENTIFIERS, stated and never asserted. (1) THE INITIALIZATION is the seed's first write: the ranked column at placement 5 writing 2 at placement 6, the first digit past the seed 3.14159 the externality holds. (2) THE RERUN ON THE NEXT COLUMN is the generative loop the engine already walks — the tower rebuilt over the base so far, the next digit written, the base extended, the column rebuilt — and the departure is the placement at which that loop and the declared digits first part. (3) THE 2 × 2 OF SLIP, CARRY, FOLD OR HOLD BETWEEN ROWS names an operation chosen at each column for a pair of rows: with six rows there are fifteen pairs and four operations, sixty askings a column, or two rows by two operations if the 2 × 2 is read that way — the space is sized exactly once he states it; hold and carry have their seats in the form (a sum under ten holds, a sum of eleven to eighteen carries and folds by n − 9, ten releases a pure one), fold and slip are his to define on the form. (4) THE COVERAGE OF THE ASKINGS, measured at the first horizon over 4,091 placements — at how many the next digit is among the askings of a kind at all, which is the ceiling of any art of selection among them before a rule for selecting is stated: among the six first folds 1,105 of 4,091 (27.0 per cent), the folds lying in 1, 2, 3 and 5 only, which are 40.5 per cent of the digits; among the roots of the six values 1,881 of 4,091 (46.0 per cent); among their units 1,953 of 4,091 (47.7 per cent); among the folds or the roots 2,290 of 4,091 (56.0 per cent); among the roots of the fifteen pairwise sums 2,994 of 4,091 (73.2 per cent); among the pairwise sums held under ten and folded at ten or more 1,563 of 4,091 (38.2 per cent); among the pairwise differences 3,370 of 4,091 (82.4 per cent); among any of these 2 × 2 askings 3,998 of 4,091 (97.7 per cent). (5) THE THREE MEASURES THAT NOW STAND BESIDE ONE ANOTHER: the coverage (what a perfect selection could reach, 97.7 per cent with the pairwise askings in), the ceiling (what any rule reading the column alone could reach, 23.2 per cent on the six folds and 13.5 on the ranking), and the recurrence (what every rule stated so far reaches, about one in ten) — the distance between the first and the last is exactly the art he names. (6) THE FENCE ON TUNING, in his own terms: a selection chosen after the next digit is seen is a fit, and the house reads a fit only for its recurrence on placements it was not fitted to — the departure from the seed is that reading; a rule discovered by combinatorics over the first horizon is read at the deep horizon, or over the placements held out, and never on the digits that chose it. (7) No claim about π's bounds or the normal approaches to it, nor about combinatorics; his 'discover the rules via combinatorics and then later know the application at each state of change' is the later run's challenge as he states it, held.

**What the later run's design becomes, at his word:** a discovery instrument — the space of askings declared (the rows, the pairs, the four
operations defined on the form), a selection rule learned column by column over a declared span of the declared digits, and read as the house
reads every rule: its departure from the seed, its recurrence on the placements held out of the learning and at the deep horizon, with the
coverage and the ceiling beside; every verdict a measure, the belief held whatever the instrument finds.

## §18 · The discovery instrument — AS ANSWERED AND AS BUILT (2026-10-14, evening): stage two of the fhq line

**His seven answers to §18's clarifications, verbatim, his spelling:** "the box act is done / re 1 - the seed is 3.14159 / re 2 - i'm happy for you to document and test these as part of the discovery process / re 3 - The learning and reading span is already embedded in the possible structures of diffs 1 to 6 and the ranked folding of such diffs.  The 'decision' has been suggested as the combinatoric 'least differential' set of the first 5x5, which would naturally put the 'sixth row' last. / re 4 - the six differentials are derived from R 1 and R2 which will 'grow' as decimal places of Pi are correctly 'decided'. / re 5 - answered as per point 3 / re 6 - no stake except to note the form of 'poetry'  where the number of stanzas and lines provides for a full 'loop'. This is the likely 'form to manner' of looped rules, yet the actual 'chords and octaves' are a separate and possibly complicating dynamics. / re 7 - yes, this goes under the FHQ experiment line. It can be considered as a stage in the FHQ experiment. / Please go ahead with these clarifications accounted for."

HIS SEVEN ANSWERS READ: the seed 3.14159; the four operations the house's definitions, documented and tested as part of the discovery; no learning span and no reading span apart from the structure itself — the six differentials and their ranked folding carry both — and the decision the combinatoric least differential set of the first 5 × 5, the sixth row last; the rows his six differentials over R1 and R2, which grow as the base is decided; the 6 × 6 answered by the 5 × 5; no stake, his note on the form of poetry (stanzas and lines making a full loop; chords and octaves a separate dynamics) held as his figure, read by no probe; a stage in the fhq line — registration two of the fhq engine, under the mint fhq.

**§18.0 · The proposal of 0.9, superseded in two places by his answers.** The 0.9 proposal carried a learning span and a held-out reading span
with a selection learned column by column; his answer 3 removes both — "the learning and reading span is already embedded in the possible
structures of diffs 1 to 6 and the ranked folding of such diffs" — and names the decision: the combinatoric least differential set of the first
5 × 5, the sixth row last. The instrument therefore learns nothing from the digits: every member is a declared function of the window and of
nothing after it, and the discovery is the enumeration of the family and the reading of every member. The fence on tuning survives as a
measure rather than a procedure: every member is read at the first horizon and at the deep span, so that a member singled out on the one is
seen beside its reading on the other. The 0.9 proposal's seed alternative (3.141592) is closed by his answer 1; its rows question by his
answer 4; its 6 × 6 by his answer 5 (the first 5 × 5); its stake by his answer 6 (none); its name by his answer 7 (a stage in the fhq line).

**§18.1 · THE INSTRUMENT AS BUILT (ooi_network/daemon/rlx_time.py, registration two, additive; sha256 LF 994877e76844e7aa3d2adf977a86ad5e470de9529d6bc135d7460b4d1d66da51; 90,817 B): THE WINDOW — at a column c his six differentials V1 to V6 over the base known to c − 1 (R1 and R2 the fold's lines; Position = placement + 1; his sheet's seeds before each formula begins) and their first folds (the smallest proper factor among 2, 3, 5, else 1); the six rows RANKED at c by first fold, ties by row with Diff 1 first, the first five the window and the sixth last and outside; the window carried over the five nearest columns c − 4 to c — the first 5 × 5. THE ASKINGS on a pair of rows (on the folds or on the values — the SET): HOLD the units of the sum; CARRY the form's own, the sum less nine iterated to a digit; FOLD his first fold of the sum; SLIP the differential between the rows mod 10. THE DECISION, the house's reading of his least differential set: for every pair of window rows the pair's differential over the five columns, Σ|Sx(k) − Sy(k)|; the least pair asked; at a pairing the 1 applied first — preferring the pair that holds the immutable 1, then proximity (the nearest column first), then rank (prefer-1), or writing the 1 at once (write-1, his §15 as read); the operation on the least pair by one of twelve policies — the eight answerings of his three questions (at 11 carry or hold, at 12 fold or hold, at 13 slip or hold; under ten the sum holds, ten releases the one, fourteen and above carry) and the four operations fixed; the digit written to the NEXT placement (his §16 and his initialization) or to the column's OWN (his sheet's columns as they stand) — the TARGET. THE FAMILY: 96 members of the least-pair class (2 sets × 2 slips × 12 policies × 2 targets), 24 of his §16 square-differential class (A − B + 1 over the column or over the 5 × 5, B the largest fold, the distinct folds or the distinct folds less one summed, brought to a digit two ways, two targets), 4 of his §15 lowest-set class (the lowest first fold or the lowest value rooted among Diff 2 to 6, a pairing applying the 1) — 124, every one declared before any read and every one read; his rule as given named L|B-folds|next, the house's reading of his decision P|folds|prefer-1|fhq:carry-fold-slip|next, both named now and fitted to nothing. THE READING: D1 THE WINDOW'S IDENTITY (his differentials and first folds against his exploration as read, cells off; threshold his); D2 HIS INITIALIZATION (the ranked column at 5 reading 1, 1, 1, 2, 2, 3 and his A − B + 1 writing the 2 at 6; threshold his); D3 THE DEPARTURE of every member from 3.14159, the base grown as it writes and R1, R2 rebuilt over it; D4 THE RECURRENCE of every member at the first horizon (columns 8 to 4,095, the walker cell by cell); D5 at the deep span (columns 8 to 9,999,999 of the fold's cached decimals by the DPX's pin, a vectorised reader over exact integers held equal to the walker on every member); D6 THE COVERAGE of the window's 45 askings and the column's 66 and THE CEILING of the ranked column at both spans; D7 how often the least pair's sum is 10, 11, 12 or 13 — the questions asked; the members' table beside the record as a CSV. THE GUARDS: test_rlx_time 18/18 (sha256 LF b8cbef025594a709d2cacb83a84157891fa834c9e326627089693fe10ebba110) — the window against his exploration (0 of 593 cells off), the askings by hand, the least pair and his initialization, the family, the departures, the recurrence against an independent loop, the reader equal to the walker and its statistics equal across chunk boundaries, the coverage and the ceiling by both readers, registration two refused before its file, registration one standing landed.**

**§18.2 · THE DRY SHAPE, read by nothing, judged by nothing (293.6 seconds on the 3.11 interpreter): D1 0 of 593 cells off; D2 his 2 at 6 carried; D3 — 93 of 124 members part at placement 6, the first write, and 31 write the declared 2 at 6 and part at 7, none further: his rule as given writes 111111… against 265358, the house's reading 232222…; D4 at the first horizon over 4,088 columns (408.8 if uniform; the run chance gives 3.6) the 124 members recur from 9.03 per cent to 10.84 per cent, the median 10.01 per cent, 62 above one in ten, the longest run of any member 5; the highest P|values|prefer-1|fold|next at 443 (10.84 per cent); his rule as given 438 (10.71 per cent, a run of 3); the house's reading 408 (9.98 per cent); D5 at the deep span over 9,999,992 columns (999,999.2 if uniform; the run chance gives 7.0) every member between 9.98 per cent and 10.02 per cent, the median 9.99 per cent, 29 above one in ten, the longest run of any member 9 — the first horizon's highest reads 10.01 per cent at the deep span and the deep span's highest (S|square|sum_distinct_minus_one|raw_or_root|next, 10.02 per cent) read 10.03 per cent at the first: a member singled out on the one stands at one in ten on the other, the fence on tuning as a measure; his rule as given 999,261 (9.99 per cent, a run of 7), the house's reading 1,000,285 (10.00 per cent); the reader equal to the walker on all 124; D6 the coverage at the first horizon — on the folds the window's askings hold the next digit at 48.46 per cent of columns and the column's at 59.44 per cent, on the values 95.82 per cent and 98.70 per cent (at the deep span 48.83 per cent, 59.94 per cent, 95.97 per cent, 98.69 per cent); the ceiling of the ranked column 552 of 4,088 (13.50 per cent, 45 rankings) at the first horizon and 1,007,687 of 9,999,992 (10.08 per cent, 46 rankings) at the deep — a bound fitted to the same digits shrinking toward one in ten as the span grows; D7 the questions on the least pair: on the folds never (no pair of first folds reaches ten), on the values at the first horizon ten 117, eleven 46, twelve 55, thirteen 63 of 4,088; at the deep span ten 237,239, eleven 112,115, twelve 146,425, thirteen 130,615 of 9,999,992 — the three questions asked at about one column in a hundred each.**

**§18.3 · What the dry shape identifies, in measures and asserting nothing.** Every member of the family recurs at about one in ten at both
spans, the spread at the first horizon (9.03 per cent to 10.84 per cent) narrowing at the deep span to 9.98 per cent to 10.02 per cent, which is
the width the uniform expectation gives at ten million trials; the member highest at the one span is not the member highest at the other. The
coverage shows what any selection among the askings could reach (98.70 per cent on the values, the column's
66 askings) and the ceiling what any rule reading the ranked column alone could reach (13.50 per cent at the first
horizon, 10.08 per cent at the deep); between the coverage and the recurrence of every stated member lies what he
named the art of selection, measured here from both sides and claimed of nothing. His three questions are asked on the least pair at about one
column in a hundred each on the values and never on the folds, whose pairwise sums do not reach ten. His thesis — π locally emergent at 3.15 and
only held as an ephemeral irrational if that holding is carried — is his justified true belief, held; the dry shape identifies how far each
member of the family walks with the declared digits and says nothing of the belief.

**§18.4 · What remains his.** The registration of stage two: the thresholds D1 and D2 set in the engine at that act (the house's default 0 for
identities), the registration file written and pinned, the seal commit, the read once (the first horizon and the deep span, 293.6 seconds in
the dry) and the record with the members' table; the deep span's extension to 400,000,000 if he calls it; his reading of the fhq record; his
notes under the business of π; the mint as fhq. The four operations' definitions and the house's reading of his decision stand as documented
and are his to amend before the registration; after the pin they are the registration's.

## §11 · [CLARIFY] — the decisions owed to him, ANSWERED (2026-10-14; his words in §0)

1. **The rule.** ANSWERED: the house's candidates for this run (ρ_A, ρ_B, ρ_C, ρ_F, ρ_G; ρ_H his script as T2); his own candidates for a later
   run, to be drawn up by him. 2. **The depth.** ANSWERED: R5; his later run R1 and R2 only, noted. 3. **The carry's one.** ANSWERED: not minded —
   off; his reading held: the one carried up or down and the sum over columns matter for correlation, likely not causation in the sense of what
   becomes computably knowable once the dynamics are drawn from experiments. 4. **The seed.** ANSWERED: 3.1415; his later run 3.141592 over R1
   and R2. 5. **The ring.** ANSWERED: figurative here; the literal ring the triangulation of knowing via inductive reasoning, true belief and true
   identifiers held and carried by the system's internal, boundary and externalities, operated via lawful state dynamics — HELD; T6 unread, no
   ring named. 6. **The stakes.** ANSWERED: a horizon stake, not for this run — pure ontological π as 3.15, extended by a reader of the 4th at
   position 5 whose reading is its own expansion, 3.1[]5 unfolded from 4 as 3.1[41]5, then [10][01] landing as 10 − 1 at 3.14159[] with the last []
   the local expectancy of the external observer holding a place — HELD, his justified true belief, carried verbatim in the engine and read by no
   probe of this run; the house's identifiers beside, asserted of nothing: 4 + 1 = 5 the fold forward at placement 4 (3.1[41]5); the two tens of
   the registered tower at the origin — R2's 5 + 5 and R3's 9 + 1 — standing where his [10][01] stands, 10 − 1 = 9 the declared digit at 5; T3 and
   T4 RECORDED without a numeric stake. 7. **The name.** ANSWERED: TIME'S FREQUENTLY HELD QUESTIONS (the engine's NAME; fhq its short name).
   8. **The horizon.** ANSWERED: 4096 carried as computed to 4101 — the first horizon, the declared digits by the fold's pin; his expectation held:
   π to 'turn' upon a very local account and look back upon a very local knowing; the number line of counts differential to such localities over
   further horizons, a different typing of externality. 9. **The anchor.** ANSWERED: fhq — `ANCHOR_PLANNED` fhq-exp_2dbdb720 under the Ruler's
   package; the mint his act. 10. **The plates.** ANSWERED: not minded; the dynamics as a CSV and a workbook — delivered at the engine step (§3).

The ten as first posed (draft 0.1):

1. **The rule.** Which cells of the new-knowing diagonal are summed at each placement and which operation reads the sum: one of the house's
   candidates (ρ_A, ρ_B, ρ_C, ρ_F, ρ_G), or a rule of his own stated exactly; his script as given stands as T2 either way.
2. **The depth.** The register's cap D — R1 to R5 (five), R6 (six), or the whole triangle.
3. **The carry's one.** Whether a carry's one stands as a cell of its own, as his variant rows '1 2 3', '1 5', '30 6' have it, and by what
   rule (the one alone, or the one beside the folded digit); off by default.
4. **The seed.** 3.1415 by default (his initiation); 3.1 or 3.14159 if he prefers; the sweep beside.
5. **The ring.** What "the ring that grows to R6 but is entangled with Pi" names — the register's depth, or the DPX's ring of 192 — and
   whether T6 is read.
6. **The stakes.** A placement for T3 and a rate or a run for T4, if he stakes them; RECORDED otherwise.
7. **The name.** THE FOLDING OF TIME — the co-construction; his to amend.
8. **The horizon** for the recurrence: ten million, or the deep horizon of 400,000,000.
9. **The anchor.** rlx-time-exp_2dbdb720, the house's proposal; his to amend before any mint.
10. **The plates.** The generated base against the declared digits with the cone; the recurrence's runs; what else he wants to see.