Parent: #650. Depends on #635 / PR #646 and the committed axis-L=5 Bernstein integers from #639 / PR #649.
Why this exists
#635 returned verdict A at finite L: M(p) is the difference of two wrapping amplitudes, but they degenerate to a single both-same homology label measured twice (black NN vs white NN+NNN). On every size reached (axis L=3,4; diamond L=2), the labels x / y / both-two carried zero D at every k.
The open structural caveat was: does both-two acquire weight at L≥5, past the sizes the mapping probe enumerated?
Axis L=5 is now an exact Bernstein rung (N=25, 2^25 configs) with two independent brute-force kernels. That is the last independently checkable place to ask the caveat without building a transfer matrix.
The question
On axis L=5, with the same winding-homology labels as #646, does any configuration with D ≠ 0 land in both-two (or in x / y) at any occupation k?
Three useful outcomes:
A-continues both-two (and x/y) still have zero D at every k; degeneracy is not a small-L accident
A-breaks some k has nonzero both-two (or x/y) mass; quote the first k and the integer count
classifier-wrong the collapsed D(C) fails to reproduce the committed axis-L=5 Bernstein integers
Acceptance gate — first, not last
The census, summed with
D(C) = 1{black NN wraps} - 1{white NN+NNN wraps}
must reproduce the committed axis-L=5 integer Bernstein coefficients bit-for-bit. Those integers live in results/exact-bernstein-ladder-639/latest.json on PR #649 / branch exact-bernstein-ladder-639. If #649 is not on the assigned base, cherry-pick or check out that artifact; do not re-derive the polynomial by a third kernel and call it the gate.
If the collapsed table misses those integers, the classifier is wrong and nothing else in the report is usable.
What to compute
Exact integer counts by occupation k, cross-classified by the #646 winding labels, for axis L=5 only. Diamond L=5 is out of independent brute-force reach and is not in scope.
Reuse the committed L=5 enumerator / DSU from #649 if it is in the tree you were assigned. Do not invent a connectivity transfer matrix. That would circularly use the object #636 still has to validate.
Deliverable
1. bit-exact reproduction of the axis-L=5 Bernstein integers, or a stop;
2. per-k integer table for the winding labels, committed as exact integers;
3. verdict A-continues / A-breaks / classifier-wrong, one sentence;
4. wall time and configuration count.
PR against the base Grok names in the assignment comment. Do not edit docs/STATUS.md. Do not close #635 or #650.
Claim boundary
Related: #635, #639, #640, #646, #649, #650.
Parent: #650. Depends on #635 / PR #646 and the committed axis-L=5 Bernstein integers from #639 / PR #649.
Why this exists
#635 returned verdict A at finite L:
M(p)is the difference of two wrapping amplitudes, but they degenerate to a singleboth-samehomology label measured twice (black NN vs white NN+NNN). On every size reached (axis L=3,4; diamond L=2), the labelsx / y / both-twocarried zero D at every k.The open structural caveat was: does
both-twoacquire weight at L≥5, past the sizes the mapping probe enumerated?Axis L=5 is now an exact Bernstein rung (
N=25,2^25configs) with two independent brute-force kernels. That is the last independently checkable place to ask the caveat without building a transfer matrix.The question
Three useful outcomes:
Acceptance gate — first, not last
The census, summed with
must reproduce the committed axis-L=5 integer Bernstein coefficients bit-for-bit. Those integers live in
results/exact-bernstein-ladder-639/latest.jsonon PR #649 / branchexact-bernstein-ladder-639. If #649 is not on the assigned base, cherry-pick or check out that artifact; do not re-derive the polynomial by a third kernel and call it the gate.If the collapsed table misses those integers, the classifier is wrong and nothing else in the report is usable.
What to compute
Exact integer counts by occupation k, cross-classified by the #646 winding labels, for axis L=5 only. Diamond L=5 is out of independent brute-force reach and is not in scope.
Reuse the committed L=5 enumerator / DSU from #649 if it is in the tree you were assigned. Do not invent a connectivity transfer matrix. That would circularly use the object #636 still has to validate.
Deliverable
PR against the base Grok names in the assignment comment. Do not edit
docs/STATUS.md. Do not close #635 or #650.Claim boundary
Related: #635, #639, #640, #646, #649, #650.