A Sharp 144-Signature Bound for Six-Step Fibonacci Observations
We study the observation signatures generated by six Fibonacci linear forms with coefficient vectors (1,0), (0,1), (1,1), (1,2), (2,3), and (3,5). For each positive integer m, the signature of a state in (Z/3mZ)² consists of the six leading ternary digits of the corresponding linear-form residues modulo 3m. We establish a sharp universal upper bound of 144 distinct observation signatures for every positive integer m, supported by an exact computer-assisted geometric certificate. The proof combines rational line-arrangement enumeration, independent polygon-clipping verification, and exhaustive treatment of quantization boundaries, including multiple line intersections. The continuous geometric model produces exactly 144 distinct signatures. An explicit certificate containing 144 rational and integer witnesses establishes that all signatures occur at m = 360 and at every positive multiple of 360. The accompanying reproducibility package includes Python 3 verification programs, the complete witness certificate, independent computational audits, negative validation tests, and SHA-256 integrity information. All programs use only the Python standard library and operate offline. The result is presented as a reproducible computer-assisted mathematical preprint. It has not undergone external peer review or proof-assistant formalization. No claim of established literature priority is made. This work is part of the broader Reconstruction Theory / RT-TIME research program. It is distinct from the earlier enumeration of algebraically admissible collision directions and does not claim to resolve the RT-TIME 9.10 transition-graph problem. AI Assistance Disclosure AI tools were used to assist with mathematical manuscript drafting, Python code development, documentation, and the organization of computational verification procedures. The author reviewed the research package and retains responsibility for the mathematical statements, interpretation of computational results, and publication decisions. The accompanying programs and certificates provide reproducible computational evidence. AI-assisted verification does not constitute external human peer review or formal proof-assistant verification. Code and Data Availability The research package contains the complete 144-signature certificate, exact rational and integer witnesses, independent verification programs, negative validation tests, and SHA-256 integrity information. The Python programs require Python 3 and the standard library only. They run offline, produce console output, and do not create files during execution. The principal verification scripts are: rt_time_bridge_audit_0_6_pydroid.py rt_time_bridge_release_verifier.py The certificate is provided as RT_TIME_BRIDGE_144_WITNESSES.txt. The exact computational verification supports the sharp universal signature bound, conditional on the correctness of the algorithms and their implementations. Version 1.2 — Initial public archival release. This preprint presents a sharp 144-signature bound for six-step Fibonacci observations, supported by exact rational geometric enumeration and reproducible computational certificates. The manuscript is not peer reviewed. External mathematical review and comprehensive verification of literature priority remain open. The value m = 360 is a verified saturation witness and is not claimed to be the smallest possible saturation modulus.
Authors
- Ivo Vajc (ORCID: https://orcid.org/0009-0005-5145-6491)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.5281/zenodo.24354268
- Primary Topic
- Advanced Mathematical Theories and Applications
- Type
- preprint