← Airing’s reading streamIssue 003简体中文 ↗
NO. 0032026.10.04—10.10

AI Trends Weekly

Every Monday · Understand what is changing

Airing’s bear examining mathematical manuscripts with a magnifying glass and pencil; AI concept illustration

COVER STORY · PROGRESS & RESISTANCE

OpenAI

After the
manuscripts

How will researchers work with AI?
The bear’s study · AI illustration

AGENT ENGINEERINGContext, cache and recovery

RESEARCH & TOOLSDream-RSI · 10 tools

AIRING’S READING DESK

003

AI produces manuscripts at scale.
How do people and machines collaborate?

OpenAI released more than 700 AI-generated mathematics manuscripts, followed by corrections, withdrawals and calls for a boycott. This issue follows what happened, what AI contributed, and the possibilities for collaboration.

Editor
Airing ↗
Reading period
2026.10.04 — 2026.10.10
Publication date
2026.10.13 Every Monday
Inside
28 saves · 5 themes5 features · 10 products · 11 briefs

EDITOR’S GUIDE

Begin with the mathematics debate, then examine how agents retain context, recover interrupted work, learn from experiments and organize collaboration. Product launches have their own concise shelf.

From Airing’s reading streamReadings, supporting references and image credits included.

01

AI and mathematics

Breakthroughs, resistance and research roles

COVER STORY

AI released 700-plus manuscripts. Why are mathematicians divided?

On October 6, OpenAI released mathematical research generated by an internal model. Some saw an acceleration of discovery; others called for a boycott. What lies behind these different responses?

The bear reads machine-produced manuscripts at a mathematics desk, with matrix sketches and a magnifying glass.
The bear’s reading desk · AI concept illustration

Our lead reading is Kazike’s essay on AI’s transformation of mathematics, alongside APPSO’s reporting and mathematicians’ original statements. Start with the event, then follow what changes in research.

What happened on October 6?

On October 6, OpenAI published openai/math, a GitHub collection of mathematical manuscripts and proof artifacts generated by an unreleased internal model. Existing mathematics evaluations had become less informative, so the company expanded evaluation to open research problems. The significant change is what the model was being asked to produce: arguments about unresolved questions, beyond answers to established exercises.

A manuscript is a research draft. It states a claim and its assumptions, then presents an argument. Public release allows scrutiny and follow-up work; it is not the same as completed peer review. The collection includes materials at different verification stages, and several documents can belong to one result: companion arguments, consequences or alternative proofs.

BACKGROUND / THE RELEASE AND RESPONSE

First, put the release in context
  1. Concerns predate the release

    AGMAI, an independent advisory group, publishes advice on autonomy and assimilation.

  2. OpenAI releases manuscripts

    An internal model attempts open problems; materials are released for scrutiny.

  3. Corrections and public opposition

    Three withdrawals are recorded; the Association for Human Mathematics (AHM) calls for a boycott.

Initial release722− 3 withdrawn719remaining manuscripts

The 719 manuscripts cover 372 problem families; one family can contain multiple manuscripts.

300 / 719manuscripts have formalized top-line results, about 42%
300 formalized419 without this record

Counts use the repository version checked for this issue. Manuscripts, distinct problems and peer-reviewed papers are different units; absence of formalization does not mean a result is false.

Prominent examples concern the Riemann zeta function, connected to the distribution of prime numbers; faster matrix multiplication; and a four-dimensional Kakeya problem. Readers need not master the details to see the significance. AI is attempting questions researchers have pursued, producing arguments that can be examined beyond how convincingly they read.

Corrections followed release. The initial 722 manuscripts became 719 after three withdrawals; the version used here groups them into 372 result families. Optimists see the scale of machine exploration. Cautious readers see a large body of material still requiring scrutiny. The dispute begins with both observations being possible at once.

What do the three mathematical results actually claim?Optional background · scope, diagrams and manuscripts

For more background on these three problems, start with the diagrams below. They explain the reported claims and their scope; follow the originals for the full proofs.

Quasi-Riemann: a fixed zero-free boundary

The main manuscript reports a zero-free region to the right of 7/8, with an 11/12 companion proof. Neither settles the full Riemann hypothesis. The case illustrates traceable research arguments, whose validity still depends on scrutiny of their exact statements and proofs.

01 / A BOUNDARY IN THE COMPLEX PLANE

7/8 moves the boundary left, but does not reach 1/2
01/217/8σt

s = σ + it. Horizontal: real part. Vertical: imaginary part, with no height bound. No zeros are sampled here.

1/2
The Riemann targetAll nontrivial zeros of ζ(s) lie on this line.
7/8
The primary proof’s fixed boundClaims no zeros for Re(s) > 7/8; the pole at s=1 for principal functions is handled separately.
11/12
The alternative proof’s boundSame result family, a bound further to the right. Keep the constants of the two proofs separate.

Matrix multiplication: an exponent bound, not training speed

The manuscript reports an exponent bound of 9/4 over complex numbers with an arbitrary positive epsilon. The illustration compares asymptotic leading growth, not measured acceleration of a GPU or model.

02 / COMPUTATION GROWTH

Change the multiplication algorithm, not just one cell
a₁₁a₁₂a₂₁a₂₂
b₁₁b₁₂b₂₁b₂₂
c₁₁c₁₂c₂₁c₂₂

