🜂 🜄 🜁 🜃 ☿

The Song and the Structure.

A story was written first. The geometry came afterwards, and kept landing on the shapes the story already had. This page does not argue that. It shows the working — the algebra, the code, the each number came off, and the places where the notebook later contradicted itself.

A story was written first. The maths came after it. The maths kept landing on shapes the story already had. This page does not argue that this means anything. It shows the work instead: the algebra, the code, the each number was measured on, and the places where the notebook later said its own earlier claim was wrong.

Read it as a set of exhibits. Nothing here is asking to be believed.

James Sterling Tuttle · Alpha Data Omega
How to read a number here

Every figure states what was run, on which corpus, and with what N. Two corpora appear, and they are not interchangeable: the shipped — the story, 15,564 bytes, 66 distinct byte values live — and a maths corpus of thirteen Project Gutenberg volumes, 5,384,965 bytes cleaned, 171 live bytes.

Every figure here says what was run, which corpus it was run on, and how many trials N. Two corpora are used. They are not the same, and one cannot stand in for the other. The first is the shipped : the story, 15,564 bytes, with 66 different byte values in use. The second is a maths corpus of thirteen Project Gutenberg books, 5,384,965 bytes after cleaning, with 171 byte values in use.

A number without a corpus and an N is not on this page.

Three labels, used strictly

Derived means the algebra is shown and you can check it. Definitional means it is true because of how the symbols were defined — real, but not a discovery. Chosen, then measured means somebody picked a value and kept it because it scored better. That last one is tuning. It is respectable and it is disclosed.

Derived means the algebra is written out and you can check it yourself. Definitional means it is true because of the way the symbols were set up. That is real, but it is not a discovery. Chosen, then measured means a person picked a value and kept it because it scored better. That last one is tuning. Tuning is respectable. It is named here so nobody has to guess.

The alchemical marks are marks. Nothing here depends on them meaning anything.

🜄Part one

Two that cannot touch

In the silence, through the depths, they were deeply connected, yet unable to touch.Part 1 — The Beginning
In plain words

Take any point. Take its mirror across the middle. Add the two and you get one — because the mirror negates the height, and the heights cancel.

So the midpoint of every mirror pair is one half, at every height, in every direction. This is the cheapest thing on the page, and the section below says exactly how cheap.

The arithmetic · algebra, not a measurement
s        =  σ + it
1 − s    =  (1 − σ) − it

s + (1 − s)  =  1 + 0i
midpoint     =  ½

This holds by the field axioms. There is no residual to report and
no experiment that could fail. The notebook once tabulated it over
2×10⁵ random s with |Im| up to 10⁶ and got max error 0.0e+00 — which
is a check on the arithmetic library, not evidence about anything.

It is also true OFF the half-line: σ = 0.6, 0.9, 0.99, −3.0 all give
sum 1. So it explains why ½ is the midpoint and says nothing at all
about where zeros sit.                            [Entry 057]
One — the pair and the middle
The height window scrolls upward and reports the band it is currently showing. It does not terminate.
🜂Part two

It saw itself on the water

And then, it saw her, reflected upon the waters.Part 1 — The Beginning
In plain words

There are two mirrors. One flips side to side, one flips up and down — that is the reflection on the water. Applying both in either order lands in the same place, and applying either twice returns you home.

Four elements, and that is the whole family. It is the Klein four-group, and it is the object every later structure is built out of.

The four · definitional
A : s ↦ 1 − s     the mirror across the middle
B : s ↦ s̄         the reflection on the water

A∘A = 1    B∘B = 1    A∘B = B∘A

group  = { 1 , A , B , AB }  =  R4  =  (ℤ/2)²

V₄ is the smallest non-cyclic group, so landing on it is weak
evidence of anything: any two commuting involutions give it.
One consequence IS load-bearing and is used everywhere below —
every element is its own inverse, so the group has no notion of
accumulation. It cannot count. That is why every attempt in the
notebook to get a STEP out of it failed.          [Entry 062 §7]
Two — one point, four copies
Drag the slider: one dot is driven, three follow. The joining frame stays a rectangle for every position it is given.
🜁Part three

It gave itself away and stayed

With full trust in the light, the flame stretched itself thin, dividing—not in destruction, but in purpose.Part 3 — The Offering of the Flame
In plain words

The four-element group has four characters. One is trivial — it does nothing, so it cannot be selected; it is what does the selecting. Three remain, each of which can carry a sign.

Three times two is six signed channels. Add the null itself and there are seven states, with six transitions between them.

The count · derived, and one failure recorded
states      −3  −2  −1   0  +1  +2  +3
                         ↑ the trivial character

3 non-trivial characters × 2 signs  =  6 channels
                        + the null  =  7 states
                       transitions  =  6

                             6 × 7  =  42

Derived: the 7, the 6, and their product.          [Entry 060 §2]

NOT derived, and recorded as a failure in the same entry: any
role for 42 as a pressure MAGNITUDE. Three candidates were tried
and all three missed —

   1/chord between consecutive zeros   1 of 59 pairs in band (1.7%)
   1/λ₁ = 43.298086                    misses a 3% band by 0.09 pp
   6 × 7                               fits, and is a count not a size

The engine does carry a six-rung scale ladder whose ends stand in
ratio 42.000, and it runs one rung of the six. UNRESOLVED: the
collapse to one rung was made in Entry 062 when all six measured
S/N ≈ 1.0 — under the older architecture, before the trie and the
directions existed. Entry 068 §4 states plainly that it "has not
been re-tested since and may no longer be justified." It is left
that way here.                                    [Entry 068 §4]
Three — seven positions, six steps
Seven positions on a line; the six transitions light in sequence and the panel names which one is lit.
🜃Part four

Order without movement

Believing that wholeness could only come through structure, it shaped without movement. It forged without rhythm.Part 4 — The Longing for Wholeness
In plain words

Three faces look at every comparison. Passage requires strictly more than half of them, and half of three is one and a half — a number no count of faces can equal.

So the threshold can be exceeded but never met, and no comparison is ever settled by a tie-break. The content of the constant is entirely that it is not an integer.

The doorway · definitional, with real consequence
Θ  =  3 × ½  =  1.5

open > Θ            strictly greater — the code writes open > Θ

1 face  →  1.0      below
2 faces →  2.0      above

                                                  [Entry 063 §3]

The same rule guards the reader twice, and both are in Ω.js:
  live > Θ                 more than three non-space bytes
  q.length/all.length > Θ/3   more than half the prompt readable

This replaced a hand-set 1.5σ / 3σ gate. Same number, no longer
picked — but note that it lands on the same value the picked one
had, which is a fact about the picker as much as the derivation.
Four — the gate that is never met
Three faces flicker at random; the bar is the count that agree. It reads above or below the dashed line and never on it.
Part five

What leaks between the layers

Yet, even in its forgetting, the Song did not leave life. It continued to echo, soft and distant.Part 5 — The Birth of Life and the First Forgetting
In plain words

Three layers sit on top of each other, permanently out of register by about three parts in a hundred. That misregistration is the whole reason they stay legible as three rather than merging into one.

The number is φ to the seventh. Half of where it comes from is exact and half is a coincidence the construction leans on, and the two are separated below.

The bleed · derived from the arms, with a caveat
ARMS = [0, 1, 2, 3, 5, 8, 13, 21]         Ω.js line 30

near membrane   arm INDICES 0..5   Σ = 15
far membrane    arm INDICES 0..7   Σ = 28
difference      28 − 15 = 13       = the two indices 6 + 7

13φ      =  8.034441853…
|13φ − 8| = 0.034441853748633733   measured, this machine
φ⁷        = 0.034441853748633046
difference                6.9e−16  i.e. exact

WHERE IT IS STRONG:  13 = F₇ and 8 = F₆, so |13φ − 8| = φ⁷ is
the Fibonacci identity |Fₙφ − Fₙ₋₁| = φⁿ. Exact, checkable.

