OMEGA floor-map fibers and 32-block seed cover

Frozen parameters $Q=339949771344778$, $S=10^{15}$, $T(d)=\lfloor Q d/S\rfloor$. Positive orbits strictly decrease to the loop at zero. The primary name is a monotone strictly descending floor map, not a metric contraction. Inverse intervals use the reciprocal rational slope $S/Q$; that symbol is not the real parameter $\lambda=\varphi/(\varphi+\pi)$.

Appendix A is a separate comparison with the real floor map. First nonnegative disagreement: $d^\star=42189065$. Agreement resumes at the next seed. That is the same location already recorded on this archive; this handoff does not enlarge it into a fiber-only certificate.

Unrestricted fibers are nonempty consecutive intervals of size 2 or 3. Size two occurs exactly when the residue lies in $(0,A]$ with $A=3Q-S$, including the equality case. The size word is a periodic rational mechanical word of period $P=Q/\gcd(Q,S)$, not a Sturmian aperiodic word.

On $\{0,\ldots,32767\}$ the checker reconstructs every restricted fiber, every minimal ordered ledger, the depth histogram (maximum 10, depth sum 300,871), and the complete branch-signature table (11,140 nonempty bases). Root preimages are nested cumulative depth sets; exact levels are successive differences.

Blocks $\{1024 b,\ldots,1024 b+1023\}$ for $b=0,\ldots,31$ partition the 15-bit domain. They are disjoint seed blocks whose image sets may overlap (image counts sum to 11,159 against an image of size 11,140). Hard seeds means depth ten, not search difficulty. Block 17 contains the transition at 17,697 and 735 hard seeds; blocks 18–31 are entirely depth ten.

Ledger acceptance requires ordered remainders, reverse divisibility, exact block identifiers, and all 32,768 seeds once. A failed run must exit nonzero and must not write a success artifact. This archive’s checker writes no files; the separately reported 0.2 producer was not supplied.

Python 3.11.2, 2026-09-19T11:18:30Z. Standard library only. Checker SHA-256 matches Appendix C.

python3.11 verify_handoff.py
python3.11 -O verify_handoff.py
python3.11 -OO verify_handoff.py

Handoff DOCX verify_handoff.py stdout ENVIRONMENT.json · README.md

DOCX 38,901 bytes, SHA-256 6d79cddedb1bec065cb065604cbb51dd70d94ac0a90c432dc88eee4395aa381bCopy.

Checker 6,701 bytes, SHA-256 9f7179c5be49c0c4f797824011226dbd4d9980c7cc71aff1d80bd1a616e121c8Copy.

Stdout 450 bytes, SHA-256 bb8832071b312b895f0ab8d87c619c9c8f97251d5ca07faf4038e32792aa0093Copy.

Version 0.1 (defective predicate) and the reported 0.2 certificate/cover files are named with hashes in the handoff and are not hosted here. This replay cannot authenticate omega_fiber_structure_0_2.json (reported 6f827adb…) or COVER.json (reported 2bea5b72…).

Related on this archive: 15-bit successor search and the synthesis first-disagreement review. Those remain separate packages.

Not one of the eight source works. Not a proof of every earlier paper. Not a Navier–Stokes or geometry theorem. Not Lean. Not cubature. Not Cube20: there is one prescribed successor per state and an extinction depth, not a generating set or word metric. Frozen G₆ unchanged. SRSD remains frozen.