Covering the latest announcements, research breakthroughs, industry developments, funding news, and emerging trends in the artificial intelligence landscape.
Two mobile servers can spend forever chasing nearby requests while a better plan moves once and stops. The randomized k server problem asks how much that lack of foresight must cost. OpenAI’s September 24, 2026 preprint gives a squared-logarithmic answer: on every metric space, a randomized online policy can stay within a universal constant times … Read more
A polynomial can have only two choices for each coefficient and still face an entire circle of tests. OpenAI’s October 5, 2026 manuscript presents a proof that littlewood polynomials with coefficients ±1 can have magnitude arbitrarily close to their natural square-root scale at every angle, for every sufficiently large integer length. The achievement asserted is … Read more
Choose three positive integers. Add any selection of them, or multiply it. Can every result carry the same color, however someone has colored the number line? The Hindman Finite Sums and Products Conjecture asks for this cooperation between addition and multiplication for every prescribed finite set size. OpenAI’s September 23, 2026 manuscript presents a proof … Read more
Delete one bit and every later position can become ambiguous. Delete bits independently across repeated copies, and even unlimited computation may need more observations than any fixed polynomial can supply. That is the central result of OpenAI’s September 24, 2026 paper, Quantitative Lower Bounds for Trace Reconstruction. For every fixed deletion probability strictly between zero … Read more
A prime desert is easy to admire and surprisingly difficult to count. One enormous gap can contain thousands of empty intervals, making rare events look common. OpenAI’s September 25, 2026 manuscript, Positive Lower Density of Large Prime Gaps, presents a proof that large prime gaps occur with positive lower density: for every fixed positive multiplier, … Read more
A coding agent can look almost tied with Claude on one test and fall far behind it on the next. Kimi K3.1 Pro makes that tension unusually concrete: Moonshot reports 65.7% on Terminal-Bench 4.0 against Claude Opus 5.5’s 66.4%, yet only 31.5 against Opus’s 65.0 on ProgramBench’s binary scoring. Released October 23, 2026, Moonshot’s new … Read more
Six jobs, three machines, and a dependency chain can still leave processors idle. The difficulty is choosing which available work to run now without delaying the finish later. Three machine scheduling turns that familiar coordination problem into a precise mathematical question: can an optimal schedule always be found in polynomial time? OpenAI’s September 24, 2026 … Read more