Sunday, 02 August 2026
OpenAI's Astra solves ten decade-stalled math problems for under $2,000 each; a soundness crack in Lean's trusted kernel was patched days before those proofs landed on it; and three AI open letters expose the game-theoretic trap at the heart of frontier development restraint
Today's Lead
EngineeringSimon Willison
OpenAI's Astra Solves Ten Decade-Old Mathematical Problems for Under $2,000 Each
The raw numbers are striking: an internal version of OpenAI's next major model (code-named Astra) solved ten mathematical problems that had seen no progress for over a decade, spending less than $2,000 at Sol API prices on each. The results were formalized in Lean 4 and released on GitHub alongside research papers and an LLM-generated reconstruction of reasoning traces — a level of transparency that simultaneously demonstrates the result and exposes its limits, since the actual prompts used are not published. The mathematical community is experiencing what many observers are calling a 'Deep Blue moment' — the grief-adjacent recognition that something previously considered distinctively human has been accomplished by machinery at far lower cost than anticipated. Mathematician Kirwin Hampshire had already described a 'profound spiritual crisis' in response to earlier (and less significant) results; OpenAI's announcement has deepened that response. Terence Tao's framing of 'big mathematics' — decentralized human-AI collaboration where machines handle the technical grunt work and humans claim the creative parts — offers a more pragmatic map for the field's future. Two things warrant close attention: whether these proofs survive independent mathematical review (the Lean 4 formalizations help but don't replace community scrutiny), and whether the cost asymmetry — $2,000 per decade-old problem versus years of human labor — shifts how mathematical institutions fund and organize research going forward.
Leonardo de Moura
Postmortem for Lean Kernel Soundness Bug #14576
A soundness vulnerability in the Lean 4 kernel — the trusted core of the proof assistant — allowed fabrication of false proofs through a flaw in how phantom type parameters were handled in nested inductive types. The mechanism required direct kernel-level metaprogramming access, placing it outside the reach of normal Lean code, but the stakes of any kernel soundness failure are categorical: if the trusted kernel can be made to accept a false proof, the entire chain of formal guarantees built on that kernel becomes suspect. The one-hour patch time from disclosure to fix is operationally impressive; the structural takeaway is more sobering. The kernel hardening that followed the fix, plus discovery of additional vulnerabilities through subsequent cybersecurity collaboration, suggests the bug was not isolated but symptomatic of a broader attack surface that had received insufficient adversarial scrutiny. Lean's architecture places enormous trust in a small verified core, and the postmortem reveals that even formally-designed trust boundaries require adversarial red-teaming — the same bootstrapping problem that haunts all safety-critical software. The juxtaposition with OpenAI's ten mathematical advances is sharp: the ground on which those Lean 4 proofs stand had a soundness crack that was patched just days before the proofs were released onto it.
Read →Michael Geist
A Surveillance Treaty in Disguise: Canada Signs UN Cybercrime Convention
Canada's quiet signing of the UN Cybercrime Convention drew immediate opposition from more than twenty domestic organizations including Amnesty International Canada, but the government proceeded without parliamentary debate. Michael Geist's critique identifies the structural problem: the convention is marketed as a child protection measure but functions as a cross-border surveillance and evidence-sharing architecture. The key mechanisms are the absence of requirements for judicial authorization in evidence requests, and a 'serious crime' threshold set at any offense carrying four or more years — a definition broad enough to encompass journalism, political dissent, and LGBTQ+ expression in authoritarian co-signatory states. The convention thus converts liberal democracies into infrastructure for authoritarian enforcement by design rather than by accident: any signatory must respond to evidence requests from any other signatory, and the treaty provides no screening mechanism for requests targeting political rather than criminal behavior. The pattern recurs in international technical governance more broadly: standards and treaties whose stated purpose is narrowly technical embed enforcement mechanisms with far wider application, and the scrutiny applied at signing rarely matches the downstream consequences.
Read →The NetBSD Foundation
NetBSD 11.0 Released With Three Open Security Vulnerabilities
NetBSD 11.0 released after a protracted delay with an unusual acknowledgment: three security vulnerabilities discovered through AI-assisted analysis remained unpatched at release, and the team decided that continued delay carried more risk than shipping with known-but-disclosed issues. The decision reflects a genuine tension in security release management — holding a release until all known vulnerabilities are fixed can itself create exposure if the existing release is more vulnerable, and AI tooling is now surfacing vulnerabilities faster than small open-source teams can respond. The release supports multiple architectures including ARM devices; version 11.1 is targeted approximately two months out. The structural story here is about how AI security analysis tools are changing the economics of vulnerability discovery for projects that historically could not afford dedicated security review: a change that benefits defenders and raises the bar, but also accelerates the disclosure-response cycle in ways that can outpace small maintainer teams.
Read →VictoriaMetrics
Go 1.27 advances on several fronts simultaneously. The most structurally significant change is generic methods with independent type parameters — a feature the language resisted for years on complexity grounds — which closes a long-standing expressiveness gap between Go's generics and those in other statically-typed languages. Runtime gains are concrete: up to 30% improvement in small allocation performance. Post-quantum cryptography arrives as a standard library concern through the `crypto/mldsa` package implementing ML-DSA signatures, marking Go's first steps toward quantum-resistant defaults that other languages are also beginning to make mandatory. The `testing/synctest` package addresses one of the persistent difficulties in testing concurrent Go code, and goroutine debugging improvements — labels and leak detection — make long-running service instrumentation meaningfully easier. The trajectory continues Go's evolution from a minimalist systems language toward one with enough expressive power to handle the full complexity of production distributed systems without unsafe or exotic patterns.
Read →tssm.neocities.org
What Naur Got Wrong from The Concept of Mind
Peter Naur's 1985 'Programming as Theory Building' is among the most cited papers in software engineering, but this close reading argues Naur fundamentally misread his own philosophical source — Gilbert Ryle's 'The Concept of Mind.' Naur borrowed Ryle's distinction between knowing-how and knowing-that to argue that programming knowledge is inherently tacit and irreducibly personal, and therefore that program comprehension from documentation is 'strictly impossible' — that the mental theory built by a program's original creators cannot be recovered by later readers from code or documents alone. The author's critique is that Naur conflated Ryle's categories: knowing-how and knowing-that are both articulable in principle, the difference being a matter of expression and context rather than fundamental communicability. If that's right, Naur's strong impossibility claim fails, and code itself can function as a medium for theory transfer. The intervention lands differently in 2026 than it might have a decade ago: if LLMs can read code and reconstruct the theory behind it with meaningful fidelity, the 'strictly impossible' claim becomes directly testable, and the field's received wisdom about tacit knowledge in software may need revision.
Read →Spillhistorie
Norway's First Adventure Games: Colossal Cave Meets Scandinavian Mythology, 1979
In 1979, computer science students at Norway's Institute of Technology — members of a self-named hacker club called Studio-54 — expanded Colossal Cave Adventure into SVHA Adventure, adding nearly 70 new rooms, Scandinavian mythology, and novel mechanics including NPC combat not present in the original. What makes the history interesting is not the game itself but the institutional context: Nordic universities in the late 1970s and early 1980s were unusually active in porting and extending Adventure across different minicomputer architectures, treating the game not as a product to consume but as a substrate to modify — a pattern that prefigures open-source culture by more than a decade. The preservation story is instructive too: recovery required working around damaged 8-inch disks, and significant effort went into reconstructing software that was never designed to survive. The article is part of the broader digital archaeology project at spillhistorie.no, and its reappearance on Lobsters in 2026 likely reflects renewed interest in the history of early personal computing as that generation of machines and practitioners moves beyond living memory.
Read →