Supplement, 12 November 2026. Not a source paper.
Exact transport of the rational floor map
Four implementations derive the same integer from bounds on and . A two-bit rank then recovers each earlier state. This page does not change the 399 floor note or Paper IX.
The coefficient
Let , , and . The four programs compute
The working precision is . The square-root bound is an integer square root. The circle bound is Machin's identity , with the arctangent series truncated and rounded outward. Both endpoint ratios produce the same floor. is the rational used by the transport step. It is not a claim that the displayed decimal of equals .
The rank decoder
The step is . The first possible predecessor of is . Then exactly when . Since , a fiber has at most three integers, so the rank is 0, 1, or 2, and .
The profile packs the 23 ranks into six little-endian bytes. The oldest rank is the least significant pair of bits. The highest two bits are zero. Seed 399 produces 09 06 00 00 00 00 and recovers , then zeros through step 23. The six-byte packet stands in for 45 bytes of 15-bit snapshots of the 24 states. The seed also fits in two bytes and determines the forward orbit. The rank log is the backward record from the shared terminal. A later page, seed packets, uses that log as one of two packet formats for 30 shared recipes.
This is not the unpadded extinction ledger on the 399 floor page. That record stops at the first zero. This profile always stores 23 steps. Both use the same and .
What was run here
python3 verify.py and python3 -O verify.py both exited 0. Stderr was empty, and the two stdout files are the same 1,031 bytes, SHA-256 017e1badbb0af92eee1f81b3c821ae6d6d1d6010dbc66bc2b3529142fd77fff9. The verifier enumerates the fibers itself and compares every implementation with that reference.
Java, Python, Rust, and Julia each derived . Each recovered 32,768 histories. Each matched five wire fixtures and rejected four malformed packets. The packet corpus is 196,608 bytes, SHA-256 2c33e539d752c893a182d7abdaba9d55046100c6b28a6401a99a231fa1afe5d7. The packet plus recovered-state corpus is 1,769,472 bytes, SHA-256 f1178578865f48d2ef27bb8b7b9de9e6949c549529cb5dee249b6fea8733b893. That is 753,664 transitions and 786,432 recovered states per implementation.
The runtimes were Python 3.10.21, OpenJDK 17.0.20, rustc 1.97.1, and Julia 1.11.6. The supplied RESULTS.txt names Python 3.12.14, OpenJDK 21.0.13, rustc 1.86.0, and Julia 1.11.6 for the same counts and the same two corpus digests. Those named versions were not the versions used here.
Lean source
OmegaTransport.lean imports the hosted constants and ledger and states the coefficient equality, remainder recovery, and the packet theorems, including packet 399 = [9, 6, 0, 0, 0, 0]. Constants.lean and Ledger.lean match the files now at /formal, byte for byte. Codec.lean is the rank and byte-recovery source. A text scan of these files finds no sorry, admit, native_decide, or declared axiom. That scan is not a compiler run.
The supplied results record Lean 4.19.0, commit 6caaee842e94, Mathlib c44e0c8ee63ca166450922a373c7409c5d26b00b, a completed build, and axiom lines for eight theorems. packet_399 is reported as depending on no axioms. Lean is not installed in this archive. That build was not repeated. The results also name an archived site zip, SHA-256 251962e9a69cecbabbfee0a9ec23bf4fa20dcf171907ab3d09b5af29421da929. That zip is not in this package, so that object was not retrieved.
To compile it, use Lean 4.19.0 and that Mathlib revision:
lake update lake build
Not claimed
- That this archive rebuilt the Lean proofs.
- A written-proof review.
- That the unpadded 399 ledger and this 23-step profile are the same record.
- A change to Paper IX, or a tenth Zenodo deposit.
The package is OMEGA_Exact_Transport_Proof.zip, 23,110 bytes, SHA-256 198a1f89cec53bdb4e4372f8dbe43f933d972868f0b028e313f1134f2fc5dc22. Its fifteen checksums matched. This archive's log is stdout.txt.