Resolves YES if a correct, complete, unconditional proof is publicly available by June 30, 2027, 23:59 UTC showing that two n-bit nonnegative integers can be multiplied exactly in worst-case O(n) time on a deterministic multitape Turing machine.

The machine must have a fixed finite alphabet and a fixed finite number of one-dimensional tapes. The bound includes reading the inputs, writing the binary product, and any preprocessing. Arbitrarily large constant factors are allowed.

Expected-time, average-case, bounded-error, approximate, quantum, or unit-cost arithmetic results do not count unless they also establish this bound in the specified model.

Preprints count if the proof is subsequently accepted as correct by the relevant research community; verification may occur after the deadline. Substantial missing arguments supplied after the deadline do not count. Otherwise resolves NO. A NO resolution means no qualifying proof was public by the deadline, not that linear-time multiplication is impossible.