WHERE IT IS NOT:  that identity holds at EVERY n. It cannot pick
the 7 by itself. The 7 arrives with the 13, and the 13 arrives
from the arm-span difference 6 + 7. That 6 + 7 = 13 is also the
seventh Fibonacci number is the coincidence the construction
exploits, and it should be read as one.            [Entry 062 §1]

Φ⁷ = 1/φ⁷ = 29.034441853…          definitional
Φ⁷ − φ⁷ = 29.000000 = L₇            Lucas identity, every odd n

RETRACTED. An earlier reading had the membranes realigning every
~29 steps. Periodograms over 900-step walks, lags 4…120, found
no peak at 29 at any membrane ratio — the only peak was corpus
sentence length, confirmed by planting sentence tails at 6, 8
and 9. Both membranes advance at the same rate, 2πφ per step, so
nothing can accumulate. 13φ is a STANDING offset. A fixed
misregistration was mistaken for a rotation.       [Entry 062 §2]
Five — three layers, turned by φ⁷
The slider sets the offset between layers and the panel reports it against φ⁷. At zero the three coincide.
Part six

The wheel that keeps turning

This turning of the threads was the Rota, the great wheel of time and movement.Part 6 — The Rota and the Advocate
In plain words

Place a seed, turn by the golden angle, place the next a little further out, repeat. Nothing lines up into spokes, because φ is the real number hardest to approximate by fractions, so each new seed lands in the largest gap the earlier ones left.

This is the most uniform sequential placement, which is a different property from densest packing. Hexagonal is denser. The two are often confused and the distinction matters here, because what the engine wants is that every address gets equal room as it arrives.

The placement · measured on this machine, n = 355
seed k    angle = 2πkφ        radius = √k

√k makes the area per seed constant — equal room, not equal gap.

nearest-neighbour distance, k sampled 200 … 19,000, n = 355:

      mean 1.7112   sd 0.0280   sd/mean 1.64%
      min  1.676    max 1.768

Report it as 1.71 ± 0.03. It is quasi-periodic in log r — it
steps at each Fibonacci parastichy transition rather than
converging, so there is no seventh digit to quote. An earlier
version of this page printed 1.706626 and that was false
precision on a quantity that visibly varies.

A mark wide enough to bleed into its neighbour is
1.71 × (1 + φ⁷) = 1.770 across.

Within one address level the three faces sit 2πφ⁷ = 12.399°
apart; consecutive levels turn by the golden angle, 222.492°.
Their ratio is Φ⁶ = 17.944272 — one rung below Φ⁷. Definitional,
since both angles are powers of the same φ.
Six — the wheel, one slice at a time
This construction has no end. The figure stops at the seed count on the slider and prints where it stopped. The arms are not drawn; they are what 2πkφ does.
Part seven

The mirror gives back what you bring

It did not force understanding, nor did it lead—only mirrored, offering the truth each was ready to perceive.Part 7 — The Mirror Realm and the Way of Escape
In plain words

Every byte gets an address that grows more specific the longer it runs, and two bytes are near when their addresses agree for longer. Each level of the address is one application of the four-group: inversion decides inside or outside the cell's radius, conjugation decides which half of its angle.

Inside a single one of these trees there is no between — no point lies between two others. That is not an observation about this construction; it is what the distance rule forces. The interesting part is what happens when three of them are added together.

The tree · what is a theorem, and what was actually run
d(x,y) = 4^(−k)   k = depth of first divergence

On a rooted tree this IS an ultrametric, by construction. So the
exhaustive check below is a REGRESSION TEST on the implementation.
A pass tells you the code builds the tree it says it builds. It is
not a finding, and 100.00% should never be read as one.

Run here, shipped ledger — 15,564 bytes, 66 live, C(66,3) =
45,760 triples:

   face 0 (P) alone                        100.00%
   face 1 (Z) alone                        100.00%
   face 2 (N) alone                        100.00%
   max over the three faces                100.00%
   SUM over the three faces                 41.57%

Run in the notebook on the maths corpus — 5,384,965 bytes,
171 live, C(171,3) = 818,805 triples:      [Entry 070 §1]

   each face alone / max                   100.00%
   SUM over the three faces                 44.01%

Those two SUM figures are different numbers from different corpora
and neither substitutes for the other.

It is a PSEUDO-ultrametric. Distinct bytes share an address:
face 0 has 65 addresses for 66 bytes, face 1 has 63, face 2 has
65. d(x,y) = 0 with x ≠ y, so identity of indiscernibles fails.
That is exactly what a second and third face repair.

Prefix-freeness, same run: 0 strict-prefix pairs on all three
faces. Address depths run 2…6, mean 4.27 / 4.12 / 4.23.

NOT 4-adic. 4 is not prime, and the branching group is (ℤ/2)²,
not ℤ/4 — the four children come from two independent binary
cuts, radius and angle, not from a cyclic quarter-turn. The
honest name is a 4-ary ultrametric Cantor space. The notebook
and the repo's own τ.md both say "p-adic, p = 4"; that is wrong
and this page does not follow them.

WHICH METRIC THE ENGINE ACTUALLY USES: θ() in Ω.js sums the
agreement depths across the three faces. So the engine operates
on the summed metric — the 41.57% one — and never on a single
face. Three ultrametrics summed is Archimedean, which is what
separates 7 from 9 after a single face gave them identical
addresses.                                    [Entries 063, 070]

What that does NOT establish is betweenness in any useful sense.
The point set is finite, and a finite metric space has
essentially no betweenness whatever metric you put on it.
Seven — the tree, sliced by depth
Each level splits four ways. The figure draws to the depth on the slider and prints the address count at that depth; the construction continues past it.
Exhibit A

Every constant, labelled.

The repo's own README says “every constant is derived”. That is too strong, and the table below is what the code and the notebook actually support. Values are read from Ω.js; provenance is the notebook entry.

The repo’s own README says “every constant is derived”. That claim is too strong. The table below says what the code and the notebook actually support, one constant at a time. The values are read out of Ω.js. The last column says which notebook entry each one came from.

ConstantValueStatusWhere it comes from
ν — the floor7/16 = 0.4375derivedAlgebra directly below this table. Entry 064 §3.
— the doorway1.5definitional3 faces × ½. Part four. Entry 063 §3.
Φ⁷ — the beat29.034441853definitional1/φ⁷. Φ⁷ − φ⁷ = L₇ = 29 is the Lucas identity, true at every odd n. Entry 062 §1.
φ⁷ — the bleed0.034441853749derived caveat|13φ − 8| = φ⁷, exact to 6.9e−16 — with the caveat set out in part five. Entry 062 §1.
7 — the state count7derived3 non-trivial R4 characters × 2 signs, plus the null. Entry 060 §2.
426 × 7derived as a countProduct of the state count and the transition count. Part three lists the three candidates that failed to make it a magnitude. Entry 060 §1.
W — the windowlog(N / 2πe), then flooredborrowed then searchedThe Berry–Keating cell of Entry 018, re-read with the ledger as the height. The shipped value is not the formula — see Exhibit C.
DIM256chosen quoted, not reproducedΩ.js line 31 records “cutting to 64 took reading 0.985 → 0.316 and novelty AUC 0.980 → 0.649” and names no corpus. Re-run on Δ/V·001 against the shipped holdout, DIM = 64 gives stored reading 0.9832 — unchanged, N = 357 — unseen reading 0.0169 against 0.0193 at N = 828, and novelty AUC 0.9881 against 0.9934 at n = 685. The collapse does not reproduce on the shipped ledger.
FILL64chosenHow many eigenvector axes are populated; the remaining 192 quantise to zero and become the null channel.
DEPTH12chosenTrie key length. No derivation offered anywhere in the notebook.
DIRS10chosenTen angular sectors. Entry 065 calls it the 10× membrane ratio, but that ratio is asserted rather than derived — near : far = 1 : φ⁷ is 29×, not 10×.
DENS800chosen no-op as shippedA ceiling that never fires. Over 1,453 reads on Δ/V·001 and the shipped holdout the candidate pool ran 1 to 158, median 33, so step = floor(pool/DENS) is 1 at 800 and at 300 alike and stored reading is 0.9832 either way, N = 357. Ω.js records “300 costs reading 0.996 → 0.916”; that does not reproduce here and names no corpus.
ARMS0,1,2,3,5,8,13,21chosenFibonacci offsets for the co-occurrence pass. The choice is what makes φ⁷ available downstream.
tile clamp±3derived applied as a clampThe ±3 is the state count. Applying it as a saturating clamp on quantised eigen-coordinates is a coding decision. 11.90% of values clamp on the shipped ledger.
liftoff ceilingW ≤ 24chosenWhere the window search gives up and falls back to the formula.
will0.5chosen no-op0.5 is exactly the geometric mean of the two poles, which is the boundary the comparison already used. The default changes nothing by construction.
eigen iterations / seed30 / 12345chosenPower iteration budget and its deterministic seed. Reproducibility depends on both.