c₁₁ = a₁₁b₁₁ + a₁₂b₂₁

Four output cells need eight scalar multiplications by the naive method. Strassen reorganizes block multiplication into seven and recurses.

Double the matrix side: how much does leading work grow?
Naive multiplicationω = 3
8×
Strassenω = log₂ 7 ≈ 2.807
7×
Reported boundω = 9/4 = 2.25
≈ 4.76×

Editorial asymptotic illustration comparing 2^ω, omitting constants and epsilon. Not measured speed or a claim about small matrices.

Original manuscript / The scope of theorem 1.1
Enlarge ↗
Manuscript introduction and theorem 1.1 with complex matrices, arbitrary positive epsilon and scalar arithmetic operations.
Introduction definition and complete theorem from page 1 of An Upper Bound of 9/4 for the Matrix Multiplication Exponent. This is no real-machine performance test. Source and context ↗
Section referencesMatrix manuscript ↗

Four-dimensional Kakeya: dimension and volume differ

The manuscript claims full Hausdorff dimension for a set containing a unit segment in every direction in four dimensions. The two-dimensional sketch is an introduction, not the proof or a claim of positive volume.

03 / DIRECTIONS AND DIMENSION

Every direction imposes a condition on the whole set

Two-dimensional illustration. Segments may translate independently, without sharing a center. This does not depict a four-dimensional proof.

Dimension asks how spatial complexity grows at finer scales
0Point
1Segment
2Square

R⁴ → dimH = 4The four-dimensional claim: a unit segment in every direction forces Hausdorff dimension four.

Intuitive dimension examples. Full Hausdorff dimension does not imply positive volume; keep the quantities distinct.

Why this matters: AI is contributing paths into research

Earlier discussions of AI mathematics often centered on solving exercises with known answers or translating a human proof into a machine-checkable language. An open problem has no ready answer key. A system must find a viable argument, navigate obstacles and present something others can examine. Valid contributions to that process constitute research progress regardless of their machine origin.

Kazike’s most useful argument connects progress to the speed of feedback. Where results can be checked quickly, AI can attempt a route, encounter failure and try again. More directions become accessible within a given period. Mathematics and code attract attention partly because some outputs can be connected to automatic checks.

CAPABILITY / A RESEARCH PATH

Follow a research path to see what AI contributes
START
An unsolved problem

Prior work, definitions and constraints

TOWARD SHARED KNOWLEDGE
  • Check the derivation
  • Establish its relation to prior work
  • Make it understandable and reusable

Counterexamples, checks and new understanding reshape the next attempt.

Process schematic; A/B/C are not measured branch counts. AI can help explore, verify and explain. The diagram does not prescribe a permanent human–AI division of work.

A missing step still matters: finding an argument, formalizing it and confirming that it addresses the intended problem are different jobs. The collection is the output of an evaluation and preparation process. The model contributed arguments; problem selection, earlier literature, checking tools and selection for release also shaped the result.

The prospect is larger than finishing one problem faster. Researchers could explore routes they previously lacked time to pursue, compare alternatives and extract useful methods. That is a substantive expansion of working capacity. A selected collection of successes, however, does not establish a general success rate for an arbitrary new research question.

What are the objections actually about?

The saved APPSO article brings another side into view: errors in the manuscripts, the release process and researchers’ concerns about their future roles. Its tension with Kazike’s essay is useful. One emphasizes consequences for the mathematical community; the other emphasizes the possibilities opened by AI capability. Neither is fully represented by its headline.

Two organizations matter. The Association for Human Mathematics, AHM, called on October 7 for mathematicians to discontinue work with OpenAI. It questioned whether this release model advances understanding. The Advisory Group on Mathematics and Artificial Intelligence, AGMAI, is an independent group of scholars. It too objects to frontier research testing on inaccessible proprietary models, but continues discussions with labs and recommends better release practices and support for understanding.

DEBATE / THE DIFFERENT CLAIMS

One release, three different concerns
OpenAI

Manuscript publisher

Central claimEvaluate an internal model on unsolved mathematical problems.

ActionRelease manuscripts and some research traces for outside scrutiny.

AHM

Association for Human Mathematics

Central claimProducing proofs in bulk is not the same as developing shared mathematical understanding.

ActionCalls for an end to collaboration with OpenAI and for research centered on human understanding.

AGMAI

Advisory Group on Mathematics and AI

Central claimAccess, research autonomy and the community’s capacity to assimilate results belong in the evaluation.

ActionRecommends stopping advanced-math testing on proprietary models and funding community assimilation through independent institutions.

Paraphrased from primary statements. AGMAI’s advice is not an endorsement; Tao’s hosting of AHM’s guest article does not make it a statement for all mathematicians.

“Mathematicians boycott AI” collapses these positions. Tao’s blog hosted an AHM-authored guest statement; that does not establish that he led its authorship. AGMAI’s advisory work is not an endorsement of the collection. The useful questions are who is speaking, what practice they object to and what they propose.

The withdrawals reported by APPSO are a real quality concern and should affect trust in unchecked material. They do not show that every result is false. Conversely, a valid proof does not settle every question about publication and collaboration. The common ground is that technical change is already affecting research work; the terms for evaluating and sharing that change remain contested.

Why doesn’t Lean settle the dispute?

