Theorem, construction, or exact resource formula

MMR-117

Claim MMR-117

Exact statement

Equal-size zeroings of ΔM=⨁i=1M⟨1,1,1⟩\Delta_M=\bigoplus_{i=1}^M\langle1,1,1\rangle have identical aggregate ASI/runtime statistics but a labelled selector receipt needs ⌈log⁡2(Mh)⌉\lceil\log_2\binom Mh\rceil bits in the worst case.

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

Theorem R13.3: a context requesting a symmetric-difference port separates two masks; counting receipt states gives the bound. Receipt-size theorem only.

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.