Structured type selectors have succinct macro receipts

Exact statement

The constructive ASI selector is succinctly generable from a type vector and combinatorial unranking, so Run 13's arbitrary-mask receipt lower bound does not apply to this structured family.

StatusProved in the FPRD research record

External reviewNo documented external or specialist review of the FPRD synthesis is recorded.

Context

This result belongs to the reconstruction from algebraic matrix-multiplication certificates to explicit arithmetic dependency DAGs and their resource receipts.

Hypotheses and scope

All resource conclusions are restricted to the arithmetic, storage, fan-out, coefficient, and precision models named in the source record.

Proof or evidence

Type words are enumerated lexicographically and rank terms assigned injectively; macro selector description uses $O(K\log N)$ bits, though its expanded labelled list has multinomial size.

Mathematical overview and evidence boundary →

Verification notes

The analytic argument is preserved in the research record. Independent external review is not recorded.

Limitations

The record does not improve the known matrix-multiplication exponent and does not imply that omega equals two.
Construction bounds are not optimality, communication, I/O, or hardware claims unless the exact statement says so.

Open work

Independently re-audit the complete derivation before any further promotion.