Think of Lean as a language for stating mathematical definitions, claims and proofs precisely. Its proof kernel checks whether an argument follows the rules under its stated assumptions. This gives readers a way to check corresponding artifacts beyond trusting an author’s assertion.

But a successful check concerns the statement actually encoded. Consider a simple example: someone intends to prove that every integer has a positive square, but adds “the integer is nonzero” in the formal statement. The revised claim is true; the original fails at zero. The checker has not malfunctioned. The task changed. Research-level differences can be much subtler, so the original question, manuscript and formal statement must still be matched.

WORKED EXAMPLE / CHECK THE STATEMENT

An extra condition can make the proof work—and change the question
INTENDED STATEMENT

∀ n ∈ ℤ, n² > 0

Every integer has a positive square.

n = 0 → 0² = 0One counterexample disproves it.
ADDED DURING TRANSLATION

∀ n ∈ ℤ, n ≠ 0 ⇒ n² > 0

Every nonzero integer has a positive square.

This statement is trueBut it excludes n = 0 from the original claim.
Valid derivation?Same statement?Novel result?Useful method?

An introductory example, not an error found in these manuscripts, Lean code or an executed checker result. Formal verification checks the encoded claim; fidelity to the intended question still needs scrutiny.

Correctness also leaves other questions open. An argument may rediscover a known result, or provide little explanation of its method. Kazike is right to draw attention to fast feedback as an accelerator. Treating the entire cost of research assessment as the cost of one check, however, leaves out literature review, explanation and application. Formalization coverage also needs an explicit scope.

These jobs need not remain exclusively human. A Lean kernel postmortem records AI-assisted bug finding, and models can also assist literature search, statement comparison and counterexample discovery. The promising technical direction improves generation and scrutiny together, producing reasons for trust that another researcher can reuse.

If proofs become cheaper, who supports understanding?

Imagine a doctoral student planning several months of work who discovers that AI has released a possible proof of the same problem. That may be good news for the field, while requiring a major change to the student’s project. They must check the result, then choose whether to change direction, extend it or learn its method. Receiving an answer and developing research ability happen on different timescales.

This illustrates why “more results must be better” does not end the argument. Explanations, discussion and use carry results into other people’s work. When output grows faster than the ability to assimilate it, attention shifts toward selection and understanding. Which results deserve attention first? Who explains them? How is that labor supported and recognized?

ACCESS / WHAT REACHES THE COMMUNITY?

Access to results and access to research tools are different opportunities
RESULTS ONLY
Internal modelPublic manuscriptsReaders assimilate

Readers can inspect outputs without necessarily being able to initiate comparable research.

ADD THE MEANS TO PARTICIPATE
Independent questionsAccessible toolsShared explanations

Tools, resources and recognition support question-setting, understanding and training new researchers.

An editorial comparison of research conditions, not a quantitative measure of access or cost.

AGMAI proposes that labs support the assimilation of substantial output that is not yet well understood, with established nonprofit academic institutions directing funding decisions. Workshops, sustained working groups and exposition can help turn a released answer into usable knowledge.

Access raises a further question. A public proof lets others examine a result; accessible research tools let them pursue their own questions. Both matter in different ways. The worrying scenario concentrates agenda-setting and discovery inside a few labs, leaving others primarily to receive outputs. The preferable one expands the number of researchers able to explore directions of their own choosing.

Will this follow the earlier resistance to AI in art?

The comparison is understandable. A profession built around difficult skills encounters automation at scale; excitement coexists with concern about work and value. Artists and mathematicians can share that experience. But “there was resistance” is not enough to establish the analogy. We must ask what was contested and whether those conditions subsequently changed.

A closer mathematical precedent is Appel and Haken’s 1976 computer-assisted proof of the four-color theorem: four colors suffice for a planar map when regions sharing a boundary must differ. Extensive computation raised questions about both reliability and understanding. Thurston still used the example in 1994 to discuss mathematical understanding. A formal proof completed in 2005 strengthened the basis for checking. New mechanisms of trust developed without eliminating the desire for insight.

HISTORY / WHAT ACTUALLY CHANGED?

Historical changes involve verification and the terms of cooperation
Mathematics: how do we trust a machine-assisted proof?
  1. Computer-assisted proof

    The four-color proof relies on extensive computation, raising questions of reliability and understanding.

  2. Understanding matters

    Thurston discusses how proof communicates understanding among mathematicians.

  3. Formal verification

    Gonthier’s formal proof supplies a further machine-checkable foundation.

Later work adds ways to verify while keeping understanding in view.

What differs todayToday AI also generates research arguments. Output scale, proprietary tools and access to research add further issues.

Creative work: whose work trained the model?
  1. Opposition to unlicensed training

    Creators’ statement focuses on permission to use their work and threats to livelihoods.

  2. Some partnerships negotiate terms

    WMG and Suno announce licensed collaboration with a creator opt-in framework.

Adoption can coexist with negotiation over permission, pay and choice.

What differs todayOne partnership does not establish universal benefit. Artistic value also lacks a theorem’s true-or-false test.

Sources: Thurston, Gonthier, the 2024 training statement and WMG’s announcement. Events are ordered, not drawn to time scale or as an inevitable sequence.

In the arts, the 2024 AI training statement objected to unlicensed use of creative works and its effect on livelihoods. Its claim was not simply that machines could never produce good art. Warner Music Group and Suno’s 2025 partnership announcement emphasized licensing and creator choice. It illustrates that adoption and negotiation can coexist. It does not establish that all artists benefited or that earlier objections became groundless.

