Remark: Family 284. The optimal randomized–quantum query exponent

Shows that the universal bound $R(f)=O((1+Q(f){)}^4)$ for total Boolean functions is sharp in its exponent, ruling out every smaller power and disproving the conjectured cubic relation. Here $R$ and $Q$ are randomized and quantum worst-case bit-query complexities with error at most $1/3$; computation between queries is unrestricted.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.