Recursing the scalar five-register schedule unchanged

Exact statement

Recursing the scalar five-register schedule unchanged. a scalar multiplication may overwrite a last-use operand, while a recursive child must retain its input blocks and create a fresh output. Exact search finds minimum recursive-call frontier five, so the $2\times2$ recursive base uses six stored scalars rather than the Run 1 scalar peak five.

Statusrefuted under the Run 7 pinned read-only-call contract.

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

Context

The research record preserves failed approaches when they expose a model boundary, an invalid transfer, or an unsupported strengthening.

Proof or evidence

a scalar multiplication may overwrite a last-use operand, while a recursive child must retain its input blocks and create a fresh output. Exact search finds minimum recursive-call frontier five, so the $2\times2$ recursive base uses six stored scalars rather than the Run 1 scalar peak five.

Rejected transfers and surviving boundaries →

Verification notes

The failure status and preserved lesson are recorded in the cumulative failure ledger.

Limitations

a recursive receipt must distinguish ordinary liveness from values pinned across a call.

Open work

Keep this exclusion attached to any future reuse of the corresponding construction.