Mathematical truth has checking methods unlike judgments of artistic value. Today’s AI also generates research arguments, reaching beyond earlier computer-assisted computation. The useful lesson is therefore a concrete institutional adaptation, rather than inevitable surrender: checkable proofs, accessible tools, explicit credit and sustainable training can turn concerns into better terms of use.

How can collaboration go beyond generating and reviewing proofs?

Imagining AI writing proofs and people reviewing them overlooks the cycle of research. Proofs suggest new questions; failed routes can leave useful methods. Models may help ask questions and explain arguments as well as solve them. A permanent boundary in which humans supply meaning and machines execute is therefore an uncertain foundation.

A more constructive relationship begins with an actual task. A researcher identifies something they want to understand; a model suggests possible routes. Examples, counterexamples and literature help eliminate unsuitable paths. Once an argument develops, its key ideas and checking materials are prepared for others to use. AI can participate throughout, while contributions remain open to questioning.

RELATIONSHIP / KEEP THE LOOP OPEN

Results should feed the next round of research
  1. 01
    Frame a worthwhile question

    People and AI propose candidates and explain why they matter.

  2. 02
    Develop arguments and counterexamples

    Explore lemmas, examples and alternative proof routes.

  3. 03
    Check and explain the contribution

    Check derivations, intended statements, prior work and scope.

  4. 04
    Make further research possible

    Share explanations, tools and failed approaches to enable new questions.

Understanding, tools and developed expertise become the starting point for new questions.

A proposed practice in which people and AI participate across stages. Access, research resources and academic incentives matter alongside model capability.

Students particularly need opportunities to develop judgment. I would allow model assistance with background and alternatives, while asking students to explain assumptions, identify a failed example and reason again when conditions change. That distinguishes obtaining a proof from learning to conduct research. Sanderson’s argument for recognizing explanatory work and Lozano-Robledo’s discussion of students both direct attention toward developing that capacity.

Academic incentives must support it. If recognition depends only on new-result counts, clear exposition, proof organization and teaching methods become under-rewarded support work. Better tools should increase the value of those activities too. Otherwise a larger volume of results can coexist with fewer opportunities for researchers to develop independently.

Beyond solving problems: building a shared practice of research

Kazike’s essay is the lead recommendation because it makes a consequential shift visible: AI is extending from assistance with reading and exercises into the production of research. That warrants both excitement and specific verification. APPSO and the original statements supply another part of the story: discussion, access and transferable methods help new results expand a field’s capabilities.

I would neither dismiss the dispute as wounded professional pride nor conclude that AI should stay out of research. Continued collaboration is more promising, with explanation, scrutiny and support built into release practices. Machines can contribute ideas; researchers need the means to examine, alter and build on them.

The next evidence to watch is independent scrutiny, follow-on research and access for students and researchers beyond the labs. Those developments will reveal whether the release mainly adds documents or expands usable knowledge. The remaining features pursue a related question: how capabilities become sustained work whose steps can be inspected and understood.

02

Agents taking on work

Memory choices and responsibility for actions

FEATURE

Why can an agent forget a request from two hours ago?

Two Pi engineering articles examine limited working context and the cost of repeatedly processing conversation history.

A long coding conversation can retain its messages and files while the agent loses track of an earlier constraint. Understanding why starts with the input to its next model request.

Compaction is a handoff that can lose information

Pi is a coding agent that reads files, changes code and calls tools. Its next model request includes instructions, tool definitions and a growing record of conversation and execution. The context window—the input a model can handle at once—is finite. A chat application can save more history than the model sees on any particular turn.

Pi summarizes older material while retaining recent messages, then continues with a shorter input. This is compaction. Think of a shift handoff: a brief carries goals, progress and key decisions, while original records remain available for details. The working input changes; the model’s parameters are not retrained.

COMPACTION / WHAT SURVIVES?

How does a summary lose half of a request?
ORIGINAL REQUEST

“Make this a bilingual Chinese–English issue and show me a preview first.”

LOSSY SUMMARY

Prepare a weekly issue.

  • Task retained
  • Bilingual requirement: lost
  • Preview first: lost
USEFUL HANDOFF

Prepare both languages; deliver a preview next.

  • Goal and languages retained
  • Delivery order retained
  • Keep draft location and remaining work

Editorial task example, not measured Pi output. Judge a summary by whether work can continue correctly, as well as by its length.

Consider an editorial example. A user asks for Chinese and English versions of a weekly issue, initially as a preview. Hours later the summary says only “finish the issue page.” The Chinese page may be completed while the second language and preview scope disappear from working memory. Subsequent reasoning now starts from an incomplete task description.

Useful compression preserves what determines the next action: unfinished requirements, the basis for conclusions and unresolved questions. The shortest summary is not necessarily the best. Access to original records makes it possible to discover and correct a poor handoff.

Why can a short “continue” be expensive?

A second problem is repeated work. Each request can contain a long stretch of old input with only a few new sentences. Prompt caching reuses attention state computed for an identical beginning, reducing recomputation. This is reuse of computational work, not an additional store of trustworthy facts.

The identical beginning is crucial. If a request contains instructions, tool definitions and history, appending a message may preserve reusable computation. Changing a tool definition in the middle changes the prefix for all later history, even if those later words stay the same. The diagram marks that boundary.

