Bounded Dangerous-Word Chains in the Length-64 Accelerated Collatz Map
Abstract
This record contains a preprint and a fully reproducible bundle of code, data, and figures for an empirical study of bounded dangerous block chains in the length sixty four accelerated Collatz map. The work builds an explicit successor graph for the most frequent low valuation blocks in tail data and then validates the resulting drainage picture with two adic depth scans inside exact cylinders. The key finding is that dangerous continuations are extremely sparse and appear depth limited in large consecutive two adic slices, with the few depth three seeds explicitly enumerated and shown to eject immediately under tracing and lift neighborhood tests. The bundle includes the manuscript, scripts, raw scan summaries, node and edge tables for the successor graph, and the plotted figures including a seaweed style visualization.https://zenodo.org/records/18125856
Fields of Study & Subjects
Benford’s Law and Fraud Detection
Academic Publishing and Open Access
Academic integrity and plagiarism
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 2 January 2026
- Document type
- Preprint