Native ordinary 3SUM controller #
The fixed program executes preprocessing, reads its raw table/count/common-length registers, and passes each actual payload pointer to the existing Convolution host. Matrices and solver workspace begin above twice the preprocessing's polynomial word envelope. No packed input is copied or replaced; the concrete callee must keep the entire lower prefix.
Inputs shorter than three positions return false directly. This is an intentional final verdict shortcut; it does not claim that their exact preprocessing instance lists are empty.
Main definitions #
registerCount,preprocessingRegisters,hostRegisters,controllerRegisters: fixed banks.envelopeExponent: exponent of the reused preprocessing word bound.program,flatProgram: actual finite controller and its raw Boolean-returning halt.
These native control/layout choices are original. The fast solver and final exponent 1.9992 remain separate; correctness and resource proofs are supplied in the consumer modules.
Fixed register count for preprocessing, one Convolution host/callee and sixteen controls.
Instances For
The complete original preprocessing bank.
Instances For
A disjoint bank for the actual Convolution host and supplied finite callee.
Instances For
Outer controls survive both preprocessing and every Convolution call.
Instances For
Saved actual input length.
Instances For
Base n+2 of the polynomial reservation.
Instances For
Computed polynomial word envelope.
Instances For
Remaining native multiplications.
Instances For
Constant one.
Instances For
Constant two.
Instances For
Boundary-case threshold.
Instances For
Actual preprocessing pointer-table base.
Instances For
Actual preprocessing output count.
Instances For
Actual common packed length.
Instances For
Next actual table entry.
Instances For
Accumulated raw Boolean.
Instances For
Actual pointed-to signed payload.
Instances For
Load-address temporary.
Instances For
Caller-owned matrix workspace.
Instances For
Constant zero.
Instances For
Exactly the exponent already proved for every preprocessing word.
Instances For
Read only the ordinary raw length header and initialize the small-case verdict.
Instances For
Save the actual preprocessing ABI and initialize the polynomial-reservation loop.
Instances For
Every multiplication and loop decrement is an actual charged instruction.
Instances For
Compute the fixed-exponent reservation by native iteration.
Instances For
Keep every catalogue/array cell below the matrix workspace.
Instances For
Fetch the next actual pointer; no mathematical layout function supplies runtime advice.
Instances For
Deliver four raw arguments to the caller-owned Convolution entry point.
Instances For
Accumulate the actual Convolution return and advance one pointer.
Instances For
One complete native pointed-to Convolution call.
Instances For
Visit all actually emitted packed instances.
Instances For
Actual preprocessing and all caller-safe solver calls on inputs with at least three entries.
Instances For
One finite standard-code body per fixed input exponent and concrete finite callee.
Instances For
The single final halt returns the raw accumulated Boolean.