Reproducibility package — Piecewise Affine Integer Dynamics: cascade-decomposition analysis with applications to cryptographic shift registers and gene regulatory networks

Author:** Dr Razvan A. Satnoianu, Oxford, UK**Companion paper:** submitted to *Physica D: Nonlinear Phenomena*, May 2026**Priority claim:** US Provisional Patent Application 64/062,380 (filed 11 May 2026)**Archive version:** v1.0**Archive date:** May 2026 --- ## Overview This archive contains the numerical scripts and selected datasets reproducing the empirical claims of the companion manuscript: - §3.5a — algorithmic cost of the cascade-tuple framework- §3.5b — connection-integer strength ranking (Table 1)- §3.4 — Proposition 3.2: recovery of the Stankovski–Hell–Johansson [SHJ12] per-cell carry-run-length asymptote as a special case of Theorem 3.1- §3.8 — the worked 8-bit FCSR example- §4.5 — λ-phage cI/cro Glass-network cascade-Lyapunov estimate ## Contents ```supplementary_zenodo/├── README.md ← this file├── LICENSE ← CC-BY 4.0├── CITATION.cff ← machine-readable citation├── scripts/│ ├── connection_strength_probe.py ← reproduces Table 1 of §3.5b│ └── stankovski_recovery_check.py ← verifies Proposition 3.2 (§3.4)└── figures/ ├── fig1_cascade_concept_v2.{pdf,png} ├── fig2_fcsr_distribution.{pdf,png} ├── fig3_glass_orthants.{pdf,png} ├── fig4_lambda_cascade_tuples.{pdf,png} └── fig5_framework_map_v3.{pdf,png}``` ## Dependencies