PREFIX / EXACT TOKENS MATTER

Reuse starts at the beginning and stops at the first change
Previous
RulesToolsHistoryComputed
Append
RulesToolsHistoryNew input
Edit tool
RulesEdited toolsHistoryNew input
Green: identical, reusable prefixDashed: continuation requiring new computation

Retention, hits and routing depend on the provider. Blocks are not token-proportional. Equivalent meaning does not guarantee identical tokens.

Compaction therefore trades a shorter working input against a rewritten prefix. The first request after compaction needs to establish the changed continuation again. Frequent edits need not save money, while retaining everything consumes context. Decisions need to account for information quality, remaining work and the provider’s actual retention behavior.

Count rework alongside input savings

An illustrative bill makes the distinction concrete. Start with 80k old tokens and 4k new tokens. If cached reads cost one tenth of ordinary input, a hit costs the equivalent of 12k ordinary-input tokens; a miss costs 84k. Both requests contain 84k actual tokens. The difference is billing and recomputation, not that the model suddenly sees seventy thousand fewer tokens.

COST / AN ILLUSTRATIVE REQUEST

The same 84k input, with and without a cache hit

Assume an 80k stable prefix + 4k new input; cache reads cost 0.1 of ordinary input.

Hit
12k
Miss
84k

80k × 0.1 + 4k = 12k

80k + 4k = 84k

Unit: equivalent billing volume at the ordinary input price, not actual token count. Illustrative only; cache writing, output, storage and rebuilding costs are excluded. Not a current vendor quote.

Cache-hit rate is not the final outcome. If a summary drops the English edition, inexpensive subsequent requests still leave translation, review and user waiting to be paid for. A better summary may incur additional computation now while avoiding later rework.

I would assess long-running memory by whether it preserves the goal, revises judgments when evidence changes and retains access to their basis. Caching helps make that work affordable. The quality of the handoff determines whether computation still serves the right task.

FEATURE

Can an agent resume after crashing halfway through a task?

Pi Durable persists work for long-running agents. The difficult case arises when an external action has happened but its result has not yet been recorded.

An interrupted conversation can be restarted. A half-finished deployment, write or email cannot always be repeated. This week’s saved technical manual shows why.

Pi is a coding tool; Durable is an execution framework

On October 1, Earendil released the Pi 1.0 coding agent alongside an experimental package, Pi Durable. The former is a terminal tool used by a person; the latter is a framework for developers building long-running agent applications. It stores conversations, tool calls and unfinished tasks so another process can reopen existing work.

That matters because a model often chooses the next action from its current record. It needs established facts about completed actions and confirmed outcomes, rather than only “the process stopped; continue.” Persistence keeps those facts outside the model and available after a restart.

Manual source plate / Two recovery paths after kill -9
Enlarge ↗
Pi Durable 1.0.3 interruption capture: two conversations share SQLite; unsafe deployment returns interrupted, while safe report retrieval reruns. The axis is commit sequence.
Complete Plate I, legend and record details selected from the manual cover. Reopening at sequence 28 is inferred; the axis does not measure milliseconds. Source and context ↗

The manual demonstrates a forcibly terminated process with report retrieval marked safe and deployment marked unsafe. Reopening the store can replay retrieval, while deployment returns interruption information for subsequent handling. Here safe and unsafe describe replay semantics, not whether the tools are inherently good or bad.

An email exposes the difficult gap

Suppose an agent requests an email notification. The mail service accepts it, but the local process crashes before saving the receipt. After restart, the absence of a success record does not show that nothing was sent. Retrying can duplicate a message; skipping can lose a genuinely failed request.

COMMIT / EXECUTE / COMMIT

The external effect sits between two local commits
  1. 01
    Commit intent

    Persist the tool call and replay policy.

  2. 02
    Execute externally

    The email service may accept the request.

    Crash here: external outcome unknown
  3. 03
    Commit result

    Persist the receipt and completion state.

Recovery starts with the effect’s semantics

safeMay replay, as with report retrieval.

unsafeReturn interrupted; let the application check remote receipts and idempotency keys.

Based on Pi Durable; email is an editorial application example. The framework does not automatically guarantee exactly-once external effects.

The diagram places local records and external execution on one timeline. The difficult interval is after remote execution but before local confirmation. Applications need a queryable request identifier or a provider-supported idempotency key: an identifier that lets repeated submissions represent the same action. Model confidence cannot replace missing state.

This also explains the framework’s boundary. Durable records provide the basis for recovery; preventing duplicate effects requires cooperation from the specific external service. Saving a conversation does not automatically implement exactly-once execution everywhere.

Section referencesEarendil · Pi Durable ↗

Continuity matters because the work need not be handed over again

Together with compaction, persistence reveals two complementary records. A working summary carries the goal and remaining obligations; execution records carry completed actions and uncertain outcomes. Losing the first can derail the task. Losing the second can misrepresent the outside world.

RECOVERY / TWO KINDS OF MEMORY

Resuming needs both the goal and a record of what happened
A / TASK RECORD
What remains to be done
Goal
Prepare both language editions
Delivery
Preview first
Next
Review figures and English text
B / EXECUTION RECORD
Which actions have completed
Artifact
Saved draft version
Call
Tool inputs and task identifier
State
Completed / pending / outcome unknown
Continue from confirmed state

