Observed Signal · May 22, 2026 · Research Result · Source: AI Secret · Impact: 4/5 · Sentiment: Neutral
OpenAI Disproves Erdős Conjecture
An OpenAI internal reasoning model has reportedly constructed a new solution that disproves a 1946 Paul Erdős conjecture about unit-distance pairs among n planar points, producing a construction with ~n^{1+0.014} pairs. Verification for this claim was co-signed by Thomas Bloom, who maintains the Erdős database, after an earlier GPT-5 claim was found to merely rephrase prior literature. The newsletter also reports related industry signals: Starbucks has scrapped an AI inventory-counting tool from vendor NomadGo across 11,000 North American stores; Airbnb released its 2026 Summer Release featuring an in‑app AI assistant and new logistics partners; and Google is integrating ad-driven, Gemini-powered responses into Search via an
A verified LLM-driven proof signals materially advancing foundation-model capabilities, while simultaneous product moves from Google (ads embedded into assistant replies) and major vendor failures (Starbucks/NomadGo) have direct operational and commercial implications for ad formats, trust in AI assistants, retail tech procurement and the economics of AI vendors.
Track OpenAI Signals & Market Shifts in Real-Time
Polaris7 autonomous intelligence agents track regulatory filings, primary sources, executive changes, and deal flow 24/7. Create your free Explorer workspace to monitor these entities.
Key Takeaways & Evidence Grounding
- An OpenAI internal reasoning model produced a construction that reportedly disproves a 1946 Paul Erdős conjecture (unit-distance problem), yielding approximately n^{1+0.014} pairs.
- Thomas Bloom, who manages the Erdős database, co-signed the verification paper; a prior GPT-5 claim in October was shown to have paraphrased existing literature.
- Starbucks scrapped an AI inventory-counting tool from vendor NomadGo across 11,000 North American stores after repeated miscounts and mislabeled items.
- Airbnb shipped its 2026 Summer Release including an in-app AI assistant (supporting review-reading, itinerary drafting and multilingual support) plus integrations for car rentals, Instacart groceries and other logistics.
- Google is embedding ads into Gemini-powered Search results with interactive explainers and an 'AI Mode' that can let sponsored items dominate full assistant replies.
Connected Companies & Entities
7 Entities mappedOntology Mapping & Concepts
Related Market Signals & Shifts
Recent verified developments and strategic activity across this market segment.
OpenAI Reasoning Model Overturns Erdős Unit-Distance Conjecture
OpenAI researchers described on an OpenAI podcast how a new reasoning-focused model produced a proof that refutes Paul Erdős’s roughly 80-year-old unit-distance conjecture in combinatorial geometry. The model used expanded test-time compute to explore and self-correct reasoning paths, producing a 125-page chain-of-thought and a construction that leverages algebraic number theory (class field theory) to build a highly symmetric geometric design that outperforms the square-grid arrangement. Internal OpenAI mathematicians reviewed the output, initially suspecting bugs but later validating the result. Follow-on human work, motivated by the model’s constructions, reportedly led to another rapid breakthrough on a related sum–product conjecture. Researchers discussed future goals including automating AI-driven research, tackling P vs NP, and applications in cryptography and quantum error correction.
OpenAI Model Disproves Erdős Unit-Distance Conjecture
In May 2026 an internal OpenAI reasoning model produced a 125-page Chain of Thought (CoT) describing a construction that raises the known lower bound for the planar unit distance problem, countering Paul Erdős's long‑standing conjecture that the maximum number of unit‑distance pairs grows like n^{1+o(1)}. The model's reasoning—which moved from combinatorial geometry into algebraic number theory using constructions such as CM fields and class field towers—was distilled and reviewed by nine mathematicians in a human‑verified report ('Remarks on the Disproof of the Unit Distance Conjecture', arXiv:2605.20695). Independent work by Will Sawin (arXiv:2605.20579) gives an explicit lower bound n^{1.014}; later improvements claim bounds up to about n^{1.036} (not all fully verified). The proven upper bound O(n^{4/3}) remains intact.
OpenAI's AI Agents Crack Major Math Problem in 88 Hours
In early September 2026, OpenAI deployed a swarm of AI agents using an unreleased, more powerful model than GPT-6 Astra to tackle the Millennium Prize Problems. Within 88 hours, roughly 100 agents produced a proposed proof for a related Navier-Stokes problem, later verified using the Lean proof assistant. This was triggered by a rumor about a rival lab's progress, which turned out to be a misattribution of work by NYU professor Tristan Buckmaster and Anthropic employee Levent Alpöge. OpenAI researcher Noam Brown said the effort cost millions of dollars and predicted similar capabilities would become accessible within a year. The article argues this event signals a shift in scientific research toward resource allocation and AI agent supervision, raising questions about the future of work and concentration of power in leading AI labs.
Track Real-Time Market Signals & Shifts
Set up custom watchlists to receive automated, evidence-grounded executive digests whenever material signals or shifts occur across your tracked landscape.