Terminology module v2.1.0
Canonical rational-base arithmetic and frozen SRSD audit instrument
This page is a portable terminology and training module. It is not a source paper. It adopts vocabulary from an internal Omega/JPRV terminology draft, revision 5, without converting that unpublished draft into a publication claim. Module v2.1.0 is the current download. v2.0.0 is retained as an immutable historical artifact; it taught SRSD as a structural root and is superseded.
Source status
Internal Omega/JPRV terminology draft, revision 5 (filename Paper_IV_Draft_5.pdf) is an unpublished internal iteration. It is not the published Paper IV and is not one of the source works. This module uses it only as a terminology source.
SRSD v1.0 is the frozen external audit legend applied to separately defined theories. Omega/JPRV is a distinct native rational-base arithmetic branch. JPRV is a deterministic execution and replay layer. The identity E₁(λ_Q d_k)=(d_{k+1}, u_k) is an exact external representation identity; it does not identify the systems.
Frozen SRSD (Paper III) is the external audit instrument and is not enlarged here. Omega/JPRV is not identified with radial icosahedral cubature. Those claims live at /srsd and /cubature. The July 2026 Omega-Alpha synthesis remains a historical consolidation at /dynamics/omega-alpha and is not a source paper.
Symbolic λ and machine λ_Q
Never identify with . Never recompute the canonical integer from binary floating-point evaluations of and . The reduced integers are and , with .
Native P/R arithmetic
Equivalently . The residual is even because and . The normalized digit satisfies the exact unit-scale SRSD identity
That identity is representational. It does not make SRSD and rational-base numeration the same native dynamical system.
First residual on the 15-bit domain
On the canonical 15-bit domain the first residual is injective, so it already determines the limb. The configured 23-step ledger remains an exact deterministic execution trace; it is not information-minimal reconstruction data.
if and only if . The inverse of modulo is . Because , the first residual is injective on .
Worked check: has first residual and recovers as
Every state in reaches in at most ten quotient steps. The trajectory from uses ten steps, so ten is the exact uniform bound. The configured length is protocol padding after extinction, not the termination theorem. Finite-domain successor facts remain at /dynamics/successors.
Legacy OGC vocabulary
Older “boundary-witness” language may be recognized and translated. It is not the current mathematical terminology.
| Retired or informal term | Current term |
|---|---|
| OGC | Omega/JPRV canonical rational-base arithmetic (finite integer recurrence) |
| remainder witness | raw residual ρ_k |
| witness ledger | ordered residual ledger or deterministic execution trace |
| boundary recovery | exact quotient-residual reconstruction |
| contraction endpoint | terminal quotient d_N |
Retired as a canonical statement: the complete 23-step ledger is necessary to reconstruct a canonical 15-bit limb. Replacement: the ledger reconstructs exactly and records the execution path, but the first residual already identifies the limb.
Claim discipline
Neither rational-base arithmetic nor exact SRSD transport proves holography, AdS/CFT, black-hole entropy, or spacetime discreteness. Speculative comparisons must be labeled structural analogy.
- Do not treat as the contracting quotient orbit. That map is the modular shadow.
- Do not call an unkeyed digest of a trace cryptographic authentication.
- Do not call the ledger compression: it can expand the representation.
- Do not infer that Omega/JPRV is icosahedral geometry, Hamiltonian dynamics, or golden inflation because each can be written in SRSD coordinates.
Training checks
| ID | Prompt | Expected discipline |
|---|---|---|
| T001 | SRSD vs Omega/JPRV | SRSD is the frozen external audit legend; Omega/JPRV is a native arithmetic branch. |
| T002 | Reduced P/R form | R d_k = P d_{k+1} + a_k. |
| T003 | Normalized residual | E_1(λ_Q d_k) = (d_{k+1}, u_k). |
| T004 | First residual | A 15-bit limb is already determined by ρ_0; the 23-step ledger is not required to identify it. |
| T008 | λ vs λ_Q | λ = φ/(φ+π) is symbolic; λ_Q = Q/S is the exact rational machine ratio. |
| T012 | Termination | Every 15-bit state reaches 0 in at most 10 steps; N = 23 is protocol, not the bound. |
| T013 | Physics boundary | Arithmetic and transport identities do not prove holography or quantum gravity. |
Portable module
- JSON
- Download training module v2.1.031891 bytes · SHA-256
ac861a395cdf83fea39c9773cf6f1776763c5cff3566d665cf903728ee225d68 - Superseded JSON
- Historical training module v2.0.0Immutable historical artifact. Taught SRSD as a structural root. Served
noindex, noarchive. 28647 bytes · SHA-256991282db172f6bd977164a11078ac24ec57ef957b63906ac05b5057460c6f2bb - Related audits
- Frozen SRSD (Paper III) · Papers I–II · 15-bit successor search