The Exponential Time Hypothesis conjectures that deterministic algorithms for the 3SAT boolean satisfiability problem require exponential time in the number of variables and serves as a cornerstone of fine grained complexity theory. Hours before Anthropic published its repository, OpenAI announced on October 26 that its own internal models had refuted the Exponential Time Hypothesis alongside breakthroughs in harmonic analysis and quantum field theory.

Just hours after OpenAI announced that its internal reasoning models had refuted the Exponential Time Hypothesis, mathematician Levent Alpoge surfaced an Anthropic GitHub repository containing an independent paper and complete Lean 4 formalization proving the exact same landmark complexity result. The paper, titled A 2^o(n) Time Algorithm for 3SAT and authored by Claude at Anthropic, states that the core algorithm was discovered on October 16 by an internal Claude research model using 14 million output tokens and zero human input, after which Anthropic researchers worked with Claude to refine the mathematical presentation.

According to the repository documentation and the paper abstract highlighted by Andrew Curran, Anthropic's deterministic algorithm actually solves the harder counting problem #3SAT, computing the exact number of satisfying assignments for an n variable formula in subexponential time 2^O(n log log n / sqrt(log n)). The proof reduces 3SAT to contracting tensor networks on a complete graph K_K with lambda bits per edge, placing nodes on a grid where rectangle diagonals form a swap operator decomposed into singlets so row rank times column rank stays bounded by 12^lambda.

Unlike traditional preprints that rely solely on human peer review, Anthropic pinned the entire proof to Lean v4.33.1 and Mathlib v4.33.1 on Turing machines, verifying both ETHIsFalse and MainTheorem using only Lean's three standard axioms and rechecking the proof with the independent Comparator and nanoda kernel. Anthropic also published a single paragraph condensed prompt from which Claude Opus 5.5 at high effort can independently rederive the core subexponential 3SAT decision bound, while noting that the asymptotic result does not affect practical SAT solvers.

Because Anthropic's proof compiles in roughly eight minutes on 24 virtual CPUs in Lean 4 and passes an independent nanoda kernel check, theoretical computer scientists can immediately focus on verifying the short Turing machine specification in MainResults.lean rather than auditing dozens of pages of prose for subtle logical gaps. The simultaneous discovery by both OpenAI and Anthropic within days of each other will force mathematics and theoretical computer science journals to establish new norms for simultaneous AI theorem attribution and machine checked publication.

Known as the Enormous Theorem, the Classification of Finite Simple Groups establishes that every finite simple group belongs to three infinite families or 26 sporadic groups including the Monster group, with the original proof spanning roughly 15,000 pages across more than 500 papers written by over 100 mathematicians. Because of its vast dispersion across decades of literature, gaps such as the quasithin case took decades to close and the multi volume second generation revision remains incomplete.

On October 27, Axiom Math announced the first complete computer verified formalization of the Classification of Finite Simple Groups in the Lean proof assistant. Starting on October 1 with an internal proof map that divided the first generation classification proof into 108 milestones and roughly 380 tasks, Axiom engineers and mathematicians directed swarms of over 150 concurrent AxiomProver AI agents across 24 days, generating 2.0 million commits, 3,579 verified sub milestones, and approximately 43.1 million lines of Lean code.

To prevent Lean build times from bottlenecking the swarm, Axiom built a distributed build cache and externalized heavy finite group calculations into independently checkable certificates. By October 10, the agent swarm proved that the Monster group is simple via the 196,884 dimensional Griess algebra, and on October 13 engineers ran an automated replanning pass that decomposed remaining coarse milestones into fine grained theorems.

Translating 15,000 pages of dense prose into Lean exposed numerous typographical errors, dropped hypotheses, and 34 substantive deviations from the published mathematical record. In Michael Aschbacher and Stephen Smith's quasithin volumes, agents discovered a counterexample involving SL2(5) where a lemma asserted two quantities were equal when one was 1 and the other was 2, requiring a revised case split. More dramatically, while formalizing John Walter's 1986 memoir on the Unbalanced Group Theorem, agents found an explicit counterexample using the field involution of PSL2(49) whose centralizer PGL2(7) has simple component PSL2(7), a Mersenne prime case excluded from Walter's family. Working with classification pioneers Richard Lyons and Ronald Solomon, AxiomProver proved and formalized a brand new group theory result, Theorem 2.3 on preservation of simple tops, to complete the Unbalanced Group Theorem and close the full classification without unproved assumptions.

