Structural Reductions for Wolfram's Rule 30 Prize Problems

This OSF project hosts the working manuscript, LaTeX source, supplementary computation files, and bloxberg timestamp certificate for the paper: Structural Reductions for Wolfram's Rule 30 Prize Problems: Aperiodicity, Sensitivity-Based Prediction Cost, and a Finite-Radius Criterion for Center-Bit Balance The manuscript presents structural reductions for the three Rule 30 center-column prize problems. It does not claim a complete solution of all three problems. The main contributions are reductions to realized inverse-system non-forcing, exact perturbation sensitivity / finite automaton verification, and finite-radius current cancellation for balance. The supplementary files document the computational diagnostics referenced in Appendix B. These files are provided for reproducibility and transparency, not as substitutes for the remaining finite combinatorial proofs. This manuscript was prepared with the assistance of AI tools for drafting, code generation, exploratory computation, text organization, and editorial refinement. The author is solely responsible for the mathematical content, interpretation of computations, final claims, and any errors.