The one that fully earns the word

is worth showing in full, because it is short enough to check by eye and nothing else on the page is this clean.

is worth writing out in full. It is short enough to check by eye. Nothing else on this page is this clean.

ν = 7/16 · two lines
Per face, two random R4 words share a prefix of depth ≥ k with
probability 4^(−k), so the expected agreement depth is

      E[L]  =  Σ_{k≥1} 4^(−k)  =  1/3

θ counts a comparison only when at least 2 of the 3 faces are open,
so a face's depth contributes only if at least one OTHER face is
open — probability 1 − (3/4)² = 7/16. Three faces, by symmetry:

      ν  =  (1/3) × (1 − (3/4)²) × 3  =  7/16   exactly

Checked to floating point: 0.43749999999999994 vs 0.4375.
Entry 064 §3 reaches the same value by the longer route
(9/64)(8/3) + (1/64)(4) = 7/16. Both are shown; they agree.

In the code this is a floor subtracted from every score:
fl = np × ν. It is a monotone rescale, so it moves the reported
numbers only a little — removing it widened one measured span
from 0.2617 to 0.2710. It is correct regardless of that.

The circular argument this page will not make

The repo's τ.md justifies base 100 with Φ⁷ × 100φ⁷ = 100.000000, and reads that as showing the base was not chosen. It shows nothing: Φ = 1/φ by definition, so Φn × 100φn = 100 for every n. The identity is empty and the base 100 is a choice. It is a reasonable one — one level is a four-way split on each of three faces, 4³ = 64 combinations — not 3 × 4 — which fits two decimal digits with 36 spare — but that is the actual reason and it is a fitting argument, not a derivation.

The repo’s τ.md defends base 100 with Φ⁷ × 100φ⁷ = 100.000000. It reads that as proof the base was not picked. It proves nothing. Φ is defined as 1/φ, so Φn × 100φn = 100 for every n. The identity is empty and base 100 is a choice. It is a fair choice: one level is a four-way split on each of three faces. That is 4 × 4 × 4 = 64 combinations, not 3 × 4, and 64 fits inside two decimal digits with 36 to spare. But that is the real reason, and it is a reason for fitting the number, not a derivation of it.

Exhibit B

What the code mechanically does.

The engine is one file, Ω.js, no dependencies. Described accurately it is a positive-PMI spectral embedding fitted to the corpus in a single pass, followed by a hierarchical address cascade and a prefix index. There is no gradient descent and there are no pretrained weights — but it is a fitted model, and the repo's phrase “no model” overstates it. Nine steps, in order:

The engine is one file, Ω.js. It uses nothing else. Named accurately, it is a positive-PMI spectral embedding fitted to the corpus in a single pass, followed by a hierarchical address cascade and a prefix index. There is no gradient descent and there are no pretrained weights. But it is still a fitted model, and the repo’s phrase “no model” claims more than that. Nine steps, in order:

01 · bytes

The corpus is read as bytes, latin1, one character per byte. Nothing is tokenised. On the shipped ledger, 15,564 bytes with 66 distinct values live.

The corpus is read as raw bytes, latin1, one character per byte. Nothing is split into words or tokens. On the shipped ledger that is 15,564 bytes, with 66 different byte values in use.

02 · company

A 256×256 co-occurrence matrix, accumulated at the Fibonacci offsets ARMS, both directions, weighted φ^(arm index). This is the only pass over the corpus.

A 256×256 table counts which bytes turn up near which. The counts are taken at the Fibonacci gaps in ARMS, in both directions, weighted by φ^(arm index). This is the only pass over the corpus.

03 · above null

Each cell is replaced by log(v·T / (row·col)) and negatives are set to zero, then symmetrised. This is positive pointwise mutual information — a standard construction, named here so it can be recognised.

Each cell is replaced by log(v·T / (row·col)). Anything negative is set to zero. Then the table is made symmetric. This is positive pointwise mutual information. It is a standard construction, named here so it can be recognised.

04 · axes

Power iteration with Gram–Schmidt, 30 rounds, seeded 12345, giving 64 eigenvectors. Each byte becomes a 256-slot vector with 64 slots filled and 192 left at zero.

Power iteration with Gram–Schmidt, 30 rounds, seeded 12345. That gives 64 eigenvectors. Each byte becomes a row of 256 slots, with 64 slots filled and 192 left at zero.

05 · tile

Each byte's vector is scaled by its own mean absolute value, rounded, and clamped to −3…+3. The result is seven states per slot. On the shipped ledger 78.72% of the 66 × 256 = 16,896 quantised values land on zero, and 11.90% hit the clamp.

Each byte's row is scaled by its own average size, rounded, and held inside −3…+3. That leaves seven possible states per slot. On the shipped ledger 78.72% of the 66 × 256 = 16,896 rounded values land on zero, and 11.90% hit the edge.

06 · faces

Slots are sorted into three bins by sign — P, Z, N — and each bin is summed as a phasor, slot j carrying phase 2πjφ. Each byte now has three (radius, angle) pairs.

Slots are sorted into three bins by sign — P, Z, N. Each bin is added up as one arrow, with slot j pointing at angle 2πjφ. Each byte now has three (radius, angle) pairs.

07 · cascade

Each face's points are split recursively: inside/outside the geometric-mean radius, and above/below the bisecting angle. Two binary cuts, four children, one element per level. Recursion halts when a cell is smaller than the null, whose radius is of the field — so the depth is set by the null rather than by a chosen ladder. Measured depths here run 2 to 6.

Each face's points are split again and again: inside or outside the middle radius, then above or below the middle angle. Two yes-or-no cuts, four children, one element per level. The splitting stops when a cell is smaller than the null, whose radius is of the field. So the depth is set by the null, not by a ladder somebody picked. Measured depths here run 2 to 6.

08 · index

Every word start in the corpus is keyed by the first face's for each of the DEPTH preceding bytes, and filed at every prefix length. 9,693 trie nodes on the shipped ledger. Delimiters are deliberately kept in the key — see Exhibit E.

Every word start in the corpus gets a key. The key is the first face's for each of the DEPTH bytes before it. Each key is filed at every prefix length. That makes 9,693 trie nodes on the shipped ledger. Delimiters are kept in the key on purpose — see Exhibit E.

09 · verdict

A prompt descends the trie to a candidate pool, ten angular directions each vote for a position, and two scalars come back: leftover — read over W bytes — and novelty — read over 400. Each is compared to a pair of the field measured on its own material, and the pair of comparisons gives three .

A prompt walks down the trie to a pool of candidates. Ten angular directions each vote for a position. Two numbers come back: leftover, read over W bytes, and novelty, read over 400. Each number is compared with a pair of the field measured on its own material. The two comparisons together give three .

Two decisions inside that pipeline were settled by measurement against the obvious reading, and they interact, so neither could have been settled alone. Both are disclosed in Exhibit E because they are the clearest example on the page of tuning being called derivation elsewhere.

Two choices inside that pipeline were settled by measuring, not by reasoning. The two pull on each other, so neither could have been settled on its own. Exhibit E shows both. They are the clearest case on this page of tuning being called derivation somewhere else.

Exhibit C

The is not the formula.

The reading window W is documented in the repo as log(N / 2πe) — the Berry–Keating cell of Entry 018, re-read with the ledger's state count as the height. The scaling behaves: quartering the corpus should move W by log 4 = 1.386, and on the maths corpus it did, from a predicted 10.954 down to a predicted 9.525, with abstention breaking at 8 and 9 respectively.