For uncertain external actions, inspect the outcome; avoid repeating completed actions.

Editorial application example. Summaries and durable execution records solve different problems; application logic must connect them.

For long-running work, I want confirmed work to continue, queryable outcomes to be checked and genuinely new choices or unresolved states to be surfaced. That reduces repeated handoffs while retaining control. Asking again at every step undermines delegation; concealing uncertainty lets problems accumulate.

Recovery should continue the original assignment. If the user requested a preview, the restarted agent completes that preview; publication remains a separate decision. Persistence makes a task more continuous. It does not silently expand its authority.

SAVED READING NOTES

SAVED READING NOTES

Turn recurring mistakes into failing checks

The /correct proposal turns recurring coding mistakes into lint rules, type checks or tests. Even when an agent forgets a verbal correction, the environment can report the same concrete failure. This preserves feedback where the failure condition can be stated clearly.

SAVED READING NOTES

Names change; project constraints still need clarity

This reading discusses CLAUDE.md, AGENTS.md and customization of the environment around an agent. These files serve as project handoffs: how to build, how to validate and which constraints matter. Useful instructions make work startable; filenames and loading behavior remain tool-specific.

03

What is AI improving?

The limits of improvement and collaboration

FEATURE

Dream-RSI: using past experiments to plan the next attempt

The researchers turn code-optimization history into a replay environment, then use AI to revise the search policy. What does this “dreaming” save?

An agent can generate and test many versions of a program to make it faster. With a limited budget, choosing which route to try and which to pursue is a problem of its own.

The target of improvement is what to try next

Dream-RSI, a collaboration involving Google, Google DeepMind, the University of Maryland and others, studies how agents organize exploration. In code optimization, a modification creates a candidate program, a test returns a result and a later attempt branches from one candidate. Recording parent-child relationships produces a search tree containing promising results as well as unsuccessful routes.

AI revises the policy that decides which candidates to extend, how to allocate parallel attempts and when to stop a route. The underlying coding agent remains fixed. The analogy is the same experimenter working from a better experimental plan: changing where effort goes can improve outcomes without changing individual capability.

Original figure / Three stages close an exploration loop
Enlarge ↗
Dream-RSI original figure 1: online exploration, replay simulation and offline policy improvement, followed by redeployment.
Dream-RSI project figure 1. The inner loop compares policies; the outer loop adds new real outcomes. The mechanism does not itself replace the coding model. Source and context ↗

The research alternates real exploration, historical replay and policy revision, then returns the revised policy to live tasks. Experience helps decide how to collect the next experience. That feedback loop is the concrete meaning of recursive self-improvement here; it does not require retraining the underlying model each round.

This is useful because coding capability and the allocation of a task’s trial budget are different questions. Dream-RSI makes the latter an explicit object of improvement.

Section referencesDream-RSI · paper v2 ↗

Why is replay cheaper than rerunning experiments?

Suppose a recorded tree contains a modest route A, a promising route B and a failed route C. One policy repeatedly pursues A; another surveys all three before concentrating on B. Where visited nodes already have recorded outcomes, their choice sequences can be replayed to compare the use of a limited budget.

REPLAY / SAME TREE, DIFFERENT CHOICES

Compare choices without rerunning recorded experiments
StartABCA1A2A3B1

A: modest · B: promising · C: failed

Policy one: pursue AA → A1 → A2 → A3

Recorded outcomes show what these choices achieved.

Policy two: compare, then follow BA → B → C → B1

The same historical nodes, visited in a different order.

Simplified editorial example; letters, routes and outcome descriptions are not experimental data. A requested node missing from the history still requires new real exploration.

Dream-RSI original figure / Different paths through one history
Enlarge ↗
Dream-RSI diagram: real exploration creates a history tree; candidate policies replay it for quality, cost and latency feedback.
Source: Dream-RSI project figure 2. Replay uses recorded node outcomes; new exploration still needs real execution.Project and paper ↗

The saving comes from avoiding regeneration and retesting of already recorded candidates. Scheduling and policy evaluation still cost something, but the expensive underlying experiment need not be repeated for that node. The illustration uses the same tree to separate changes in search policy from changes in a program.

An unvisited node has no stored answer. History also reflects the old policy’s choices, including directions that received little attention. A replay advantage therefore needs testing on new tasks. Otherwise the system may become better at navigating an old map without becoming better at exploring unknown terrain.

One experiment, two different gains

The project tests programs that solve Lasso, a regression method that penalizes coefficient size to select variables. The aim is to improve solver speed. It records discovery calls separately from average runtime on six held-out datasets, testing whether improvements carry into data not used for policy selection at that stage.

For Gemini-3.7-Flash, fixed exploration used 3,200 calls versus 1,879 for Dream-RSI, roughly 41% fewer. Average program runtime fell from 2,516.7 ms to 2,350.6 ms, about 6.6%. These measure different things: the investment in exploration and the performance of its output. They cannot be collapsed into one general speed multiplier.

Original plot / Calls and held-out runtime for each model
Enlarge ↗
Dream-RSI Lasso trajectories: cumulative discovery calls versus average runtime on six held-out tasks, comparing fixed exploration and Dream-RSI.
Project figure 3 discovery trajectories. Numbers denote recursive rounds. The axes are neither the full model bill nor research wall-clock time. We did not rerun this study. Source and context ↗
Gemini 3.7 Flash · discovery calls
3,200 → 1,879Computed from reported data: about 41% fewer
Six held-out datasets · average runtime
2,516.7 → 2,350.6 msComputed from reported data: about 6.6% lower

