The compiled ASI base preserves the arithmetic exponent

Exact statement

The canonical coefficient-row realization of the final ASI base has $A_0<3Rs^2$ , $C_0\le3Rs^2$ , fewer than $3Rs^2$ fan-out-two buffers, logarithmic base depth, and peak below $10Rs^2$ ; sealed recursion preserves the multiplication exponent, has $O(\log n)$ depth, $O(n^2)$ pinned scalar storage, and fan-out two.

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

Explicit dense-row compilation and recurrences $G_t=RG_{t-1}+G_0s^{2(t-1)}$ . These are simultaneous constructive upper bounds, not optima or I/O results.

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.