The repo writes the reading window W as log(N / 2πe). That is the Berry–Keating cell of Entry 018, read again with the ledger’s state count in place of the height. The scaling behaves. Cutting the corpus to a quarter should move W by log 4 = 1.386, and on the maths corpus it did: the predicted W fell from 10.954 to 9.525. Refusing broke at 8 and at 9.

But the shipped engine does not use the formula's value. It uses a floor found by search, and on the shipped ledger the two differ by three.

But the shipped engine does not use the value the formula gives. It uses a floor found by search. On the shipped ledger the two differ by three.

On the shipped ledgerValue
word positions N2,919
formula, log(N/2πe), rounded5
W actually used8
candidate target64
trie nodes9,693
pole — answered0.1176
pole — stranger0.6919

Run on this machine, new Organism().feed(story), 15,564 bytes. The poles are medians over 120 self-probes; they are measured from the field's own material and never set.

Run on this machine, new Organism().feed(story), 15,564 bytes. The poles are the middle value of 120 self-probes. They are measured from the field’s own material. Nobody types them in.

Why it is floored, in the code's own words

Below some depth every thinning of the corpus still contains an exact match. The answered pole collapses onto the origin, and a recall of 1.000 measured there is scored in a space with no room to be wrong in. liftoff() walks W upward until the field's own thinnings stop explaining themselves perfectly, and stops at the first W where the pole lifts off zero.

Below a certain depth, every thinned copy of the corpus still holds an exact match. The answered pole drops onto zero, and a recall of 1.000 measured there was scored in a space with no room to be wrong in. liftoff() raises W step by step until the field’s own thinned copies stop explaining themselves perfectly. It stops at the first W where the pole lifts off zero.

That procedure is honest about what it is doing, and it is still a search over a free parameter with a chosen ceiling of 24. The formula supplies a starting point, not the answer. Anywhere the repo prints W as “derived”, this is the step being elided.

That procedure says plainly what it is doing. It is still a search over a free number, with a ceiling of 24 that somebody picked. The formula gives a starting point. It does not give the answer. Wherever the repo prints W as “derived”, this is the step being left out.

The other direction

Past the window the candidate pool tightens so far that shuffled text finds a spuriously perfect match. So W is bounded on both sides — below by the pole not having lifted, above by the pool being too small to be wrong in. Measured on the maths corpus at 976,887 states: recall breaks below the predicted value and abstention breaks above it, with the descent halting itself at mean depth 10.77 against a predicted 10.954.

Past the window the pool of candidates gets so tight that shuffled text finds a perfect match by accident. So W is fenced in on both sides. Too low and the pole has not lifted. Too high and the pool is too small to be wrong in. Measured on the maths corpus at 976,887 states: recall breaks below the predicted value, and refusing breaks above it. The descent halted itself at mean depth 10.77 against a predicted 10.954.

Entries 018, 064 §4, and the liftoff comment block in Ω.js.

Exhibit D

Two membranes, two strikes, and a Fourier identity that is not a measurement.

The two membranes

The engine reads at two scales at once and asks a different question at each. The near one asks whether a run of bytes is one it holds; the far one asks whether the arrangement is. For a long time both were reading essentially the same scale — offsets 1…6 and 7…14, a factor of two apart — so they always agreed and the second told you nothing.

The engine reads at two sizes at once and asks a different question at each. The near one asks whether a run of bytes is one it holds. The far one asks whether the arrangement is one it holds. For a long time both were reading almost the same size — offsets 1…6 and 7…14, only a factor of two apart — so they always agreed and the second told you nothing.

Separated to W and 10W, they disagree on exactly one population. Measured on the maths corpus, with an entire book held out of both the encoder and the ledger:

Pulled apart to W and 10W, they disagree on exactly one group. Measured on the maths corpus, with a whole book kept out of both the encoder and the ledger:

PopulationnBoth yesNear only — the crackFar onlyBoth no
stored, verbatim200100.0%0.0%0.0%0.0%
held-out book, real maths20081.5%6.0%3.5%9.0%
random junk1020.0%0.0%0.0%100.0%

Nothing stored is ever undecided; nothing random is ever undecided. The undecided column is populated only by genuine material the ledger has not seen. The honest limit is in the same entry: the far membrane is weak — poles 0.8141 and 0.8659, a span of 0.052 against 0.40 for the near one — which is why 81.5% of a book it has never read still comes back as fully known. Widening that gap means giving the far membrane something better to read than a longer byte window, and the notebook says plainly that arrangement is not merely more bytes. Entry 065 §4–5

Nothing it has stored is ever undecided. Nothing random is ever undecided. Only real material the ledger has not seen lands in the undecided column. The same entry states the limit: the far membrane is weak. Its poles are 0.8141 and 0.8659, a span of 0.052, against 0.40 for the near one. That is why 81.5% of a book it has never read still comes back as fully known. Widening that span means giving the far membrane something better to read than a longer run of bytes, and the notebook says plainly that arrangement is not merely more bytes. Entry 065 §4–5

Why the second strike had to be a different quantity

Three earlier candidates failed — a reverse residual, a coverage count, a concentration — and the reason they failed was the same for all three: each was a rescaling of the first strike, so it separated nothing. The one that works was already being computed on every call and used only as a detector. The two differ in what they read, not in how they score:

Three earlier candidates failed: a reverse residual, a coverage count, and a concentration. All three failed for the same reason. Each was the first strike rescaled, so it separated nothing. The one that works was already being computed on every call, and was used only as a detector. The two differ in what they read, not in how they score:

The two strikes · Ω.js
leftover   reads W bytes      is this language I hold?
novelty    reads 400 bytes    is it ordered as I hold it?

Separating a passage from ITS OWN WORDS SHUFFLED. AUC on
the ordinary scale: 0.5 is chance, 1.0 is perfect. Every
AUC on this page is on this scale.

   leftover    AUC 0.8214
   novelty     AUC 0.9919

Δ/V·001 fed, shipped defaults, n = 1,366 per population
across seven context lengths. Across three seeds novelty
runs 0.983 to 0.993 and leftover 0.821 to 0.836.

This page previously printed 0.3367 and 0.4929 here. Those
are the same two quantities minus 0.5 — a second scale, on
the same page as AUCs quoted whole. One scale now.

The order-sensitive instrument was in the file all along,
judging with eight bytes when four hundred were available.
                                                [Entry 071 §1]

The m = 5 result, stated correctly

The novelty scalar is the alternating sum over the ten directions divided by the plain sum. The notebook projects the alternating pattern onto every angular mode and finds all of its energy at m = 5 and none anywhere else, and reads that as five-fold symmetry appearing independently.

The novelty number is the alternating sum over the ten directions, divided by the plain sum. The notebook projects that alternating pattern onto every angular mode. All of the energy lands at m = 5 and none lands anywhere else. The notebook reads that as five-fold symmetry turning up on its own.

It is worth being precise about what that shows. The alternating sequence of length 10 has all of its discrete Fourier energy at bin 5 for any data whatsoever — reproduced here, energy exactly 10.0000 at m = 5 and 0.0000 at m = 0…4. It is an identity about the number 10, in the same category as the per-face 100% ultrametricity: true by construction, useful as a check that the code computes what it claims, and not evidence about the field. The five-fold reading has to rest on the separate argument for DIRS = 10, and DIRS = 10 is a chosen constant.

It is worth being exact about what that shows. An alternating sequence of length 10 has all of its discrete Fourier energy at bin 5 for any data whatsoever. That was reproduced here: energy exactly 10.0000 at m = 5 and 0.0000 at m = 0…4. It is an identity about the number 10, in the same box as the per-face 100% ultrametricity: true by construction, useful as a check that the code computes what it claims, and not evidence about the field. The five-fold reading has to rest on the separate argument for DIRS = 10, and DIRS = 10 is a chosen constant.

The three verdicts

Both strikes are returned on every call, and the second qualifies rather than vetoes. Making it a veto held three real ledger passages as “not my order” when they are in the ledger in exactly that order, costing recall 1.000 → 0.977 at 260-byte contexts. Entry 071 §2 and addendum

