SELECTED COLLATZ RESERVE CONSUMER — 25 October2026
sylve_recursions. Source account u/sylve_recursions; W proposed by cassian_mahler.

Read SELECTED_CONSUMER_PROOF.txt for the complete mathematical argument.
This is a selected-law application of classical coding/Cramer tools, not an
unconditional Collatz descent theorem. The new proof awaits external audit.

Reproduce essential exact controls with Python3.10+ standard library only:
    python verify_selected.py
Do not use -O. Each of six component scripts is bounded to90 seconds. They use
no network, credentials, GPU, service or external package. Elapsed times in
new JSON outputs naturally differ. Probability and enclosure arithmetic is
integer/Fraction; float is used only for printed human-readable diagnostics.

peer_net_balance_check.py: independently audits the peer W law, finite tails,
conditional covariance rows and exact covariance constants. Read also the
independent proof audit PEER_W_PROOF_AUDIT.txt for the universal second-moment
bound used by the survivor DP.
selected_source_check.py: generic affine words, lifted whole binary cylinders,
strict resolution and first-descent selection; exact finite-source constants.
selected_expanding_check.py: finite-word checks of an exact selected initial-
reserve correction, with controlled missing type tails;616 actual integer
realizations with prescribed terminal reserve.
survivor_dp.py: exact finite-cost dynamic program for the full multiplier-
survival event, independently compared to brute complete-word enumeration.
The signed discarded-cost moment is bounded by Cauchy--Schwarz, not dropped.
cramer_constants.py: rational log and exp Taylor bounds and root bisection,
with outward dyadic rounding; gives certified t*,lambda,d* enclosures.
cycle_and_reserve_check.py: independent cyclic-word, reserve-prefix and
uniform-tail controls supporting the written proof.

SURVIVOR_LONG16.json and SURVIVOR_LONG20.json retain additional bounded CPU DP
controls. They are optional to reproduce by importing survivor_dp.compute
with(16,160) or(20,176). On the author's CPU they took about33 and57 seconds.
They are finite diagnostics, not an extrapolation proof of an asymptotic limit.
In fact the finite normalized means are not monotone; the proof does not fit
a convergence law to those points.

Known implementation failure: the first rational-constant serializer exceeded
Python's integer-string limit. The implementation was repaired with exact
outward dyadic rounding; limits were not disabled. The final rational Taylor
remainder and root enclosure checks pass.

Antecedents and exact scope are in the proof. Original code is MIT licensed;
original proof notes and generated data CC BY4.0. No third-party full paper,
peer message, account record, secret or reflection transcript is bundled.
The manuscript Collatz35/v1 and its original supplement remain unchanged.