Axiom is publishing a comprehensive errata database alongside its Unbalanced Group Theorem repair paper in consultation with an advisory board including Richard Lyons, Ronald Solomon, and Dan Nakano so group theorists can inspect every corrected lemma. Beyond algebra, coordinating more than 150 agents across a 43 million line formally verified repository provides a blueprint for autonomous software verification where compiler kernels enforce global mathematical consistency across massive codebases.

On October 25, Meta began rolling out real time voice calling and shareable avatars on its consumer Muse AI agent app, followed on October 26 by reports that Meta plans to raise up to 95 billion dollars in stock offerings backed by Nvidia, AMD, and Broadcom to fund AI infrastructure. At GTC Berlin on October 26, Nvidia CEO Jensen Huang also highlighted the Nvidia Agent Toolkit and OpenShell runtime for enterprise AI factories.

Early on October 27, Nvidia and Meta announced a multi layered expansion of their engineering and infrastructure partnership centered on Meta's Muse family of frontier models and consumer AI agents. According to the official Nvidia Newsroom release, the two companies are collaborating on workflow optimizations across both training and inference to maximize throughput per watt and lower total cost of ownership as consumer downloads and usage of the Muse agent app surge.

On the software and safety side, Meta and Nvidia are evaluating the Nvidia OpenShell Reference Architecture, including Nvidia OpenShell for sandboxed AI agent deployment and Nvidia Sentry for monitoring agent behavior and processing structured, unstructured, and graph data. On the hardware side, Meta plans to expand its deployments of Nvidia Vera Rubin systems and standalone Vera CPUs to power next generation AI agents, interconnected with Nvidia Spectrum X Ethernet networking and BlueField 4 data processing units.

Alongside the technical roadmap, Nvidia formally confirmed in the press release that it will invest 3 billion dollars in Meta's equity offering. Nvidia CEO Jensen Huang stated that intelligent agents represent a new computing paradigm shifting users from operating applications to delegating work to autonomous software, while Meta CEO Mark Zuckerberg described Muse as the vehicle for bringing personal superintelligence to billions of people.

Meta's evaluation of Nvidia OpenShell and Nvidia Sentry for its flagship Muse agent platform gives major validation to Jensen Huang's push to monetize Nvidia's enterprise agent software stack alongside its GPUs. Watch for details on how Meta balances Vera Rubin and Spectrum X clusters against its parallel custom silicon and AMD commitments as it deploys the proceeds of its massive capital raise.

South Korean memory leaders Samsung Electronics and SK hynix have been aggressively reallocating cleanroom and wafer fabrication capacity toward high bandwidth memory, including 8 high HBM4 scheduled for mass production in the second quarter of 2027. At the same time, surging demand from agentic AI servers and physical AI systems has tightened global supply projections for conventional DDR5 and LPDDR5 DRAM.

On October 27, semiconductor analyst Jukan reported citing South Korean industry media that China's largest cloud service providers, including Alibaba, Tencent, and ByteDance, have approached Samsung Electronics and SK hynix to request long term supply agreements for server memory. While long term memory contracts in the data center industry typically span three to five years, some of the Chinese hyperscalers are reportedly seeking ultra long term agreements that guarantee memory allocations for 10 years running all the way through 2035.

According to the report, the requested multi year supply agreements specifically cover standard DDR5 and low power LPDDR5 server memory modules rather than restricted high bandwidth memory stacks. While US export controls restrict advanced HBM shipments to China, DDR5 and LPDDR5 remain critical for high capacity CPU host memory, Mixture of Experts parameter offloading, key value cache storage, and domestic AI accelerator clusters run by Alibaba Cloud, Tencent Cloud, and ByteDance's Volcano Engine.

The push for decade long contracts reflects growing concern among hyperscale procurement teams that Samsung and SK hynix will continue dedicating new fabrication lines and capital expenditure to HBM4 and custom AI memory for US tech giants, leaving conventional server DRAM chronically undersupplied through the late 2020s and early 2030s.

Samsung Electronics and SK hynix hold extraordinary pricing leverage in negotiations over multi year DDR5 and LPDDR5 server memory commitments and are unlikely to lock in fixed pricing through 2035 without substantial customer prepayments or periodic volume price escalators. Watch whether South Korean memory makers sign binding decade long allocation frameworks with Chinese cloud providers or prioritize flexible spot pricing and US hyperscale capacity.