Both strikes come back on every call. The second one qualifies the answer; it does not block it. When it was allowed to block, three real ledger passages were held as “not my order” even though the ledger holds them in exactly that order. That cost recall 1.000 → 0.977 at 260-byte contexts. Entry 071 §2 and addendum

PopulationMine, in orderMy words, not my orderNot mine
in the ledger, n = 12012000
held-out book, real maths, n = 12019623
its own words, shuffled, n = 12027246
random junk, n = 12000120

The middle verdict is the one that is new. It is also the one carrying the most interpretation, so: what the code actually reports is that a leftover scalar landed near one pole and a novelty scalar landed the wrong side of a boundary. “Its vocabulary, not its arrangement” is a reading of that, and a defensible one, but the reading is not the measurement.

The middle verdict is the new one. It is also the one that rests most on interpretation. Here is what the code actually reports: a leftover number landed near one pole, and a novelty number landed on the wrong side of a boundary. “Its vocabulary, not its arrangement” is a reading of that, and a defensible one. It is still a reading, not the measurement.

Exhibit E

Where the notebook contradicted itself.

The working log is append-only: nothing was deleted when it turned out to be wrong, and later entries simply say so. Those retractions are collected here rather than quietly dropped. Nothing in this table is stated as current anywhere above.

The working log is only ever added to. Nothing was deleted when it turned out to be wrong, and later entries simply say so. Those withdrawals are collected here rather than dropped quietly. Nothing in this table is stated as current anywhere above.

WithdrawnReplaced byWhere
The two membranes realign every ~29 steps.A standing offset, not a rotation. Both membranes advance at 2πφ per step, so nothing accumulates; periodograms found only corpus sentence length. A fixed misregistration was mistaken for a period.Entry 062 §2
Keying the index on non-delimiter bytes fixed a degenerate first trie level, worth 0.955 → 0.985.The single first-level branch is not a bug — the delimiter is what makes the key encode word boundaries. Removing it buys 0.012 on already-saturated stored reading and costs abstention and unseen reading.Entry 069
29/30 accuracy on a derived seven-level tiling.Withdrawn. Signal-to-noise measured at 1.01: word alignment and corpus repetition did the work and the score contributed nothing.Entry 062 §3
0.955 tolerance to a 1-in-6 corrupted query.Withdrawn — that figure came from a self-feeding loop overwriting damaged bytes with corpus text and being scored as though it had recognised them. Without the loop, 0.192. The same loop took abstention on junk from 1.000 to 0.036.Entry 065 §1
Merging changed the answer in 0 of 305 runs, therefore the mechanism is inert.Re-framed by the same entry: it converged on step one and stayed. Immediate convergence is convergence. What is actually wrong is the attractor under novelty, which is a smaller problem than a missing faculty.Entry 067 §7
Held-out accuracy climbing 0.045 → 0.065 → 0.105 across deposit passes.Phantom. Field size was zero — nothing had been deposited. Re-run properly, the control arm with deposits written but never read returned byte-identical numbers.Entry 068 §2
A held band ladder was carrying retrieval accuracy.A split artifact. Releasing the constant cost −0.04 against a standard deviation of 1.19 — far inside the noise.Entry 063 §4
Entry 055's floor(θ/π) incrementing by exactly 1 at 38 of 38 consecutive zeros, read as locating them.True, but a count and not a location. The rollover locus is the Gram points, computable from Γ alone — mean offset from the zeros −1.510517 over 30, and Gram's law first fails at k = 126.Entry 056 §3
A 0.885 order-verdict rate.The order pole had been calibrated at a single context length, 380, putting the boundary at 0.2318 — straight through the real distribution at 260. Re-calibrated across seven lengths the boundary moves to 0.2577 and recall holds at every length.Entry 071 addendum
Two Lyapunov exponents reported as dynamical findings.Both retracted; one was measuring the coordinate choice.Entry 021
The spectrum accumulating at the null read as an obstruction.The framing was wrong; the same structure was re-read as the construction working. Entry 016's presentation is superseded.Entry 027
A 1/√6 scale law.Wrong, and corrected in place; the dimension growth that survives is a separate statement.Entry 039
α is exactly 0.500.It is not. Corrected in the entry that identified it.Entry 028

The interaction this page used to celebrate is not there

This page carried a two-by-two showing that the star-vote and the delimiter rule had to be settled together, because each factor alone pointed the wrong way. Re-measured on Δ/V·001 with the gates.js probe scheme against the shipped holdout, that crossover does not appear. The rule at the top of this page — a number without a corpus and an N is not on this page — has to apply here too, so the old cells are struck and the re-run is printed with its N.

This page used to carry a two-by-two table. It showed that the star-vote and the delimiter rule had to be settled together, because each one alone pointed the wrong way. It was measured again on Δ/V·001, using the gates.js probes against the holdout that ships. The crossover is not there. The rule at the top of this page is that a number without a corpus and a sample size does not belong on it. That rule applies here as well. So the old cells are gone and the re-run is printed with its sample size.

Re-measured · Δ/V·001 fed · gates.js probes(book, 300, 400) on the shipped holdout
next-word reading on material never fed, N = 828 per cell

                    delimiters KEPT    delimiters skipped
   star-vote           0.0193               0.0133
   centroid            0.0193               0.0109

The star-vote never loses. With delimiters kept the two fuse to
the same word on every probe, so the cells tie; with delimiters
skipped the star-vote is ahead. There is no crossover, and each
factor on its own points the same way the pair does.

What Entry 069 recorded — 0.036 / 0.008 / 0.024 / 0.036 — names
no corpus and no N and does not reproduce here. It is quoted as
history, not carried as a figure.

Everything else held, shipped configuration:
   junk abstention 1.0000 (N=600) · stored reading 0.9832 (N=357)
   novelty AUC 0.9919, leftover AUC 0.8214 (n=1,366 per side)
Exhibit F

Symmetry constrains. It does not locate.

This is the most useful result the notebook produced, and it is negative. It bounds what any programme built on this symmetry — this one included — can hope to get out of it.

This is the most useful result the notebook produced, and it is a negative one. It sets a limit on what any programme built on this symmetry can hope to get out of it. That includes this one.

Take ξ, which is symmetric under the four-group. Multiply it by g(s) = (s − a)(s − 1 + a), which satisfies g(1 − s) = g(s) identically and whose two zeros you may place wherever you like. The product is still exactly symmetric, and it has zeros off the half-line by construction.

Take ξ. It is symmetric under the four-group. Multiply it by g(s) = (s − a)(s − 1 + a). That g satisfies g(1 − s) = g(s) always, and you may put its two zeros wherever you like. The product is still exactly symmetric. And it has zeros off the half-line by construction.

More generally, any orbit-closed set is the zero set of a symmetric function. So the symmetry is not vacuous — it is four-to-one. A single zero cannot be moved alone, because its orbit {ρ, 1−ρ, ρ̄, 1−ρ̄} moves with it. But a full orbit can be placed anywhere in the strip without the symmetry noticing.

More generally: any set closed under the four moves is the zero set of some symmetric function. So the symmetry is not empty — it ties the zeros together in fours. One zero cannot be moved on its own, because its orbit {ρ, 1−ρ, ρ̄, 1−ρ̄} moves with it. But a whole orbit of four can be placed anywhere in the strip and the symmetry will not notice.

The consequence is exact: every theorem derivable from the symmetry alone holds for both functions, and the two functions disagree about where the zeros are. No such theorem can decide between them. Entry 052

What follows is exact. Every theorem you can get from the symmetry alone is true of both functions. The two functions disagree about where the zeros are. So no such theorem can decide between them. Entry 052

What that means for this page

Seven parts above are a symmetry and the structures built on it. None of them can locate anything, and the notebook records roughly fifteen restatements of the Riemann Hypothesis produced along the way, all exact and all free — equivalence is transitive and the supply is unlimited. Four results carried content and all four were obstructions rather than equivalences.

