13 November 2026 · working note
Further bridges
A local note connecting the marked plane, the rational floor coefficient, integer bases, and one binary64 pattern. It is not a source paper, not a Zenodo deposit, and not a tenth registered work.
The network interval is the interval already stated on the 27 October parameter page:
The twelve-neighbor map is the 10 November bridge. The 360-bit residue witness is the witness note. This page does not replace those records. The source text is Further_Bridges.md.
Opening and base
One arcsecond is of a full turn, and . A reduced rational has a finite base- expansion if and only if every prime factor of its denominator divides . So has a finite base- expansion if and only if divides . Writing the same fraction with an integer numerator and denominator does not depend on the base.
The selected ratio does not use the opening. Changing the opening, while keeping the readouts and , changes the chord and does not change . The construction on this site keeps .
Digits that preserve the network cube
Let and , with and . The 27 October page states that agrees with the reference coefficient on all of exactly on that interval. This note’s checker certifies the two Farey neighbors
the determinant identity , and . Those integer checks passed. The written argument that no allowed threshold lies strictly between them was not reviewed here as a proof.
Ten decimal places are outside the interval. Eleven are inside. On the reachable sum , the ten-place coefficient returns 8478 and the reference coefficient returns 8479. The Node scan below found no other mismatch among the 819,175 positive coordinate sums, and no mismatch for the eleven-place coefficient.
For base , the first truncation length that puts inside the same interval is below. The numerators are the common value of the checker’s rational bounds on . They are not a separate high-precision evaluation.
| Base | Digits | Numerator |
|---|---|---|
| 2 | 35 | 11680585201 |
| 3 | 22 | 10667984038 |
| 8 | 12 | 23361170403 |
| 10 | 11 | 33994977134 |
| 16 | 9 | 23361170403 |
| 60 | 6 | 15860696531 |
Two truncations can give the same next state and different remainders. A record still has to carry, or share, its coefficient and denominator.
Constant signal
The stated row sum gives . For a constant signal ,
For , the scalar step is the floor-kernel pair , . Every coordinate of the next state is then 135. With denominator , the constant remainder is . The checker verified those three integers. It did not multiply the 120-by-120 matrix.
Modulo eight
The witness page states for nonzero . This archive did not recheck that bound. The lower endpoint of the network interval is greater than , which is the comparison used to carry the same floor separation from to every coefficient in the interval. The constant state has residue 7 in every coordinate, so the packed 45-byte witness is ff repeated and the next state is . Efficient decoding remains the open question on the witness page.
One binary64 pattern
The correctly rounded IEEE 754 binary64 value of the rational is the word 3fd5c1bcaf8d580e. That word is not equal to . Its exact value is . Treating the word as an unsigned integer and solving returns
and . The product has bit length 111 in this example. A 49-bit factor times a 64-bit word can need 113 bits, so a 64-bit multiply is not enough. This check used Python integers. It recovers the encoding, not the exact rational, and it is not the 15-bit graph theorem.
What was run here
python3 verify_further_bridges.py on Python 3.10.21 exited 0. The stdout is 257 bytes, SHA-256 b27f6ccff0a4d1b4db77229adcb9bd05cb41c9216bf2e74fe60625ce960117c6. The source note records Python 3.12.14 for its own PASS. That interpreter was not used here. python3 -O prints the same bytes because it removes the asserts. It is not a second check.
node scan_base_digits.mjs on Node v22.23.2 scanned all 819,175 positive coordinate sums. Eleven places matched the reference floor everywhere. Ten places differed in one coordinate, . The stdout is 168 bytes, SHA-256 7dbedfd35c771a4335f1ebbb66cef4090eeb59eaa273fee3805a79bc5fdfc860. This script was written for that scan. It is not a file from the source note.
The note also names an earlier Python, Node, and Java agreement on 32,768 scalar records, with SHA-256 5b2d8d01a0c15dbb37782d1f46508068592ee60f5e2d0bdce84c59e0a1e98e6b. That corpus was not rerun here. Lean was not run. Frozen SRSD is the external arithmetic instrument named by the note. This page does not audit it.
Not claimed
- That this note is a new proof of the 27 October interval.
- Lean verification, peer review, or independent reproduction.
- A new lattice bound, a faster decoder, or a change to the 306-bit and 360-bit records.
- That a binary64 word equals the exact rational .
- A tenth Zenodo deposit.
| File | Bytes | SHA-256 |
|---|---|---|
| source note | 13433 | 93391f424ab219fdf8e74e4e4278d5a2cb5af9b3c34f8da5bd91cff0198c85c2 |
| Python checker | 2739 | 34b476f4d979e3a86ce6e601c7b11b734cda30830c859ab20edadcc546d12282 |
| this-archive Node scan | 934 | 1212494850befd7e524a84a3977f73d4158a5d979aca1df93927e532f6a56c42 |
| Python stdout | 257 | b27f6ccff0a4d1b4db77229adcb9bd05cb41c9216bf2e74fe60625ce960117c6 |
| Node stdout | 168 | 7dbedfd35c771a4335f1ebbb66cef4090eeb59eaa273fee3805a79bc5fdfc860 |