Matroid Prophet Inequality: One Sample, No Secrets, Inside OpenAI’s Proof

Matroid prophet inequality depicted as a golden forest inside transparent blue glass.

Imagine choosing network connections while an opponent already knows every value, every sample and every coin you will flip. Your decisions remain irreversible. OpenAI’s September 23, 2026 paper proves that a matroid prophet inequality survives this information imbalance: one independent sample per element suffices for a universal expected reward fraction of 2−3102^{-310}. The detailed proof … Read more

Weisfeiler–Leman Time Complexity: OpenAI’s Proof of an Unavoidable \(n^{\Omega(k)}\) Time Cost

Weisfeiler Leman time complexity illustrated by a graph-printing press and growing stacks of graph plates.

Must a graph comparison become polynomially harder as its dimension grows, or could a clever algorithm bypass the expensive refinement? OpenAI’s September 25, 2026 paper on unconditional WL lower bounds answers this question about weisfeiler leman time complexity. For every sufficiently large fixed dimension, every correct deterministic sequential decider needs an exponent proportional to that … Read more

QMA Hardness of Electronic Structure: How OpenAI Encoded Quantum Complexity with Unit-Charge Nuclei

QMA hardness of electronic structure shown as unit-charge nuclei casting a complex quantum labyrinth.

One hydrogen atom is a textbook calculation. A carefully arranged collection of unit-charge nuclei can encode the hardest problems whose quantum witnesses can be checked efficiently. OpenAI’s September 24, 2026 preprint establishes QMA hardness of electronic structure for the electronic ground-energy infimum in continuous three-dimensional space, with every nuclear charge fixed at one. The essential … Read more

QAOA Algorithm: How OpenAI’s Proof Reaches the SK Spin-Glass Optimum

QAOA algorithm artwork showing interacting binary spins and alternating controls approaching the SK optimum.

A quantum optimizer can improve forever on small test problems without proving it can approach the best possible energy in an infinitely growing system. OpenAI’s September 25, 2026 QAOA proof preprint addresses precisely that gap. The QAOA algorithm, short for Quantum Approximate Optimization Algorithm, alternates problem-dependent interactions with mixing rotations. The manuscript proves that its … Read more

Boolean Circuits: Inside OpenAI’s Proof of a Stronger Depth-Three Lower Bound

Boolean circuits depicted as three shallow logic terraces expanding sideways, illustrating OpenAI’s stronger lower bound.

A three-layer logic circuit can read every input bit at once and reuse intermediate results freely. OpenAI’s new construction still forces it beyond every constant-times-square-root exponential size bound. The September 23, 2026 paper presents one efficiently computable language whose depth-three Boolean circuits require 2ω(n)2^{\omega(\sqrt n)} gates at every sufficiently large input length. That is the … Read more

Bin Packing Problem: How OpenAI’s Proof Overturns a 31-Year Rounding Conjecture

Bin packing problem artwork contrasts a fractional packing plan with solid drawers that need more space.

One extra bin sounded like a reasonable allowance. OpenAI’s September 24, 2026 manuscript argues that no fixed allowance works: the bin packing problem can require arbitrarily more whole bins than its configuration linear program predicts. That disproves the Modified Integer Round-Up Conjecture, whose published formulation dates to 1995. A separate theorem makes every fixed additive … Read more

K Median Problem: How the OpenAI Proof Reaches the Optimal Limit if P ≠ NP

K median problem artwork showing selected gold hubs connecting clients across a folded city.

Choosing warehouse locations sounds like a logistics exercise. Requiring a provably near-best choice for every possible metric turns it into a decades-long mathematical challenge. The k median problem asks for at most kk facilities minimizing total client distance. OpenAI’s September 24, 2026 manuscript presents a deterministic polynomial-time approximation within 1+2/e+ε1+2/e+\varepsilon of optimum for every fixed … Read more