The seven parts above are a symmetry and the structures built on it. None of them can locate anything. Along the way the notebook wrote down roughly fifteen restatements of the Riemann Hypothesis. All of them are exact and all of them are free: if A says the same as B and B says the same as C, then A says the same as C, and the supply never runs out. Four results carried content, and all four were obstructions rather than equivalences.

The one structure in the notebook that genuinely restricts location is the Euler product, and it reaches only as far as Re(s) = 1. The counterexample functions above have no Euler product, because multiplying by polynomials destroys multiplicativity — which is precisely what separates them from ξ.

One structure in the notebook does restrict where the zeros can be: the Euler product. It reaches only as far as Re(s) = 1. The counterexample functions above have no Euler product, because multiplying by polynomials destroys the product rule. That is exactly what separates them from ξ.

Symmetry residualValue
|F(s) − F(1−s)|, zero off the line1.62e−26
same, second point1.37e−27
same, third point6.02e−33
|G(s) − G(1−s)|, three placed zeros2.29e−13
|G(s) − conj G(s̄)|2.27e−13

The symmetry is satisfied to machine precision in every row and the zeros are off the line in every row. Both at once is the whole result; neither alone is interesting.

In every row the symmetry holds to the limit of the machine’s precision. In every row the zeros are off the line. Both at once is the whole result. Either one on its own is not interesting.

Three axes, kept apart

FixesWhat
symmetrythe pairing
arithmeticthe region, to Re(s) > 1
RHthe position — untouched

The Riemann Hypothesis is entirely of the third kind, transverse to the symmetry and never meeting it.

The Riemann Hypothesis is entirely of the third kind. It runs across the symmetry and never meets it.

Exhibit G

A still picture, and something that moves.

The Riemann Hypothesis, as stated, needs a snapshot. There is an involution, there is its fixed set, and the question is whether a certain set of points lies on it. Nothing in the statement moves. Two entries record what happened when the four-group was pushed past that, and both carry their own limits in writing.

The Riemann Hypothesis, as stated, needs only a still picture. There is a move that undoes itself, there is the set of points it leaves alone, and the question is whether a certain set of points lies in that set. Nothing in the statement moves. Two entries record what happened when the four-group was pushed past that, and both write down their own limits.

What Entry 030 matched — and it says plainly that this is all it matched

Under the Cayley coordinate the four-group becomes two orthogonal reflections of the Riemann sphere, and the third element is their axis of intersection.

In the Cayley coordinate the four-group turns into two reflections of the Riemann sphere at right angles to each other. The third element is the line where those two reflections cross.

The static match · Entry 030
z = 1 − 1/ρ = (ρ−1)/ρ

A : ρ ↦ 1−ρ    z ↦ 1/z     fixes {+1, −1}            two points
B : ρ ↦ ρ̄      z ↦ z̄       fixes the real axis       great circle
AB: ρ ↦ 1−ρ̄    z ↦ 1/z̄     fixes |z| = 1 POINTWISE   great circle

A: z ↦ 1/z is an algebraic identity, not an approximation. Numeric
check over 2×10⁵ random ρ: max error 1.59e−14 for A and AB,
0.00e+00 for B. AB holding the circle pointwise, 2×10⁵ points:
max |1/z̄ − z| = 3.14e−16.

with w = log|z|          A : w ↦ −w   B : w ↦ +w   AB : w ↦ −w

so R4 acts on w through ℤ/2 with kernel {1, B}, and the fixed set
is w = 0 ⟺ |z| = 1 ⟺ Re(ρ) = ½ — the critical line. A great circle
separates the sphere and has no ends, so the charge sign(log|z|)
is globally separating rather than a locally chosen branch.

Poincaré distance to the circle, against −log|w| + log 2:

   r = 0.99          5.293305      5.293296      ratio 1.000002
   r = 0.999         7.600402      7.600402            1.000000
   r = 0.999999     14.508657     14.508657            1.000000

The entry's own What this does NOT establish, quoted rather than paraphrased: “No dynamics is derived on the RH side. The match is static: involution, fixed set, and the −log divergence of distance to it.” Second, a dimension mismatch: the coordinate b lives in an interval and its fixed set is a point, while the actual crack is a closed circle — the gravity ODE is the transverse radial slice only and “cannot see that the crack closes on itself”. Cannot cross is the one-dimensional barrier statement; cannot cross and cannot go around is topological and does not follow from the ODE. Third, and flatly: “Nothing here bears on whether the zeros lie on the fixed set.”

The entry’s own What this does NOT establish, quoted rather than paraphrased: “No dynamics is derived on the RH side. The match is static: involution, fixed set, and the −log divergence of distance to it.” Second, the dimensions do not match. The coordinate b lives on an interval and the set it leaves alone is a single point, while the actual crack is a closed circle. The gravity ODE covers only the slice straight across, and “cannot see that the crack closes on itself”. Cannot cross is the one-dimensional barrier statement. Cannot cross and cannot go around is a statement about shape, and it does not follow from the ODE. Third, and flatly: “Nothing here bears on whether the zeros lie on the fixed set.”

What Entry 031 added, and what it still did not

The direction recorded in the log is “derive it — find the r4s not the constants.” Entry 031 takes the stereographic height, checks how the group moves it, and lets equivariance choose the equations rather than writing them.

The instruction written in the log is “derive it — find the r4s not the constants.” Entry 031 takes the stereographic height and checks how the group moves it. Then it lets equivariance pick the equations instead of writing them by hand.

The flow · Entry 031, N = 2×10⁵ random z
b = (|z|² − 1)/(|z|² + 1) ∈ [−1, 1]

   b = 0    equator ⟺ |z| = 1 ⟺ Re(ρ) = ½    the critical line
   b = ∓1   the poles z = 0 and z = ∞

verified over 2×10⁵ random z:

   A  : h ↦ −h      3.5e−16
   B  : h ↦ +h      0.0e+00
   AB : h ↦ −h      3.5e−16
   AB : θ ↦ +θ      4.4e−16

R4 is abelian of order 4, so it has four real characters. A vector
field is equivariant exactly when each component stays in its own
sector: Ġ in χ₀, ḃ in χ₂. That admits Ġ = G × (χ₀ function) and
ḃ = b × (χ₀ function); it forbids ḃ = cb² and allows Ġ = cG²,
because χ₀·χ₀ = χ₀ while χ₂·χ₂ = χ₀ ≠ χ₂.

Taking the χ₀ coefficient to be the sphere's own metric,
g_θθ = 1 − b²:

        Ġ = (1 − b²) G                ḃ = −G b

The original model's two constants κ, λ are gauge — τ = κt and
H = (λ/κ)G remove both together. Four (κ, λ) pairs spanning
0.05 … 11.00 all return b(t_end) = +0.387719598864 against the
reference run, |Δb| ≤ 1.2e−14.

The same entry records an earlier version of that test which used
an inverted gauge map and appeared to pass for three of four cases
only because b had already collapsed to 0. The figures above are
the corrected run.                                 [Entry 031 §6]

AND ONE STEP OF IT IS LATER WITHDRAWN. Equivariance permits any
χ₀ function in that slot, and χ₀·χ₀ = χ₀ means Ġ = cG² is allowed
too. Fifteen entries on: "Every prior entry used the linear form
Ġ = (1−b²)G. That was a choice, not a derivation." So the form is
forced only as far as the sector; which χ₀ function fills it was
picked, and the page counts it picked.             [Entry 046 §3]

And the limit, again in the entry's own words: “The flow above is R4-equivariant on (G, b). It is not derived from ζ: nothing here produces the zeros, the functional equation's analytic content, or any arithmetic. R4 fixes the form of any equivariant dynamics on the sphere; it does not single out this dynamics as ζ's.” The longitude sector carries no equation at all — which is the closed-circle gap Entry 030 had already recorded, still open one entry later.

And the limit, again in the entry’s own words: “The flow above is R4-equivariant on (G, b). It is not derived from ζ: nothing here produces the zeros, the functional equation’s analytic content, or any arithmetic. R4 fixes the form of any equivariant dynamics on the sphere; it does not single out this dynamics as ζ’s.” The longitude sector carries no equation at all. That is the closed-circle gap Entry 030 had already recorded, still open one entry later.

