Calling the Run 4 receipt efficient or scalable

Exact statement

Calling the Run 4 receipt efficient or scalable. a gadget can have $2^{|V_G|}$ ideals, and network product states can multiply. The theorem is an exact finite specification, not a polynomial algorithm or useful recursive asymptotic bound.

Statusrejected.

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 gadget can have $2^{|V_G|}$ ideals, and network product states can multiply. The theorem is an exact finite specification, not a polynomial algorithm or useful recursive asymptotic bound.

Rejected transfers and surviving boundaries →

Verification notes

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

Limitations

receipt compression is now the decisive obligation.

Open work

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