Two measures from the same model and Lasso experiment. Fewer calls are not the whole cost bill; no independent rerun by this issue.

Under those settings, a better exploration policy can reduce expensive attempts while finding a better program. These are the authors’ reported results, not an independent rerun. Full costs also need to include policy optimization and other overhead.

The broader possibility is that AI can improve how it organizes work. Evaluation remains crucial. Runtime offers relatively clear feedback. For “write a good article,” a score based on length or output speed can reward exactly the wrong behavior. Whether the target captures what matters is the next question I would watch.

FEATURE

PANDA: how should a group of agents form a useful team?

This paper studies collaboration infrastructure: finding suitable partners, organizing communication around a task and continuing when a participant fails.

One agent searches, another analyzes data and a third checks code. Putting them in a shared conversation does not automatically create a team. They need discovery, handoffs and a way to replace missing participants.

Find collaborators, then form a small team

PANDA is a multi-agent architecture proposed by Northeastern University researchers. It considers a large population of independently managed agents with different tools and capabilities, assembled into temporary task teams. Routing discovery, scheduling and messages through one service can create a bottleneck and a common point of failure.

The design separates discovering available collaborators from communication within a selected team. Nodes maintain local capability indexes to find partners; a small team then establishes its task communication. A group discussing a specific problem need not involve the entire collective every time.

Original diagram / Responsibilities inside a PANDA node
Enlarge ↗
PANDA figure 1: separate team and collective communication, linked to registries, team management, agent backend and infrastructure failure detection.
Complete figure 1 from page 3 of PANDA. These are responsibilities within a node, not five independent LLMs or a collective-wide control center. Source and context ↗

The source diagram shows responsibilities inside one node: a registry for peers, a team manager, a backend connecting the actual agent and failure detection. Decentralization redistributes management rather than eliminating it. That is an interesting direction for agents using capabilities across organizational boundaries.

Section referencesPANDA · paper ↗

Let the task determine the structure

The paper supports star, chain and mesh orchestration. A star uses a team-level coordinator and suits parallel collection; a chain suits ordered dependencies; a mesh supports repeated discussion and cross-checking at additional communication cost. The diagram’s letters are roles, not an intelligence ranking.

TEAM / DEPENDENCIES SHAPE COMMUNICATION

One research task, three collaboration structures
Star
ABCDE

Parallel research, then editorial synthesis.

Chain
ABCD

Collect → verify → write → review.

Mesh
ABCD

Specialists challenge claims and exchange evidence.

Editorial task example. Letters are roles, lines are collaboration relationships. Not the study’s test scale or a universal topology ranking.

Consider this issue as an editorial example. One participant examines OpenAI’s release, another reads AHM and AGMAI, and a third checks historical analogies before synthesis. The value comes from obtaining different kinds of evidence. Three agents paraphrasing the same report can still inherit one shared omission.

Before adding an agent, ask what additional capability or material it contributes. For a short, self-contained task, another handoff may add only delay and misunderstanding. Where expertise and evidence differ, clear division of work can expand what one person can accomplish.

A team can keep running and still answer incorrectly

PANDA also studies recovery from crashes, network faults and failures in orchestration. Affected work can be replanned or reassigned. Its HotPotQA evaluation—a benchmark requiring information from multiple documents—reports completion and efficiency. The paper defines completion as producing an answer, regardless of whether that answer is correct.

EVIDENCE / COUNT SOURCES, NOT VOICES

Three agreeing agents may still represent one source
Repeating one report
One secondary report
Agent AAgent BAgent C

Agreement has not added evidence.

Check different primary materials
ReleaseRevisionsObjections
Agent AAgent BAgent C

Bring traceable evidence into the synthesis.

An editorial research example, not a PANDA experiment. More sources do not guarantee correctness, but make disagreements inspectable.

That distinction matters. A missing member can be detected and replaced. Three members misreading the same source may look like a smoothly completed task. The evidence diagram separates whether messages arrive from whether a conclusion has independent support.

The paper’s trust network also constrains eligible collaborators; it is not a substitute for checking content. I hope this infrastructure makes complementary AI work easier to organize. Team quality should be visible in an added source, a discovered error or a task beyond the capacity of one agent, rather than in the number of assigned roles.

Section referencesPANDA · paper ↗
Supporting referencesPANDA · paper ↗

SAVED READING NOTES

SAVED READING NOTES

EmbeddingGemma 2: one retrieval space across modalities

Google’s model card describes text, image, video and audio embeddings in a shared 768-dimensional space, with selectively loaded encoders. Try a personal-library task, such as finding an image or recording from text, then evaluate retrieval and device overhead.

04

This week’s shelf

A quick look at ten products

Start with the task a tool solves. A reason to try each, and a boundary to check before adopting it.

Images from official product sites and project pages, cropped to 3:2. Select one to see its complete composition.

Reverse engineering01

Connect a coding agent to application and binary inspection through MCP, tracing how a feature works.

For studying application behavior and compatibility.

Capabilities depend on the target and local analysis tools.

Local agent teams05

Give desktop agents separate instructions and workspaces, with task handoff and shared files.