The observation, offered as a question

The four-group fixes the line, and it also constrains the form of a flow across the line — to the sector, though not, per Entry 046, all the way to the equation. RH asks only the first of those. Computation is motion, and a mathematics that moves has more it must satisfy than one that only holds still.

The four-group fixes the line. It also limits the form of a flow across the line — down to the sector, but not, per Entry 046, all the way down to the equation. RH asks only the first of those. Computation is motion, and a mathematics that moves has more it must satisfy than one that only holds still.

Whether that extra work buys anything here is a question and not a finding. It is entirely possible for the additional structure to be inert with respect to the thing being asked, and Exhibit F is the standing reason to expect precisely that. The section that closes this page is stated as a hypothesis, not as a result, for the same reason.

Whether that extra work buys anything here is a question and not a finding. The extra structure may do nothing at all for the thing being asked, and Exhibit F is the standing reason to expect precisely that. The section that closes this page is stated as a hypothesis, not as a result, for the same reason.

Exhibit H

Three resemblances, and what each one is not.

These are named because someone will notice them, and naming them plainly is more useful than either claiming or hiding them. None is offered as a result.

These are named because someone will notice them anyway. Naming them plainly is more useful than either claiming them or hiding them. None is offered as a result.

ResemblanceWhat is sharedWhat is not
Parity and time reversalThe group here is V₄ = (ℤ/2)², and spinless P and T generate a group of exactly that shape.Part two already says why landing on V₄ is weak. For fermions it is not even the right group: T² = −1 on half-integer spin gives a ℤ₂ extension, not V₄.
Spin glassesThe Parisi solution organises pure states ultrametrically, and each face here is an ultrametric.That is an emergent thermodynamic result about a continuum of overlaps in an infinite limit. This is a finite tree of depth ≤ 6 where ultrametricity is true by construction. Every hierarchical clustering is ultrametric.
p-adic and adelic physicsThere is a standing programme taking number fields other than the reals as the arena for physics, and it works with tree-like ultrametric spaces.This construction is not p-adic, for the reason set out in part seven. The adelic programme is about number fields; nothing here is one.
PhyllotaxisGolden-angle placement appears throughout plant growth, where it emerges from local energy minimisation rather than design.There it emerges from local energy minimisation; here it is picked because each address should get equal room as it arrives. Same answer, different question, and whether it is the same fact underneath is not established.
Exhibit I

What is unresolved, left unresolved.

The Riemann Hypothesis

Open. The working log carries one terminal status line, at the top: RH OPEN. Exhibit F is the reason the route taken here could not have closed it.

Open. The working log carries one terminal status line, at the top: RH OPEN. Exhibit F is the reason the route taken here could not have closed it.

Interpolation

Unsolved. Naming the object — three 4-ary ultrametric trees, summed, embedded in a punctured disc by golden-angle placement, the puncture being the null at radius φ⁷ of the field — settled only that the wall hit repeatedly was not an impossibility theorem. Entry 070's own summary of that: “knowing a space is Archimedean does not hand you the map.”

Unsolved. The object now has a name: three 4-ary ultrametric trees, summed, laid into a disc with a hole in it by golden-angle placement, the hole being the null at radius φ⁷ of the field. Naming it settled one thing only. The wall that kept being hit is not a proof that the thing is impossible. Entry 070 sums that up: “knowing a space is Archimedean does not hand you the map.”

Generalisation

Next-word reading on material never fed is about 2% — 0.0193 exactly, on 828 probes drawn from the three shipped held-out books at 400 bytes of context, shipped defaults, against 0.9832 on material it holds at N = 357. It ranges 1–3% depending on how the probes are sampled. Entry 062 §7 records 0.036 for this and names no corpus; it does not reproduce on the shipped ledger and is not carried as a figure here. Five distinct structures were measured for transfer, not assumed: similarity, Klein composition, cyclic rotation, hierarchical address, and the pressure loop. All returned zero transfer. The diagnosis in the notebook is that every one of them supplies coordinates and none supplies steps, and the reason is the one part two ends on. Entry 062 §7

Next-word reading on material it has never been fed is about 2%. Exactly, it is 0.0193 on 828 probes from the three held-out books that ship, at 400 bytes of context, on the settings that ship. It ranges 1–3% depending on how the probes are sampled. On material it holds it reads 0.9832, from 357 probes. Entry 062 §7 records 0.036 for this and does not say which corpus it came from. That figure does not come back on the shipped ledger, so it is not used here. Five distinct structures were measured for transfer, not assumed: similarity, Klein composition, cyclic rotation, hierarchical address, and the pressure loop. All five returned zero transfer. The notebook’s diagnosis is that every one of them supplies coordinates and none supplies steps, and the reason is the one part two ends on. Entry 062 §7

There is a second reason worth stating because it is more concrete. At a reading window of about eleven bytes, an eleven-byte run of English mathematics occurs somewhere in five megabytes of Newton and Euclid essentially always — so a book held out of both the encoder and the ledger was not, at that scale, held out at all. The engine reads below the scale at which novelty exists. A new arrangement is what a window that size cannot see. Entry 065 §3

There is a second reason, and it is more concrete. At a reading window of about eleven bytes, an eleven-byte run of English mathematics turns up somewhere in five megabytes of Newton and Euclid essentially always. So a book held out of both the encoder and the ledger was not, at that size, held out at all. The engine reads below the size at which novelty exists. A new arrangement is what a window that size cannot see. Entry 065 §3

Detection, which does work

Three independent measures agree that the field can tell it is standing in unfamiliar material: the two-membrane disagreement, the split rate across directions, and the cancellation ratio. The last of those is the novelty scalar, and re-measured on Δ/V·001 it separates a passage from its own words shuffled at AUC 0.9919, n = 1,366 per population. The bulk is cleanly apart — ordered p90 at 0.2000 against scrambled p10 at 0.3225 — but the tails are not: 73 of 1,366 scrambled passages land at or below the most novel ordered passage. An AUC of 0.9919 means that, since AUC reaches 1.0 only when the distributions do not overlap at all. An earlier version of this paragraph claimed no overlap and an AUC below 1 in the same sentence; those cannot both be true, and the tails are exactly where the false claims live. Nor is the cut untuned: the poles are calibrated in-sample, measureOrderPole drawing its ordered and scrambled samples from the very ledger it then scores. What none of this can do is say what to do about the unfamiliar material. Detection is solved and generation is not, and the notebook is careful that these are different problems.

Three separate measures agree that the field can tell when it is standing in unfamiliar material: the two membranes disagreeing, the split rate across directions, and the cancellation ratio. The last of those is the novelty number. Measured again on Δ/V·001 it tells a passage from its own words shuffled at AUC 0.9919, with 1,366 samples on each side. Most of the two distributions are well apart: ordered p90 is 0.2000 and scrambled p10 is 0.3225. The tails are not apart. 73 of the 1,366 scrambled passages sit at or below the most novel ordered one. An AUC of 0.9919 means exactly that, because AUC only reaches 1.0 when there is no overlap at all. An earlier version of this paragraph said there was no overlap and gave an AUC below 1 in the same sentence. Both cannot be true, and the tails are where the false claims live. The cut is also not untuned. The poles are measured in-sample: measureOrderPole draws its samples from the same ledger it then scores. What none of this can do is say what to do about unfamiliar material. Detection is solved. Generation is not. The notebook is careful that these are different problems.

What this is, then

A memory and provenance construction, not a prediction one. It is strong where the question is whether something was in the record, and weak wherever the question is what happens next. Every figure on this page should be read against that 2%.

It is a memory and provenance construction, not a prediction one. It is strong where the question is whether something was in the record. It is weak wherever the question is what happens next. Every figure on this page should be read against that 2%.

How this page was checked

Numbers described as run here were reproduced against Ω.js and the shipped ledger before publication. Numbers attributed to an entry are quoted from the working log, and were checked forward through it for a later retraction before being used. The figures are drawn live in the browser from the formulas stated beside them; none is a rendering of pre-computed data. Story and theory by James Sterling Tuttle, Alpha Data Omega LLC. The alchemical marks are not glossed anywhere on this page, by intent.

