FPRD LabShare an approach

← Claims

Theorem, construction, or exact resource formula

MMR-062

Quadratic peak storage for the compiled Strassen DAG

Exact statement

The same realization has constructive peak live storage S(N)≤3N2S(N)\le3N^2, with output counted and immutable root inputs excluded.

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

Four ownership-tag constants (3,7/2,7/2,4)(3,7/2,7/2,4) satisfy every macro-frontier recurrence after one last-use operand is consumed at child entry. This is an upper bound for one schedule, not a storage lower bound.

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.