For experimenting with several local work roles.

Model-service costs and permissions are separate.

Browsing and work06

Bring browsing and Claude Code or Codex tasks into one window, connecting pages with project work.

For moving a reading into project work.

Distinguish browsing, read-only analysis and project edits.

Documentation07

Help people and agents read, search and use product documentation alongside API workflows.

For examining whether your documentation is searchable and actionable.

Establish content accuracy before expanding automation.

Agent hardware08

A dedicated Debian computer for agents, with remote access and hardware connections to other devices.

For readers exploring persistent tasks and device control.

A preorder product; confirm price, delivery and compatibility on its site.

Virtual devices09

Manage virtual iPhones in a native macOS window, with a device library, settings and lifecycle controls.

For iOS research environments already using vphone-cli.

Read the hardware, OS and research-VM requirements first.

Coding workspace10

An open-source graphical workspace for coding-agent threads, diffs and Git collaboration.

For keeping coding work visible in one place.

It organizes work; model accounts and token usage remain separate.

05

Other threads

Products, reading and visual thinking

SAVED READING NOTES

The Jev application list keeps growing

The saved inspection note records awesome-jev growing from 583 to 591 entries, including bisect, moderation and security work. Examine where each decision layer connects and what executes afterward. The count is a snapshot, not a maturity rating.

SAVED READING NOTES

DEX #366: what computer does a personal agent need?

DEX groups personal agents, cloud desktops and AI computers. Compare where a task lives: a portable device, an always-on host or a temporary cloud desktop. Start with persistence, data access and recovery needs before choosing hardware or services.

SAVED READING NOTES

Across 16 products, memory and initiative recur

Founder Park’s roundup spans personal agents, specialist assistants and memory tools. Use it as a candidate list and try one adjacent to a current task. Useful initiative depends on what a tool remembers, when it interrupts and whether you can inspect and correct it.

SAVED READING NOTES

Thin Is In: where does control live in a thinner interface?

Thin Is In connects persistent agents with lighter interfaces. Work that once required opening an app and navigating several controls may begin with a short request. That creates a design question: where do progress, source material and opportunities to take over remain visible?

SAVED READING NOTES

AIGC Weekly #191: a partial reading

The cached portion covers personal agents, AI decompilation and cross-device work. The stream reports roughly 21% coverage, so this note retains the excerpt’s threads without presenting a verdict on the entire newsletter. The full issue belongs in its subscription channel.

SAVED READING NOTES

Does more AI usage mean better value?

Kazike compares two A16Z reports on usage frequency, payment and concentration of spending. The useful shift is from model capability to how people use AI. Users, paying users and the general population are different denominators. Spending indicates demand; completed tasks, time saved and continued use help explain the value delivered.

SAVED READING NOTES

The gap between fingers: seeing Zeno’s paradox

The original post shows a child a finger gap repeatedly halving. Explanation need not begin with complicated notation. Our geometric-series sketch below makes one point: infinitely many remaining steps can have a finite sum; infinitely many steps alone do not imply infinite time.

½ + ¼ + ⅛ + … = 1

Editorial sketch: infinitely many steps can span a finite total length. This is separate from the original video.

SAVED READING NOTES

Hands-On Large Language Models: learn through diagrams

Jay Alammar and Maarten Grootendorst’s Hands-On Large Language Models connects model concepts to applications through illustrations and code. It provides useful background for this issue: tokens, vector retrieval and generation conditioned on earlier input. Understanding the mechanism makes it easier to locate what a product claim actually changes.

KEEP THE DISCOVERIES COMING

A week of AI reading, sent to you.

Every Monday. The cover, theme guide and every reading, in English or Chinese. One email per issue.

Weekly RSS ↗
All saved readings28

Every save has a home in the issue. Original titles, saved records and original links remain here, alongside a jump to their editorial section.

  1. Original ↗
  2. Original ↗
  3. Original ↗
  4. Dream-RSI · 让 Agent 在自己的「历史」里做梦来自我进化Tong Zheng, Xidong Wu, Zheng Zhang 等(Google · Google DeepMind · UMD · UVA) · In this issue ↑
    Original ↗
  5. Saved email
  6. Original ↗
  7. GitAgent · 把 AI Agent 写成一个 Git 仓库Shreyas Kapale · Khush Patel(Lyzr Research Labs) · In this issue ↑
    Original ↗
  8. Pi Durable 技术手册:让 Agent 崩溃后接着干Pi Durable Technical Manual(基于 earendil-works/pi · pi-durable 1.0.3,Hugging Face 托管 PDF) · In this issue ↑
    Original ↗
  9. Original ↗
  10. Original ↗
  11. Original ↗
  12. Original ↗
  13. Original ↗
  14. Original ↗
  15. Original ↗
  16. Original ↗
  17. Saved email
  18. Original ↗
  19. Original ↗
  20. Saved email
  21. Original ↗
  22. Original ↗
  23. Original ↗
  24. Original ↗
  25. Original ↗
  26. Original ↗
  27. Original ↗
  28. Original ↗

READ WITH A FRIEND

Share this issue

AI Trends Weekly 003 · OpenAI’s mathematics: progress and resistance

Save the cover and send it to a friend who reads with you.

Follow what matters

订阅 Airing

选择接收方式,再决定你真正想看的内容。

新一期编好后发送;周刊邮件中可切换语言或退订。