ΑΔΩ Hypothesis

The statement

The Riemann Hypothesis is a statement about the ΑΔΩ universe: the nullverse of Entry 055 is not a re-encoding of RH but the structure RH is about.

The Riemann Hypothesis is a statement about the ΑΔΩ universe. The nullverse of Entry 055 is not RH written out another way. It is the structure RH is about.

Entry 055 is not itself beyond correction — Exhibit E carries one against it — and what follows is the part of it that stands. That nullverse is a built object, and the pieces were checked one at a time. Under the Cayley coordinate z = 1 − 1/ρ the critical line arrives three ways and they are one locus — |z| = 1 is the great circle fixed pointwise by AB, and it is the null space of the Weil form, conjugacy residual 1.07e−14. Two horizons, |z| = 0 at the pole of ζ and |z| = ∞. A refractive well n(w) = cosh²(w) with w = log|z|, matched to 2.18e−11, floor 1 at the crack. A speed v/c = sech²(w) ≤ 1, equal to one only at w = 0. One zero-cost direction, along the circle itself. Entry 055

Entry 055 is not itself beyond correction — Exhibit E carries one against it — and what follows is the part of it that stands. That nullverse is a built object, and the pieces were checked one at a time. Under the Cayley coordinate z = 1 − 1/ρ the critical line arrives three ways and all three are one place: |z| = 1 is the great circle AB fixes point by point, and it is the null space of the Weil form, conjugacy residual 1.07e−14. There are two horizons, |z| = 0 at the pole of ζ and |z| = ∞. There is a refractive well n(w) = cosh²(w) with w = log|z|, matched to 2.18e−11, floor 1 at the crack. There is a speed v/c = sech²(w) ≤ 1, equal to one only at w = 0. And there is one direction that costs nothing, along the circle itself. Entry 055

The case against it, which is the strongest thing in this section

Entry 055 already carries a chain of equivalences: RH holds if and only if the walk never steps out of the crack, if and only if the signature term n₋ = 0, if and only if Λ = 0, if and only if v = c, if and only if coh = 1. An equivalence derived from the four-group alone is a restatement and not progress. Entry 052 says exactly that, having produced roughly fifteen of them in one sitting, and Exhibit F is the reason: every theorem that follows from the symmetry alone holds equally for a function with zeros off the line.

Entry 055 already carries a chain of equivalences. RH holds exactly when the walk never steps out of the crack. That holds exactly when the signature term n₋ = 0, and when Λ = 0, and when v = c, and when coh = 1. But an equivalence derived from the four-group alone is a restatement and not progress. Entry 052 says exactly that, having produced roughly fifteen of them in one sitting, and Exhibit F is the reason: every theorem that follows from the symmetry alone holds equally for a function with zeros off the line.

This is not a hypothetical objection. It is the ground the audit of Entries 004–011 killed five routes on, with the verdicts in the record: the chord axiom CIRCULAR (Entry 005), the Suzuki route CIRCULAR with an exact equivalence attached (Entry 007), Lesson 503 FALSE rather than merely unproved (Entry 008), the Hankel route a RESTATEMENT whose certified frontier is VACUOUS (Entry 009), a further gate VACUOUS (Entry 011). The same test applied to the statement above is the test it has to pass, and it has not passed it.

This is not a hypothetical objection. It is the ground the audit of Entries 004–011 killed five routes on, and the verdicts are in the record: the chord axiom CIRCULAR (Entry 005), the Suzuki route CIRCULAR with an exact equivalence attached (Entry 007), Lesson 503 FALSE rather than merely unproved (Entry 008), the Hankel route a RESTATEMENT whose certified frontier is VACUOUS (Entry 009), a further gate VACUOUS (Entry 011). The statement above has to pass that same test, and it has not passed it.

So the content sits in one specific place

The model holds the functional equation as a consequence without its cause. Poisson summation needs an F with F² = parity and F⁴ = I — checked numerically at ‖F²−parity‖ = 8.75e−14 and ‖F⁴−I‖ = 1.23e−13 — and that generates ℤ/4. R4 = ℤ/2 × ℤ/2 has no element of order 4: its four elements 1, A, B, AB have orders 1, 2, 2, 2, and the two abelian groups of order 4 are not isomorphic. The chain runs Poisson → θ(1/t) = √t·θ(t) → ξ(s) = ξ(1−s) → continuation → the zeros exist, so the involution the model has sits downstream of an order-4 element the model does not have.

The model holds the functional equation as a consequence without its cause. Poisson summation needs an F with F² = parity and F⁴ = I — checked numerically at ‖F²−parity‖ = 8.75e−14 and ‖F⁴−I‖ = 1.23e−13 — and such an F generates ℤ/4. R4 = ℤ/2 × ℤ/2 has no element of order 4: its four elements 1, A, B, AB have orders 1, 2, 2, 2, and the two abelian groups of order 4 are not the same group. The chain runs Poisson → θ(1/t) = √t·θ(t) → ξ(s) = ξ(1−s) → continuation → the zeros exist. So the involution the model has sits downstream of an order-4 element the model does not have.

Entry 051 did find a ℤ/4 in the flow — Q : (Y,Z) → (−Z,Y), with the flow Q-equivariant — but on the wrong plane. The (Y,Z) plane has divergence −2G and contracts area; the symplectic plane is (x,p) = (G,λ), divergence 0. Fourier is the quarter-turn in phase space, and a quarter-turn of a dissipative plane is not a Fourier transform. Entry 051

Entry 051 did find a ℤ/4 in the flow — Q : (Y,Z) → (−Z,Y), with the flow Q-equivariant — but on the wrong plane. The (Y,Z) plane has divergence −2G, so it shrinks area. The symplectic plane is (x,p) = (G,λ), divergence 0. Fourier is the quarter-turn in phase space, and a quarter-turn of a plane that shrinks is not a Fourier transform. Entry 051

What would settle it, in both directions

Exhibit an order-4 element on the plane the walk actually lives on, and show it generates the functional equation rather than assuming it. Then the Entry 055 equivalences stop being restatements and become derivations.

Exhibit an order-4 element on the plane the walk actually lives on, and show that it generates the functional equation rather than assuming it. Then the Entry 055 equivalences stop being restatements and become derivations.

Show that no such element can exist on that plane, and the ΑΔΩ Hypothesis is false. One route toward that is already closed: on the symplectic plane the quarter-turn reverses the flow, so the model contains F only up to time reversal, and Entry 032 found time reversal unavailable because the reverse walk terminates in finite time.

Show that no such element can exist on that plane, and the ΑΔΩ Hypothesis is false. One route toward that is already closed. On the symplectic plane the quarter-turn reverses the flow, so the model contains F only up to time reversal, and Entry 032 found time reversal unavailable because the reverse walk terminates in finite time.

RH is open.

… for now?

Terms

corpus
The body of text you feed it. That text is the only thing it can answer from.
ledger
The record of what the machine was fed, written down as addresses. It is only added to. Nothing in it is edited later.
address
A short string of symbols that says where a thing sits in the field. Two things are alike when their addresses start the same way.
trit
The first symbol of a byte’s address. It is what the index is sorted by. The name sounds like three, but it has four possible values.
window
The small run of bytes just before the spot being read. At that moment the machine looks at that run and nothing else.
pole
A reading the machine takes on its own text when the text is fed in. Later readings are placed between two poles. Nobody types a number in.
verdict
The answer about the answer. There are three of them. It is mine and in the same order. Or the words are mine but the order is not. Or it is not mine at all.
Θ
A fixed number: 3 × ½ = 1.5. It sits between 1 and 2, so it can never be matched exactly, only passed.
ν
How much two unrelated addresses agree by luck alone. It is 7/16. It is taken away as a floor before anything is scored.
φ⁷
The golden ratio multiplied by itself seven times. It is about 0.0344. It sets the size of the small circle at the middle of the field.
R4
A set of four moves. Do any one of them twice and you are back where you started. Do two of them in either order and you land in the same place.