Coefficient height and working precision remain computable

Exact statement

For an explicit rational ASI certificate, coefficient height is finitely computable through the Run 14 common-denominator recurrence; for the final exact base, standard stationary bilinear analysis gives sufficient precision $O_\varepsilon(\log n+\lambda)$ for absolute error $2^{-\lambda}$ .

StatusSupported analytically with a cited published dependency

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

Height recurrence tracks evaluated curve, outer tensor power, type summation, cyclic tensoring, and Vandermonde extraction. Numerical induction specializes Demmel--Dumitriu--Holtz--Kleinberg. No certificate-independent height or precision lower bound.

Mathematical overview and evidence boundary →

Verification notes

The bibliography retains the primary-source attribution. The public record does not treat publication of the underlying theorem as review of this FPRD synthesis.

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

Confirm the primary citation, hypotheses, and exact scope through an independent source audit.