diff --git a/apps/presentation/site/public/blog/edgebench-feedback-and-memory/index.html b/apps/presentation/site/public/blog/edgebench-feedback-and-memory/index.html index 5455f76412..b2621e74e0 100644 --- a/apps/presentation/site/public/blog/edgebench-feedback-and-memory/index.html +++ b/apps/presentation/site/public/blog/edgebench-feedback-and-memory/index.html @@ -4,296 +4,91 @@ Giving long-horizon agents a reason for their next step · LoopX - + - +
← LoopX Blog中文
-

Ruiteng Huang · October 7, 2026 · Interim research note · Evidence cutoff 14:40 UTC

+

Ruiteng Huang · Updated October 26, 2026 · Exploratory research

Giving long-horizon agents a reason for their next step

-

Understanding LoopX’s semantic control plane through EdgeBench

-

An agent can work for hours and retain its entire conversation while continuing along an unproductive route. LoopX aims to keep the original goal, accumulated evidence and next action connected in a way that can be inspected and revised.

-

We have been studying this on portfolio risk calibration and Lean proof completion. Relative to our earliest attempts, both blind studies show substantive system-level progress: beyond persistent zeros, ineffective continuation and slow advancement, toward more verifiable artifacts, more reliable sustained work and markedly faster Lean progress in common time windows. LoopX repairs, prompts and benchmark execution improvements contributed together.

-

Our interim assessment is positive: the semantic control plane is showing value on real tasks, and the overall system is more effective than at the start. We now need to separate contributions and make the observed progress more stable and reusable. This article retains the evidence of overall improvement alongside technical mechanisms and unresolved counterexamples.

+

From reliable feedback to sustained progress and affordable context

+

The useful question after a long agent run is what improved after the first good result, whether the improvement survived, and what the entire process cost.

+

Our EdgeBench research has moved through three stages: make evaluation and continuation reliable; examine how accumulated evidence changes later work; then reduce the cost of delivering that evidence. Early Lean results and later Ad Placement traces show real progress. The strongest foundation-model baselines have advanced too. These observations support continued development of LoopX, while leaving the contribution and net benefit of individual mechanisms open.

+

Our current judgment is encouraging but bounded. We have examples of useful late work and a more direct recovery/replanning flow. We do not yet have a general causal improvement estimate or a complete fee comparison.

- - -

1. What the control plane controls

-

A long-horizon agent maintains at least two histories. Conversation history records what was said and done. Task and evidence state records what must still hold, under which conditions a finding remains valid, and why a next action is feasible. These histories complement each other. Resuming a conversation does not make an old conclusion applicable; completing a Todo does not establish that the original goal has been achieved.

-

We call LoopX’s approach a long-horizon semantic control plane. The goal and acceptance conditions constrain work; current evidence supports or challenges a route; results lead to continuation, replanning, waiting or stopping. The model proposes and interprets choices. The control plane preserves provenance, checks state transitions and returns the obligations that still apply to the executor.

-
  1. GoalAcceptance, scope and stops
  2. SelectionFeasible candidates and reasons
  3. ActionWork, validation and results
  4. EvidenceObservation, interpretation and scope
  5. RevisionContinue, switch, wait or finish
-

The guarantees differ across this cycle. A system can verify that work has a matching settlement, evidence names an input revision, and a rejected write leaves no partial effects. Field validation cannot establish that the model understood a qualification or chose the best route. Protocol correctness can be checked directly; cognitive benefit requires behavioral and outcome evidence.

-

Runtime, Todo counts and graph size therefore cannot stand in for long-horizon capability. We want to know whether the system preserves constraints while rejecting bad routes sooner, reusing validated results and allocating its remaining budget well. Reliable evaluation, recovery and context delivery belong in the same study because each can break that chain.

-

Research question: can experience improve later choices?

-

Research question and comparison methods updated October 10, 2026. This revision adds no experimental scores; all numerical results below retain their stated historical versions and observation windows.

-

We want to test whether, with the same model and comparable budgets, a general harness helps an agent accumulate and use experience well enough to keep making verifiable progress later in execution. A failed route should leave more than “failed before”: its conditions, what it ruled out and what new evidence would justify retrying. Recording that finding, changing a subsequent choice and improving the outcome require separate checks.

-

A main session that continues to interpret the goal and evidence is one way to study this question; cross-session recovery tests reliable state transfer. Session continuity alone does not establish better use of experience. Fresh-context execution and workflows can also preserve experience through files and external state. Comparisons should record the actual session strategy, available information and handoff cost, letting results determine applicability. EdgeBench Section 5.2 and Appendix G provide relevant comparisons of sustained execution, independent retries and harnesses; they do not isolate LoopX’s incremental benefit.

-

The 2026-10-16 continuation is integrated below: goals and recovery, evidence follow-through, whole-episode cost, planned/stride, pre-decision checkpoints and real contrasts, and the next study design. The opening and earlier numbers retain their original cutoff.

-
- -

2. Separate two stages of research

-

Early Portfolio and Lean studies tested feedback, sustained work and evidence adoption; later studies inspect choices from mature research points. The table retains the early five modes, not a current launch matrix. Section 9 preserves the earlier stride-on comparison; Section 10 separates the October 17 stride-off study from later Sol old/new, Astra Official/LoopX and model-switched continuations.

- - - - - - + +

1. What should get better with more time?

+

LoopX keeps the original goal, acceptance conditions, work ownership and evidence durable across sessions and hosts. Its control plane constrains state transitions and supplies feedback for the model’s next choice. It does not certify that the choice is insightful. A recorded finding, a read receipt and a replan entry are intermediate evidence; the relevant chain ends in actual work and a validated outcome.

+
  1. GoalAcceptance and scope
  2. EvidenceResults and limitations
  3. DecisionContinue or change course
  4. WorkExecute and validate
  5. RetentionKeep the best valid result
+

We separate three observations: an initial advantage, an improvement obtained later, and retention of the best validated artifact. A higher final score can come almost entirely from a stronger starting point. A better intermediate candidate can disappear from the terminal workspace. More runtime, Todos or graph nodes establish none of these outcomes.

+

How the research changed

+
Execution modeMechanism retainedQuestion
Official workerOfficial stop hook and continuationHow far does the official execution path progress?
Single Codex callOne call, ending naturallyHow much happens without an external continuation loop?
Native GoalCodex goal execution and continuationWhat does native long-horizon execution provide?
LoopX ResumeSame-session recovery, Todos, replanning and settlementWhat do semantic control and reliable continuation change?
LoopX ExploreResume plus optional evidence capture and exploration planningDoes structured evidence enter the next decision?
+ + +
StageQuestionWhat the evidence can establish
Feedback and continuationCan we trust results and keep authorized work useful?Evaluator defects, recovery failures and common-window system progress
Later decisionsDoes accumulated evidence improve the next experiment?Decision-to-work traces and changes after a mature research point
Context efficiencyCan we deliver the same obligations with less complete cost?Actual model input, recovery, tool calls and outcome/cost comparisons
-

The historical Portfolio design covered five workers × native/blind feedback, ten arms. Later work added selective ablations. Lean primarily uses blind runs. Native workers may obtain judge feedback. Blind workers retain public tasks, training data, local tests and validators, but receive neither judge scores nor hidden diagnostics. Background evaluation is an operator observation and is not returned to the blind solver. Blind means no judge feedback, not no feedback.

-

Earlier Portfolio/Lean and October 17 studies use gpt-6.1-sol / xhigh; later cohorts state their own model and effort. Historical figures retain their original budgets, sampling, scorer and date. Graph/Portfolio continuation preserves consumed time, opportunities and cooldown within its cumulative 36-hour ceiling, not a fresh allowance per donor. A shorter observation window does not establish normal completion of a planned run.

-

Earlier work compared seeded phase Todos with goal-derived planned execution, review cadence, context and Explore. Later research selects planned + Explore and explicitly reviews every six settled effective work Turns. This is the current study setting, not a claim that old three-Turn runs used it or that explicit product units changed. Prompts, runners and contracts co-evolved, so early planned results do not establish a general advantage on their own.

-

Early overall progress, with its original windows

-

Lean provides direct common-window evidence. Under blind conditions, valid samples from early LoopX v14 and that-stage #5844 runs are shown below. More verifiable proof progress in the same time is a real observation, even before its component causes are separated.

-
Lean raw scoreEarly Resume v14#5844 ResumeEarly Explore v14#5844 Explore
180 minutes0.11030.34780.11340.4019
450 minutes0.18820.52430.19960.5605
-

In these single-run windows, the then-current LoopX paths reached roughly 2.8–3.5 times the earlier raw scores. This ratio describes observations. Prompts, task entry, runners and control mechanisms changed together; it is neither the causal gain of one feature nor a result to extrapolate directly to other tasks.

-

Portfolio improved differently. Early persistent zeros included feedback-wrapper and accounting-contract defects. After repairs, blind arms produced valid ledgers, conducted local research and obtained usable evaluations. Older Resume reached a best sampled 17.32; later planned v17 reached 25.39, but its last sample was only 12.38, versus 15.57 for older Resume. Budgets and scoring revisions also differed. At roughly 7h45, that-stage #5844 Resume/Explore had best sampled scores of 15.01/12.21 and latest samples of 8.15/9.67. Evaluability, continuation and some best observed outcomes have moved beyond early obstacles; terminal quality and sustained retention of good solutions still need work.

-

This supports a more effective overall system while leaving two questions open: where did the gains come from, and how do we prevent regression with a new version or more runtime? Improving benchmark execution—shared iteration guidance, correct recovery, task-specific sampling and budgets—is itself part of long-horizon systems engineering. Its contribution should be recorded rather than attributed entirely to the graph or replanning.

- -
- -

3. First make the feedback trustworthy

-

The early Portfolio blind zeros exposed two different problems. Our blind wrapper had removed iterative optimization and best-version guidance along with the judge entrypoint, confounding feedback availability with behavioral instructions. We repaired the wrapper and started new attempts while retaining the old results. Independent reconciliation of completed samples then exposed differences between the evaluator’s assumptions and actual execution semantics.

-

A tiny counterexample can invalidate a whole curve

-

Start with 100,000 cash. An asset rises from 100 to 200. Buy 100 units only at the second day’s close and pay 10 commission. Valuing them immediately at that same close gives equity of 99,990 and NAV of 0.9999. The account did not earn the price increase before it bought.

-

The old reconstruction multiplied post-close weights by the day’s return and produced approximately 1.199919992, rejecting the correct account. In the opposite direction, a true all-cash path [1, 1, 1] reported as [1, 1.01, 1] passed an endpoint-only check. The first counterexample proves false rejection, the second a local check’s blind spot. The latter does not prove that the complete judge accepts fabrication.

-
Two independent counterexamples: post-close weights misattribute earlier returns; endpoint-only validation misses an incorrect intermediate NAV.
Evaluation should reconstruct the entire economic path from executions and prices, rather than checking only its endpoint or trusting the NAV it is meant to verify.
-

For two frozen terminal samples, independent reconciliation without importing solver calculation functions matched all 243 trading days in each: equity residual below 4×10⁻⁹, NAV residual below 5×10⁻¹⁶, and no share-count difference. This established those ledgers’ consistency, not strategy quality. Seven groups of matching trade signatures in another sample corresponded to separate cash, inventory and cost effects. A duplicate signature can trigger investigation; it cannot replace economic verification.

-
Key technical conventions in ledger-v2 -

The versioned task fixes initial cash at 10 million with no holdings, close-time execution, 5 bps commission and 1 bp cash slippage. Borrow cost accrues on prior-close short market value at 4% annually using ACT/365 calendar days. Crossing zero inventory becomes ordered execution legs. Cash, integer shares, costs, equity, NAV and weights are validated daily.

-
Equity change = prior holdings × price change − commission − slippage − borrow cost
-

Reconstruction starts from executions and prices, not reported cash or NAV. Negative cases cover missing costs, repeated execution identities, extra trades without economic effects, invalid inventory transitions, altered intermediate NAV, missing dates and non-finite numbers. Positive cases include legitimate equal-sized fills, weekend borrow and no-trade days. Rule revisions are versioned; they do not replace historical scores. See EdgeBench #14.

-
-

Better feedback does not guarantee a better strategy

-

The single blind ledger reconciled, yet removing the incorrect NAV penalty still left an approximately −1.87 subtotal, clipped to zero. Removing a duplicate-signature penalty in another sample would yield a counterfactual 18.05. We did not record that as a new official score.

-

Cost attribution needs economic quantities rather than counts. Of single blind’s 475 fills, 281 concerned hedging, but their commission was only about 0.0412% of initial capital. Borrow cost was about 0.4484%, most of the total 0.7129% cost. Hedging is a task requirement, so deleting shorts is not a valid shortcut. A testable question is whether strategy selection and subsequent hedge adjustments share compatible cost and risk objectives on public training data.

-

This repair has substantial value with a precise meaning: it helps separate capability from measurement error. It is not a LoopX solving gain. Nor may terminal hidden diagnostics become tailored advice to an active blind worker.

-
- -

4. Goals, work items and execution need different stopping rules

-

The numerical tables above retain the initial draft’s evidence cutoff. Added mechanism and closeout observations below extend through 2026-10-08 09:33 UTC. They remain exploratory, change no formal score eligibility and do not replace complete terminal acceptance.

-

One concrete failure occurred when seeded-blind wrote no_followup after roughly 34 minutes. The outer process resumed about 100 times without restoring useful work. A live scheduler is not a runnable semantic path. In another failure pattern, the system already knew replanning was needed but first offered a predictably invalid choice, forcing a failed call before revealing the next step.

-

No existing Todo does not imply that the original goal is complete. After finishing a work item, the agent must compare the result with the original acceptance: is it satisfied, does a reasonable next step remain within authorization, is there an external dependency, or is there truly no useful continuation? Replanning may produce work or justify staying on the same route. It should not invent tasks merely to keep a loop moving.

-

Review completed work turns, not just completed Todos

-

A long task can remain unfinished for hours, so review should track actual settled work. The effective-Turn repair replaced implicit Todo-completion counting while preserving explicit legacy units. The new study in Section 10 uses six effective work Turns; early three-Turn and then-product five-count settings describe their own revisions. A due review requires reconsideration, not a route change or new budget.

-

A Turn here is neither a model message nor a tool call. Cadence comes from uniquely settled work: uncommitted refreshes, retries and duplicate records must not inflate the count. Reaching the interval asks for a review, not a mandatory route change, and grants no budget or authority. Real entrypoints have been tested to trigger while a Todo is still open and to resume work after a justified continuation. Net benefit depends on what the model actually decides.

-

The counter must also distinguish work from observation. A validated negative result can be effective work; monitor-only polls, duplicate submissions and unsettled attempts do not count. This lets a long-open Todo receive periodic review without letting background sampling trigger pointless replans. A review should connect the original goal, candidate evidence and the next action. Choosing to continue can be correct; acknowledging that a check occurred does not establish better research direction.

-

Review cost also needs a breakdown by trigger. Periodic checks, a remaining goal gap after a work item ends, and new evidence invalidating a key assumption may need different depths of review. Changing the interval affects only one category. If every small completion rebuilds the global plan, a longer interval may not solve the problem. Conversely, a replan phase can contain useful probes and validation, so its entire duration is not administrative waste. Traces should distinguish useful route revision, repeated evidence gathering and mechanical bookkeeping before testing the boundary between local continuation and heavier global review.

-

Recovery and settlement are distinct chains

-

Session recovery preserves execution context. Settlement connects the current Turn, selected work, validation result, durable writeback and budget use. A retry after a lost response needs to recognize existing effects rather than execute or count them twice. Restoring a session without settlement can revisit the same obstacle; correct settlement with the wrong session can lose the solving context.

-

Earlier repairs addressed exact session recovery, next-action/receipt binding and invalid continuation diagnosis. Recent work adds checkpoint-selection and lifecycle recovery. Resume from the original Turn and committed effects: a lost reply must not duplicate execution or spend, and independent new work requires a fresh legal-path judgment. Correct continuation and useful work selection remain separate acceptance questions.

-

Keep the original goal visible before selecting work

-

The following status is updated through 2026-10-17, preserving historical windows while separating source, actual research adoption and effects.

-

Recent inspection moved beyond whether an agent read a Goal to which goal actually arrived. The original task remained in prompts and files, and agents did read it; some newly created structured benchmark Goals nevertheless carried only generic research reminders. Work could satisfy that reminder while drifting away from the task’s main metric. A separate projection defect borrowed public-display filtering for scoped input: paths or secret-like strings could drop a whole goal paragraph, and research text could be truncated.

-

#6649 preserves the original task objective and priorities in new Goals and complete source text in authorized same-Goal replan input; public export boundaries remain separate. #6654 makes that shared goal projection a default-off, explicit opt-in in LoopX and its benchmark runner. When enabled, the planning horizon shows the original Objective, provenance, separate acceptance and readback before work selection. A source correction appears on the next read. Disabling it preserves the existing horizon behavior; the Goal input already supplied to replan is independent of this switch. It creates no second persisted goal and does not rely on repeating a slogan every Turn.

-

The original-goal repair #6649 and horizon switch #6654 are both merged, with configuration-editor, CLI readback and feature-off validation. The new same-point research in Section 10 explicitly enables the shared Goal horizon and reads the original objective in current reviews; old checkpoints are still not rewritten. An objective reaching work selection does not guarantee correct prioritization or explain every earlier low score. Follow-through must ask whether a complete experiment reduces the task’s main-metric gap.

-

Why failed wakes did not end the whole experiment

-

In the older Graph stride-on/off comparison, outer wakes failed 20/99 and 14/104 times; successful wakes also recorded 35 and 45 internal stage errors. Failures clustered around review, checkpoint selection and unsettled-state recovery. The outer runner could wake again, while committed candidates, native results and some checkpoints survived. Work therefore continued, but could repeatedly recover the same decision, delay useful action and consume research or capture time.

-

Recorded failed-stage time was about 49 and 35 minutes, not total loss; 20/99 does not mean 20% of useful work was wasted. Unequal fault burdens confound an overall comparison. The selection-hop repair and lifecycle recovery repair address distinct breaks: preserve the original Turn, recognize committed effects and restore a legal route when independent work arrives. They add no submissions or cooldown resets and do not retroactively convert failures into passes. New studies need actual adoption of the repaired source.

+
Comparison boundaries

Historical studies include Official, single-call, native Goal, LoopX Resume and LoopX Explore. Explore adds optional evidence capture and planning to continued work. Blind runs retain public tasks, training data and local validators but receive no hidden judge scores or diagnostics; background operator evaluation is not solver feedback. Later native-feedback studies use agent-requested evaluation, a one-hour accepted-submission cooldown and no periodic grading. These are different studies, not one pooled treatment.

Models, effort, prompts, runners and budgets co-evolved. Early studies primarily used Sol/xhigh; later Sol/max and Astra/xhigh cohorts retain their own conditions. One run per arm is descriptive evidence. Missing, stopped, invalid and valid-zero results stay distinct. Source time, evaluation opportunities and cooldown survive checkpoint continuation; donor history is not a new independent repetition.

- -

5. Explore must carry evidence into an actual choice

-

We observed enabled Explore hooks on all 20 reads in two groups’ first 180 minutes, while their graphs remained empty. The model was still discovering things: a counterexample to directly inheriting a tail bound from a finite prefix remained in local validation notes. The missing path was from that result to a scoped graph record, task association and later use. A higher read quota cannot fix a write that never happened.

-

The response was more than a reminder to write a graph. An optional capability hook attaches capture to ordinary result writeback. The existing observation and route decision can be reused with an explicit question, applicability, input revision and finding status. A linked question can reuse its canonical scope. A low score cannot automatically imply refutation, and pausing a route does not mean it is forever wrong.

-
  1. Capture: was a useful result saved, with recoverable rejection and retry?
  2. Association: did it bind to the current question and Todo with its conditions and version intact?
  3. Retrieval: did the later decision receive it without crowding out other relevant counterevidence?
  4. Adoption: did the model use it to change or explicitly retain a choice, followed by consistent action?
-

Node counts cannot certify this chain. A later audit of four frozen runs found one and three findings in the two Explore arms, but no graph associations on seven inspected Todos. Two first writes lacked node_id; the model tried creating nodes, encountered scope conflicts and eventually recorded findings manually. Nonempty graphs had still not established the full path.

-

#5889 addresses that friction. A new question derives stable identity from explicit question and applicability; conflicts identify mismatched fields. Existing scope stays immutable, rejected inputs leave no partial effects, and retries do not duplicate records. Writes remain subject to the current Todo, claim and lease. This repairs identity and recovery without inventing scientific findings. Real leased writeback and readback are validated; supplementary runs now also contain natural capture, association and delivery in a later Turn. The graph’s incremental value over files or the same conversation remains unisolated.

-

Retrieval also needs progressive access: cover distinct questions first, then offer more records per question, with revision-bound pagination and question-specific expansion. Three initial entries can be a sensible context budget; a hard information ceiling of three can discard decision-relevant evidence. Selection and larger access must be assessed together.

-

Counterevidence: memory can work without a graph

-

Portfolio traces include retained results across 12 variants, five training years and four warm/cold checks. Another search required training Sharpe at least as high as baseline and turnover no higher, rejecting all nine candidates. That need not be a good research policy: all candidates had lower training returns and four had worse cold-start behavior, suggesting a limited search may have stayed too conservative.

-

Current Lean Explore also preserves hard cases, records local counterexamples to false statements and moves to other chapters. Files, Todos and the same conversation can carry this information. To establish the graph’s incremental value, we must identify an additional avoided repetition, retained qualification or changed choice. It cannot take credit for all memory.

-

Evidence, adoption and actual intervention need separate checks

-

One supplementary Portfolio sample records a risk finding, then implements and tests tail protection. On this period’s actual inputs, however, constrained and unconstrained allocations remain equal. A finding reaching code and passing stress checks does not establish an intervention in this task. A Lean chain proceeds from periodic-review candidate declarations to installing proofs, a full build and later batches. That is closer to adoption evidence than a node count, but still does not exclude the same conversation and local files supplying equivalent information.

-

A boundary failure is informative too. A supplementary Lean run rejects a ninth question association for one Todo because the active association set is limited to eight. It preserves existing associations, records the extra conclusion as standalone Goal-scoped evidence and resumes ordinary work. This limits one task’s association set, not the whole graph to eight findings. Recovery is not free. Reducing capture friction should preserve relevant decision evidence rather than silently deleting old counterevidence to make a write succeed.

-

Review the immediately preceding decision

-

Evidence existing in a checkpoint, a model having read it, and current replanning being able to use it structurally are different facts. We saw a new Goal’s Explore projection report an empty current graph while the archive retained historical research. That requires source/adoption repair, not concluding that experience is absent. Later continuation qualification checked research state, the original goal and actual Explore delivery; mature examples contain dozens of work Turns and over a hundred evidence events. This supports recoverability, not research quality by record count.

-

In one historical Graph audit, five of ten subsequent reviews still cited an older decision. This can skip the experiment just completed and keep reviewing a stale route. Repair in the existing history-sequence and stride owners retrieves the immediate predecessor in all ten prefix replays and rejects five stale references. It establishes the right review target; the model must still judge execution, new information and progress toward the original goal.

-

A discriminating record connects previous choice → actual candidate version → completed experiment → public feedback → next adoption or rejection. Explore’s incremental value belongs on that chain: which condition did it preserve, repetition did it avoid or choice did it change? A node, a switch label or a branching graph alone proves none of those.

-
- -

6. Optimize the information path needed for a decision

-

One clear redundancy was an exact todo list --todo-id … response repeating the body in detail, list and role views. But traces showed that exact reads were not the dominant path. Models also obtained Todo information from Goal documents, quota summaries, batched commands and prior conversation. Shortening one command could not explain or solve the whole cost problem.

-

#5844 therefore converged on one goal: deliver the effective current work once, with progressive access to remaining sources. Ordinary heartbeat/quota returns the complete selected Todo, applicable acceptance, scoped open User obligations and participating hook content, without requiring TurnEnvelope. Already delivered sources are removed from pending reads. The mixed Goal document, which contains intent, other work and history, still requires an exact full read.

- - - - - -
PathBeforeAfter
Exact TodoOne body repeated across three viewsOne complete canonical record; inventory queries remain inventories
Ordinary quotaWork summary plus follow-up commandsCanonical current sources once, plus reads for remaining sources
Optional capability offGeneric skill could still induce useless readsParticipating hook owns the guidance; no routine off-state obligation
More background and evidenceRepeated dumps or only short summariesProvenance, complete reads and expansion by question/revision
-
Concrete same-fixture measurements and their limits -

Exact Todo output fell from 15,986 UTF-8 bytes and three body copies to 2,721 bytes and one copy. Ordinary quota grew from 23,088 to 27,137 bytes against the command-only version because it carried actual content. Pending sources shrank from preference + Goal + Todo to Goal. This does not establish lower total tokens or latency: if old reads were already batched, removing a CLI process may remove no model round trip.

-

In 12 frozen real wakes, all received the complete Todo: nine through inline or file-based guards, three through exact reads. Eighteen inspected bodies matched their startup source digests. That establishes delivery and source consistency, not comprehension, complete constraint adherence or total cost benefit. The earlier roughly 78% synthetic compression claim likewise applies only to its measured output.

-
-

The current study’s information organization follows one real decision: complete current-work constraints arrive directly; a same-source original goal anchors selection; additional history and evidence expand by relevant question and revision. Do not mechanically reread an already delivered source. Missing content, failed sources or changed versions require complete reads through the current contract. Authorized research input must not lose its objective or counterevidence to public-display filtering. Optimize the whole decision path rather than one JSON length.

-

Optional capabilities must not leak through generic guidance. Repeated semantic-preference reads induced by a generic skill while the capability is off are a boundary defect; #5874 returns that guidance to the participating hook. Smaller packets and fewer useless prompts help, but must preserve acceptance tails, applicability, continuation conditions and failure recovery. The optimization unit is the decision path, not one JSON length.

-

Tool granularity should match a meaningful operation

-

A direction worth testing is to put state and recovery complexity inside semantically complete tools with clear boundaries: obtain all constraints needed for current work, for example, or submit a result with its source and applicability. A tool may perform several internal checks while the model remains responsible for interpreting evidence and choosing a route. Anthropic’s tool-design guidance likewise organizes interfaces around real work rather than exposing every underlying API to the model.

-

Fewer commands alone are not the objective. Consolidation must preserve permissions, visible failures and retry semantics. Real execution must show whether an interface is easier to learn, produces fewer errors and turns saved interactions into useful work. #6038 improves action-specific CLI help and recovery from lease-argument errors. That repairs a usage path; it does not yet establish better task outcomes or lower whole-run cost.

-

Measure the complete research episode

-

A recent Portfolio fixed 2×2 check covered 14 local cases and 56 result rows: five public cases and nine synthetic cases. The factors were original V7 versus adaptive covariance, and truncating total target shares versus truncating the requested share change. The following means use only the five public cases, hold V7 fixed and change only the execution rule to share-change truncation. Mean fills fell from 451.2 to 235.4, about 47.8%; costs fell only from 62,683.15 to 62,682.18, about 0.00154%. Mean Sharpe rose just 0.000133. Separately, drawdown worsened in ten of all fourteen cases. A large change in operation count produced a tiny change in the goal. Fewer fills became a candidate mechanism whose value needed comparison with actual headroom.

-

The solver reported about 25.25 CPU seconds for local computation; the two complete wakes containing this research took about 29.66 minutes, ran 90 commands and emitted roughly 68,000 output tokens. A separate completed covariance episode took seven wakes, about 68.05 wall-clock minutes and 144,700 output tokens. These include reasoning, control, authoring, tools and waiting, not pure decoding time. Some diagnosis carries information and is not all management waste. Reporting only a small script’s seconds nevertheless misses the main cost relevant to continuation.

-

Measure the full episode, then distinguish active work, recovery, waiting and native evaluation. Difference and deduplicate cumulative session usage rather than adding ancestor history repeatedly. Faster local computation, fewer commands or smaller packets count as efficiency gains when they preserve decision information and improve useful output or complete cost.

-

Fewer hints, with the actual callers using one factual source

-

The October 24 work separates read facts → choose a route → read the writeback format. Tactical recipes recede; the original goal, cumulative requirements, public feedback and execution boundaries remain. A reader existing in source is insufficient: an earlier nominal treatment still received the old guard and planning prompt. A later Host audit also found a full-source instruction and duplicated settlement plans. Proposal #7269, reviewed at 0ddd08ad, converges CLI and native Host/journal delivery, keeps the core goal and current horizon explicit, and delivers the settlement plan once. Signed original source remains available for verification and recovery; old captures without a safe reader retain compatibility. It reuses the existing context-delta owner, without another cache or reading acknowledgment. This proposal has not been adopted by the frozen runs below.

-
Whole read-sequence transport: smaller on one path, larger on another -

Four fixed Schema/Grid historical snapshots compare the previous proposal with the reviewed revision. UTF-8 totals include entry, review, every advertised acceptance detail, Explore where applicable, and writer. Recovery additionally reads the complete original source. This is offline transport, not model tokens or a benchmark effect.

- - - - - -
Read pathBefore, bytesAfter, bytesChange
Captured CLI550,039562,429+2.25%
Structured Host622,317263,115−57.72%
Native renderer647,687257,599−60.23%
Native with full-source recovery647,687688,962+6.37%
-

The native path replaces one full-source read with two or three staged CLI reads. Tool boundaries and recovery can offset a smaller normal input. Local read timings collected alongside validation are not controlled latency measurements; external evidence-tool output, model caching, output and billing remain unmeasured.

-

A separate earlier settlement diagnostic alternated eight paired samples per backend after warmup. SQLite manual/composed median CLI time was 0.807/0.995 seconds; File was 0.796/1.018. Output bytes fell about 46%, while paired process time grew about 24%. One operator call still launched two complete CLIs and an authoritative readback. Possible model-interaction savings remain unmeasured; historical time between two tools also includes reasoning and validation.

-
-

Cost coverage matters too. In the finite Sol/max continuations below, response-level reconciliation found three Schema and two Grid usage records missing from native notices next to compaction: 23,740 and 14,619 output tokens. Formal replan occupied 7.35% and 8.94% of the outer clock, but about 21% elapsed before the first observed native task. Preparation includes recovery, validation, repairs and startup gaps, not only replanning. The reference of 15% for all mechanisms combined remains unqualified: useful research, control, failures, shared resources and actual fees have not all been attributed.

+

2. First make feedback and continuation trustworthy

+

The first Portfolio experiments exposed measurement and execution defects before they could tell us much about strategy. A blind wrapper had removed iterative optimization guidance along with the judge entrypoint. A ledger check attributed earlier market returns to holdings bought only at the closing price. Both confounded the intended comparison; repairing them required new attempts while preserving the old results.

+

One small oracle made the accounting error clear. Start with 100,000 cash, buy 100 units at a closing price of 200, and pay 10 commission. Immediate equity is 99,990 and NAV is 0.9999; the new holding did not earn the preceding rise from 100. Independent reconciliation then matched all 243 days in each of two frozen samples, with equity residual below 4×10⁻⁹ and no share-count difference. This established ledger consistency, not investment skill. The versioned repair is documented in EdgeBench #14.

+

Continuation had a related failure: an outer process could wake repeatedly after a work item ended without recovering a useful next action. The governing question must return to the original goal. Completing a Todo can justify another experiment, waiting, or completion; it cannot by itself settle goal acceptance. Correct recovery and feedback make subsequent research interpretable.

+

Early system progress was measurable

+
Blind Lean raw scoreEarly Resume v14Later Resume (#5844)Early Explore v14Later Explore (#5844)
180 minutes0.11030.34780.11340.4019
450 minutes0.18820.52430.19960.5605
+

These single-run common windows show roughly 2.8–3.5 times the earlier raw scores. Prompts, task entry, runner reliability and LoopX mechanisms changed together. The observation supports progress in the overall system; it does not identify one mechanism’s causal effect or guarantee terminal performance elsewhere.

- -

7. Lean’s historical counterexample: slowdown and candidate allocation

-

The improved #5844 Resume and Explore arms progressed quickly early on, then were overtaken by historical native Goal in the middle. We analyzed common 180–360 minute windows using solver-visible tool results and frozen source snapshots. Those arms share c0d519cf; historical Goal used c46f397c. Model and public task digest match, but dates, runners, prompts and budgets differ, with one run per cell. This is route diagnosis, not a clean causal framework comparison.

- - - - +

3. Look beyond the first good result

+

Later experiments shifted the emphasis to work after many hours. We compare a common observation window, then inspect the initial result, later increments and retained candidate. A final ranking alone hides these differences.

+
Blind armRaw score at 180mRaw score at 360mNet sorry reductionFiles affected
Resume / planned / #58440.34780.491950217
Explore / planned / #58440.40190.514744218
Native Goal / historical0.30130.64771,01541
+ +
Historical cohortObserved resultInterpretation
Sol/xhigh, old/new LoopX, Ad Placement · 14h49,589,589,573 → 49,615,495,839Newer run trailed at 2h and led at 14h; its terminal workspace matched its retained best
Astra/xhigh, Official Grid · 6h → 12h1862 → 1810, lower is betterA stronger foundation baseline still produced useful late improvements
-

Only valid returned samples are shown. Raw scores use the 0–1 representation without multiplying by 100. Source sorry tokens exclude strings and comments; they are neither proven-theorem counts nor integrity qualification. These rows retain the original common windows regardless of later runtime status.

-

Proof investment and immediate score differ

-

The task checks original declarations’ axiom dependencies and types against 2,901 baseline unqualified declarations. Removing a sorry, adding a helper, compiling locally and gaining a valid scored declaration are different events. Bridging custom definitions and Mathlib may pay off downstream. If a dependency still contains sorryAx, a local edit need not earn proportional credit. Missing assumptions cannot be fixed by silently changing required signatures.

-

Current runs mostly advance chapter by chapter, reaching limits, series, rearrangements and extrema in the middle. A Resume Appendix B.2 Turn spent 16.6 minutes filling six holes. An Explore Section 8.5 Turn spent 31.5 minutes filling 77, leaving a hard case and recording counterexamples to two original false statements. These spans include proof work, validation and settlement; they are not pure proving time. Some useful work does not immediately become positive score.

-

The historical baseline points toward candidate allocation

-

At 180–360 minutes, Resume’s reductions mostly came from Chapters 5/6 (213/223), and Explore’s from Chapters 6/7/8 (223/79/140). Historical Goal also advanced Chapters 9/10, Misc and MeasureTheory, accounting for 344 reductions in those four areas. It progressed in 41 files versus 17/18. The arms were not simply doing identical proofs at different speeds; they were choosing different work.

-

“LoopX never switches routes” is also contradicted. At roughly 197 minutes, Resume explicitly revised surjectivity/order-preservation bridging; around 252 minutes it recognized statement restrictions and switched from a foundations Todo to later chapters. Explore retained rearrangement problems and moved to Section 8.5 near 325 minutes, then preserved counterexamples and moved to 9.1 near 352. Review and substantive decisions occurred. What remains unproven is systematic comparison of feasible work packages and recent validation cost to improve allocation.

-

The evidence does not show growing management packets

-

Differences between monotonic session-usage endpoints give roughly 303k/289k output tokens for Resume’s first/second three hours, and 317k/292k for Explore. Tool events containing LoopX calls shrank from 1.14MB/0.72MB to 0.47MB/0.33MB. Those events can include other operations and are a transport proxy rather than exact control overhead. They nevertheless do not support the specific explanation that packets grew in the middle.

-

Successful full-build logs also showed no increase in summed declaration-audit job duration: Resume 318/257 seconds, Explore 181/119, with samples of 14/12 and 7/5 respectively. Evaluation queues for the corresponding 180/360 minute snapshots took roughly 1.7–3.4 seconds, with evaluation lasting 7.2–11.2 minutes. Delayed display can leave temporary gaps, but cannot explain the slope between those completed capture points. Failure retries and all validation cost are not fully covered.

-

The next question is therefore more specific than increasing quota or review frequency: can the agent compare routes, distinguish necessary dependencies from independently tractable work, and preserve revisit conditions for difficult cases? The control plane should make those judgments inspectable without hard-coding Lean knowledge or hidden scores into generic rules.

-

A curve has three clocks

-

Solver elapsed time, source capture time and score return time are different clocks. Lean’s full build and declaration audit take time, and sampling can queue. The latest returned score may therefore describe source from hours earlier. Placing it at the current runtime can make evaluation backlog look like a research plateau.

-

We align common windows by original capture time, retain queue and evaluation duration, and separate automated samples, active submissions and final artifacts. A native active submission cannot fill a blind auto-sampling curve; missing is not zero, and the best sample cannot replace the final delivery. Completed common windows still show the new supplement behind #5844: queueing cannot erase that counterevidence. Conversely, returned later #5844 samples still gain credit, so mid-run slowdown alone does not establish an absence of late potential.

-

Validation and model costs need separate denominators as well. The official repeat also shows concurrent full builds and probes, build interruption and reduced thread settings: validation contention can occur without LoopX. Output tokens divided by task wall time include thinking, tools and waiting; this is not a provider’s pure decoding rate. The evidence supports examining work selection, validation organization and model time together, while their independent contributions remain unresolved.

+

Ad Placement provides a concrete instance of later progress rather than a universal plateau. A worse subsequent candidate was rejected and the best version survived. Its raw-score lead is modest—about 0.052%—and only that arm has the cited terminal-workspace verification. The old/new packages changed core and runner together, so this is not an isolated LoopX-feature effect.

+

The Astra result expands the foundation-model frontier in our observations. Official separated speed changes from search changes and obtained successive native improvements. That progress belongs to the foundation/Official path; it cannot be credited to LoopX. Stronger models also raise the standard for a useful harness: context and review costs must earn their place against an improving baseline.

+

Schema: an initial lead is not sustained improvement

+

Schema is the detailed counterexample. In the Sol old/new 14-hour window, the newer run scored 0.804620 versus 0.723684. It already led at the first native result, 0.794620 versus 0.713158, received at different elapsed times. Subsequent increments were only 0.010000 and 0.010526. The larger endpoint advantage mostly reflected the initial result; continuing code changes did not close the six original target requirements.

+

A separate Astra/xhigh 12-hour comparison was less favorable: Official reached 0.881813 and LoopX 0.786257, with neither improving its best between 6h and 12h. LoopX recorded 36 completed compactions versus four, and about 5.32 times the uncached input. Compaction can overlap useful work, and versions, recovery, shared load and scorer conditions differ. The trace still identifies the practical challenge: producing more changes and more control activity did not produce more accepted value.

+
Conditions and limits of these windows

The Sol old/new study used planned + Explore, Sol/xhigh, TurnEnvelope off, agent-requested native feedback and a one-hour cooldown. The 14-hour window was selected after earlier observations as the largest whole hour below the earliest actual termination; it was not an 18-hour completion. The separate Astra study compares each arm’s own first 12 outer hours, including preparation. The Sol window reconciles 7,522 unique responses and 52 received native results; Astra reconciles 5,277 responses and 45 results. Cumulative counters were not repeatedly added; reasoning is included in output. Historical infrastructure failures and unknown whole-run integrity remain recorded. Different treatments, adaptive restarts and a prior operator exposure to an Official terminal aggregate prevent a clean causal verdict.

- -

8. Assessing the improvements

-

Improvement and technical depth are separate axes. A deep contract repair may eliminate a rare dead loop; a small instruction repair may immediately release substantial work time. We assess the gap removed and its evidence, not PR counts or passed-test totals.

- - - - - - +

4. Ask whether evidence changed the next work

+

A mature checkpoint helps inspect a specific decision boundary. Both receivers inherit the same scientific state and incumbent; we then follow the evidence they read, the experiment they choose, the work they actually perform and the native feedback. A negative local result can be useful if it rules out a branch under stated conditions. Replanning need not force a direction change when continuing is justified.

+

Recent work on #7269 makes the reader first consume the goal, facts and feedback, then the writeback format. It also releases obsolete task-selection preference and preserves the original Turn settlement after a successor is created. This addresses two observed sources of wasted interaction: reading writer instructions before deciding, and needing another round to resolve which work was settled.

+
BoundaryCurrently verifiedStill unproven
Goal and feedbackReproducible ledger misjudgments repaired; full Goal input and same-source horizon have CLI, installed and current-model readbackTask prioritization and net benefit; old checkpoints are not migrated
Research state and recoveryJoint capture, fresh before review, original identity/opportunities/cooldown/deadline, mature-point continuation and further work are inspectableSustained stability as points grow, complete historical cost and a complete user-facing restoration journey
Evidence and reviewConditional capture, later delivery, immediate-predecessor review and real behavior chains; negative results and stale citations preservedExplore beyond session/file memory; correct references yielding better choices
Planned and strideMerged initial-quality/later-gain distinction; questions about retained best, goal bottleneck and actual implementationInitial quality, later gain and cross-task stability after new-source adoption
Effect and efficiencyGraph quality gains outweighed by time penalty; Portfolio transfer counterexamples and a small best gain; episode costs decomposedRepeatable net benefit in clean matched studies, beyond local speed or repair counts
+ + +
Same-point Sol/max continuationBaseline → revisedBoundary
Grid recovery/replan2 → 1 review wakes; 48 → 20 tools; 935 → 400 secondsReview wakes through first joint preparation completion
Schema recovery/replan2 → 1 review wakes; 37 → 17 tools; 1055 → 520 secondsThe same milestone definition
Grid native result ↓2171 → 2165, from inherited 2172Same new submission opportunity; small observed advantage
-

Early system progress supports continued research. Recent work moves the question from sustaining execution to using early experience for better later choices. The changes and cases below separately assess inputs and judgment mechanisms, actual adoption, native outcomes and full cost. These levels cannot substitute for one another.

-

Planned and stride: start well, then measure additional gain

-

The recently merged #6621 restores an important distinction in shared planning: deliver a strong, coherent first artifact feasible within the budget. Do not manufacture a weak start and call repayment of that quality deficit long-horizon capability. Useful diagnostics remain legal, and preparation cannot postpone delivery indefinitely. Later improvement is anchored to the retained best artifact.

-

Stride keeps its three axes: work scope, route distance and validation scope. Its questions more explicitly compare the remaining authoritative gap, limiting component and plausible headroom; check actual implementation of the proposed mechanism; and distinguish an unexecuted change, failed transfer and insufficient route potential. For a candidate’s own screening threshold, ask what goal it protects, how the incumbent behaves under the same control and whether the discrepancy warrants vetoing an informative native evaluation. These guide judgment rather than force a numerical algorithm switch every few Turns.

-

The trajectories also contain more than small parameter changes: full covariance, class-prior and within-class ranking approaches differ in mechanism. The unresolved issue is whether they affect the factors limiting native reward and complete an informative test at proportionate cost. Better questions, correct evidence and larger experiments may help; actual adoption and later outcomes establish their value. Frozen old runs were not hot-updated, so a source merge cannot be credited with changing their choices.

+

Both revised receivers completed the staged reads, writeback and original-Turn settlement in their first autonomous review. Baselines eventually completed too; their extra rounds included useful validation and additional evidence, so the entire difference is not redundant work. Grid’s revised choice led to deeper reuse experiments, independent equivalence checks and broader local validation before its six-point advantage over baseline. Schema found a real registry-lifecycle defect but its new native result stayed at the inherited 0.786257; the baseline had no new result at that cutoff.

+

This is limited positive evidence for the flow, with a small Grid outcome advantage and neutral Schema feedback. It does not establish whole-task acceleration. The study used one pair per case, the same original checkpoint per pair, Sol/max, normal cadence three effective work Turns, and context differencing, TurnEnvelope and stride off. Preparation temporarily used cadence one until the restored semantic review and native Turn completed. It is not a study of repeated steady-state three-Turn reviews.

+

Earlier retained/fresh-context checkpoint work on Graph and Portfolio asked a different question. Its source age, reconstruction charge and continuation phase stay within the original cumulative 36-hour ceiling. An earlier nominal “with #7197” arm never received the staged reader, so its score cannot establish that treatment’s benefit or harm. A later Astra-to-Sol continuation changes model and effort too. These histories remain useful diagnostics, but are not independent cold runs or interchangeable ablations.

- -

9. What the earlier checkpoint comparison exposed

-

2026-10-16 update: checkpoint continuation and trajectory diagnosis under frozen sources, not a new complete benchmark ranking. Historical versions and figures remain distinct. Those four earlier research workers were deliberately stopped; scores, trajectories and archives were retained. Section 10 describes the new study separately.

-

A major recent engineering result is making mid/late research branchable and inspectable. Native execution history, LoopX research state, workspace code, incumbent, public feedback, submission opportunities, cooldown and cumulative budget must be saved at one safe boundary. Code alone loses the reasons for reaching this state; conversation alone loses executable state; successful snapshot creation does not establish restoration and useful continuation.

-
  1. GoalSame source, constraints and remaining budget
  2. CapturePrior work settled; current decision not yet made
  3. ReplanRetained history, or fresh from shared evidence
  4. ExperimentImplement and obtain legal native feedback
  5. AdoptionKeep the best; measure net gain and full cost
-

Joint archive and recapture, complete preparation deadlines and fresh continuation before replanning progressively connect saving, restoration, evidence adoption and further work. Qualification includes isolated Linux, actual native HTTP/SQLite/Docker, ordinary installed packages and mature research points. Scripted models establish the mechanical chain, not model judgment. Concurrent receiver publication, native execution receipts and confirmed cleanup must also qualify together; one independently passing PR does not certify the final integration.

-

One study-design correction was crucial: dump before replan, then let the fresh conversation make the new decision. Reviewing in the old conversation and asking a fresh one to execute that completed decision tests execution context, not fresh replanning; that option has been removed. Both conversations can access the same checkpoint research and original goal. The difference is retained native conversation history. Both arms in that earlier study enabled stride; Section 10 holds stride off. Neither comparison varies stride.

-

Graph: higher classification quality did not improve the full goal

-

That historical Graph continuation pair used frozen LoopX source 7b8b08f8. Native scoring also penalizes solution time. Higher classification/calibration quality need not improve the total. The three bound complete evaluations pass all four checks across ten splits, with no resource penalty:

- - - - +

5. Efficiency means the complete episode

+

The full bill includes model input and output, tool responses and retries, context reconstruction, review and settlement, evaluation, shared resources and operator intervention. Cached input is cheaper than uncached input under some billing arrangements, but it is not free. Reasoning tokens are already part of output. Without actual pricing/account reconciliation, a token vector is evidence about usage rather than a fee estimate.

+
Graph raw scoreQuality termTime penaltyFinal scoreMean solution time
Inherited incumbent0.7537640.0186220.7351426.68 s
New retained-history candidate0.7552890.0228920.73239710.47 s
New fresh candidate0.7547620.0280280.72673417.89 s
+ + + +
#7269 common windowUncached inputCached inputOutput
Grid baseline504,04726,283,904115,147
Grid revised522,198 (+3.60%)35,629,184 (+35.56%)174,366 (+51.43%)
Schema baseline847,12940,725,120113,674
Schema revised622,478 (−26.52%)37,570,432 (−7.75%)113,162 (−0.45%)
-

Quality gains of about 0.001524 and 0.000998 were outweighed by extra time penalties of about 0.004269 and 0.009406. Both arms retained the original best. This locates the next question in the full quality–time tradeoff rather than a higher classification submetric. Single-run timing still depends on conditions; it does not show that fresh context is inherently slower.

-

Portfolio: a larger route can still have insufficient headroom

-

A full-covariance candidate raised mean Sharpe across five public training proxies from about 1.394 to 1.504, yet native Sharpe fell from 1.3731 to 1.3272. Its score was 16.94 against inherited best 20.53. Drawdown and turnover components already earned 15/15 and 5/5 in this sample. Tightening those constraints does not automatically create alpha or risk-adjusted return. A negative result should separate failed transfer, inactive intervention and insufficient route potential before selecting the next experiment.

-

At this stop, Portfolio’s retained-history arm had best legal score 20.54 and fresh had 20.53: a 0.01 increase above the inherited best for the former. Neither Graph arm exceeded its inherited best. Real research, valid native evaluation and incumbent preservation occurred; the small difference establishes no general superiority for fresh, retained or stride. Older fault-affected cohorts, this historical continuation pair and the new study in Section 10 remain separate.

-

A later audit found another input-path defect: checkpoint handoff requested a full-decision capture directory, but the heartbeat renderer also enabled the short TurnEnvelope view. All four recent arms record that implicit activation, so they cannot establish effects on the ordinary default-input path. Pre-decision preflight still retained the complete original packet and required it to be read; this does not show that historical goals or evidence were entirely lost, and shared exposure does not prove no effect. Merged repair #6661 separates capture from input projection, selecting the short view only through an explicit option. The new study in Section 10 uses the ordinary full-input path. Full capture, subsequent selection and actual native restoration still need joint validation; the fix does not erase the historical exposure.

-
How these observations were checked, and what remains unreproducible -

The newer observations were checked by source type, rather than only by recomputing arithmetic printed in the article. The three Graph rows come from complete solver-visible native reports bound to candidate source. The fixed Portfolio study was recomputed from per-case, per-variant records, with digest links between the comparison file and execution engine checked. The scopes below keep denominators, time windows and validation levels separate.

- - - - - -
ObservationSample and verification scopeWhat it does not establish
Graph quality and time penaltyOne incumbent and two new candidates, three complete public-feedback reports; ten splits each, quality minus time penalty equals final score, zero resource penaltyA single timing difference is not a stable causal context effect
Portfolio fixed 2×2Four variants across fourteen cases; reported means for the V7 execution-rule contrast use five public cases; drawdown counts use all fourteenLocal proxy gains do not establish native transfer
Old Graph failures and reviews203 wake receipts recounted by arm; eleven reviews minus the initial review without a predecessor leaves ten reference checksA capture error does not prove a lost checkpoint; repair replay does not prove model adoption
Research-episode costTwo complete Turns for the fixed study; seven complete Turns from covariance design through native feedback and rollback, inherited usage removed, active time and wall time distinguishedScript CPU time is not full research cost, and token counts are not prices
-

The original archives and recomputation materials were supplied to an independent reviewer but are not yet published with this article. Public readers can check its numerical relationships and sample scopes, but cannot independently reconstruct every run from the article alone. Source-repair PRs and a passing page build do not close that data-access gap. A later data release should preserve these source links and negative results, rather than only the best scores.

-
- +

This observation covers the common 82m27s outer window through October 25, 15:42:31 UTC: initial recovery, review, ordinary work and persisted requests in unfinished Turns. Retained native counters from all four stopped arms were reconciled against their shared donor boundaries, with no counter gaps. Last persisted requests differ by up to 2m22s; unpersisted usage remains unknown. Grid’s revised arm used more of all three components; Schema’s did not increase. In the earlier 68m26s window, Grid’s uncached input fell 7.25%; the longer common window reverses that to a 3.60% increase. Choosing only the earlier window would misrepresent the result. Local review savings have not established net savings for the complete episode.

+

Reduce repeated delivery without losing obligations

+

Staged reading and context differencing solve related problems. Staging orders decision evidence before writer instructions. Differencing sends changes against an exact baseline while keeping current controls explicit. Within the same native session and context epoch, the Hook path uses an explicit engineering assumption of continuity after a complete paged read: normally delivered tool content remains usable. It no longer requires full model-input diagnostics during ordinary operation, and a read receipt is not relabeled as independent retention proof. Session changes, observed compaction, incomplete reads and known delivery failures invalidate the baseline; recovery uses the same immutable capture. Missed hooks and unseen downstream truncation can still escape detection and remain validation limits.

+

Historical offline replay illustrates why totals matter: structured Host and native presentation bytes fell 57.72% and 60.23%, while native entry plus full recovery rose 6.37%. These are historical byte observations, not current-head model-token results. An earlier offline probe also reported a 2.25% increase in CLI bytes, but its qualification as an actual CLI delivery measurement was withdrawn: it omitted final CLI compaction and reformatted entry output. That figure remains only as an invalid historical measurement and supports no complete-delivery or cost conclusion. A 60% smaller view cannot be reported as 60% lower total cost.

+

Our current efficiency work connects ordinary and staged delivery to the shared transport, reduces repeated reads and rebinding, and removes avoidable settlement round trips. The default with differencing off matters as much as the opt-in path. Enabled delivery also has to recover correctly and remain easy to activate across the product and benchmark. The reference of 15% for all mechanisms combined remains unqualified; it is neither a separate allowance per mechanism nor a reason to omit failures or reconstruction.

- -

10. From a restorable point to actual research choices

-

Later evidence added through 2026-10-24 19:37 UTC. The October 17 observations below retain their original 11:16 UTC cutoff; later cohorts are separate. Section 9 keeps its frozen versions, scores and stops. These observations do not close the whole scientific study.

-

Executed comparison: hold stride fixed, vary replan context

-

New Portfolio, Graph and Ad Placement donors started from the original objective with gpt-6.1-sol / xhigh, planned + Explore. The host still enforces finite budgets, while #6671 removes host countdowns and persistent runtime guidance from research input. Checkpoint capture is enabled independently, TurnEnvelope and stride are off, and Goal horizon is explicitly on. Native feedback remains agent-requested, with a one-hour cooldown from acceptance and no periodic or extra tail grading. Each frozen run keeps its own revision; cross-task outcomes are not pooled into a strategy-effect estimate.

-

Portfolio and Graph now each have retained-history and fresh arms branching from one mature point. Both arms are stride-off: this comparison examines replan context. The fresh arm resets before any current preparation or review, then decides from the same research evidence and original objective. The point stays immutable; model, Goal, scorer, feedback and cumulative budget are shared. Fresh-specific operational guidance, independent conversations and shared-host contention remain confounds; one point per case cannot establish a general causal context-strategy effect. An Ad same-point pair has not been admitted.

- - - -
Research pointState entering comparisonBudget and observation boundary
PortfolioSource age about 7.22 hours; seven inherited native results and best 23.27Common 1/2/4-hour windows from continuation activation, including installation and preparation; cumulative limit 36 hours
GraphSelected by preregistered age and sealing conditions; source age about 13.59 hours; 14 inherited native results and best 0.844507The same 1/2/4-hour observations; an equal 496-second reconstruction/replay charge, with source age and continuation phase totaling 36 hours
-

Original opportunities and remaining cooldown follow the point; copying it grants neither extra opportunities nor a refill. A relevant qualified repair can justify retiring an affected source to free capacity, retaining every score, failure and stop reason without selecting by reward. The replaced Graph source had 17 completed native results at retirement; only the first 14 captured at the selected point enter its new arms. Later source information is not backfilled into that point.

-

Restored files must also be usable by the ordinary worker

-

One real break was ownership: restored 0700 directories or 0600 files still belonged to root, so the worker could not read them. The selected-research-copy ownership repair has independent review and actual adoption of its candidate source in these Graph receivers. It preserves modes and imports no historical authority. That PR was still unmerged at this section’s cutoff; default installation is not thereby updated. Readability, model adoption, subsequent capture and research benefit have separate acceptance.

-

The Graph point also lacked 37 temporary raw outputs. We regenerated them using only its sealed source, fixed fixture recipes and input digests, checked retained metrics, then sealed shared derived data separately for both arms. Ordinary users in both receivers read matching bytes and modes. Original output digests were absent: this is not original-byte recovery, and the old point was not backfilled. Saving research products under declared workspace coverage remains more reliable than continually repairing temporary paths. #6696 guides that placement; directory capture does not automatically discover every dynamic dependency.

-

Both Graph models read 68 Explore events from the same basis and completed the current Goal’s semantic replan, preparation settlement and research handoff. Their first choice was identical: extending neighbor feature-mass means and standard deviations. Both stopped unchanged retries of rejected candidates and saved the 37 outputs in the workspace. Starting fresh did not itself produce a different first route. Complete experiments, decisions after negative results, the next natural capture and native gain remain to be observed.

-

Portfolio at four hours: a small gain, with the main gap still open

-

At two hours, each same-point Portfolio arm had two new native results and neither exceeded inherited best. By the preregistered four-hour cut, the retained arm submitted its frozen turnover-budget candidate and reached 23.42; fresh retained 23.27. The candidate, saved three-file digests, adopted package and public result were reconciled; no server package-digest attestation exists. This is a +0.15 continuation gain above the chosen point, also below the source donor’s later 23.48, rather than an all-time best.

- - - - - - -
Same four-hour continuation windowRetained historyFresh replan
New completed native results32
Best / gain above inherited best23.42 / +0.1523.27 / 0
Received uncached input tokens2,930,5303,447,509
Received cached input tokens122,126,336130,243,584
Received output tokens556,410520,661
-

The retained arm’s Sharpe moved from 1.8804 to 1.8952 and drawdown from −1.12% to −1.08%, while excess return worsened from −19.46% to −19.49%; IR and Sortino still earned no points. Valid output, better local optimization and a small total-score gain did not close the main return gap. Nor does this justify simply blaming forgotten goals: both arms can read the objective. How they prioritize it, identify the limiting factor and choose experiments still needs inspection.

-

How informative negative results change the next experiment

-

Following its mean-influence audit, fresh tested one fixed Equity-observation repair. Some training averages improved, but the 2020 missing-macro stress path moved Sharpe from about 0.826 to −0.684, drawdown from about 3.00% to 5.34%, and relative terminal wealth down about 529,500. The model retained every result, rejected promotion and kept its native incumbent. This counterexample to one fixed rule does not reject all robust estimators: improved offline input metrics must still survive endogenous holdings, discrete allocation selection and costs.

-

The retained arm also tested distinct mechanisms. A holding-period serial-covariance estimator failed its information gate; fully suppressing discretionary interim short adjustments helped some annual outcomes but hurt half-year performance and short-correlation requirements. Neither route was promoted. Fresh’s subsequent cone-optimization audit remained unfinished at the four-hour cut. Later replay and panel products are not retroactively counted as completed work, much less global-optimality proof. Complete experiments, informative counterexamples, candidate adoption and original-goal gain need separate records. Overlapping windows and case-session totals are not independent sample sizes.

-

Cost ordering changed with the window. Fresh’s received uncached input was about 2.34% higher at one hour, 3.22% lower at two, and 17.64% higher at four; four-hour cached input was 6.65% higher and output 6.42% lower. These records remove inherited thread counters and include compaction and usage already returned for unfinished Turns. Fresh’s first task event also reported context-window metadata of 258,400 versus retained’s 475,000; subsequent events reported 475,000 in both. Event metadata does not establish an effective response limit, but the difference remains disclosed. Unreturned responses, evaluator resources, host admission and complete billing remain separate; qualification and other research on the shared host affect timing. A token vector cannot directly determine net efficiency.

-

Later common windows: retain positive and negative cohorts

-

The later windows are mixed: the newer Sol integration leads on Schema and Ad, while Astra LoopX trails Official on Schema and Grid. Each comparison below retains its own model, versions, clock and validity limits.

- - - - - -
Cohort / task / directionReference → LoopX test best
Sol old/new · 14h
Schema ↑
0.723684
→ 0.804620
Sol old/new · 14h
Ad Placement ↑
49,589,589,573
→ 49,615,495,839
Astra Official/LoopX · 12h
Schema ↑
0.881813
→ 0.786257
Astra Official/LoopX · 12h
Grid ↓
1810
→ 2118
-

The Sol test leads on both tasks, but trajectory matters. Schema already led at its first native result: 0.794620 versus 0.713158, received at different elapsed times. From first result to 14h, gains were only 0.010000 and 0.010526 respectively. Production code kept changing without higher native bests; more local fixes did not close the six original target requirements. Ad is a positive counterexample to a universal plateau: test trailed at the fixed 2h window and led at 14h. Its worse later candidate was rejected, and its available terminal workspace matched the retained best, not the last submission. The other three arms lack equivalent terminal-workspace proof.

-

In the Astra cohort, neither Schema arm improved its best from 6h to 12h. Grid LoopX improved 2159→2118 while Official improved 1862→1810: research continued, but the gap did not narrow. LoopX tested deeper lookahead and broader mutation search, then rejected same-score or worse candidates. Official separated speed from search changes and produced successive native improvements. Schema changed many production paths during its plateau too. Experiment selection and transfer to the original goal matter alongside control cost; a flat score does not imply unchanged code.

-
Recorded whole-window usage and comparison limits - - - - - - - - - -
Cohort / armUncached input tokensCached input tokensOutput tokens
Sol 14h · Schema base5,536,252381,548,9281,621,142
Sol 14h · Schema test7,444,288479,636,0962,078,121
Sol 14h · Ad base5,896,042328,260,8641,656,988
Sol 14h · Ad test4,069,556319,238,7841,341,356
Astra 12h · Schema Official1,663,308133,393,152613,099
Astra 12h · Schema LoopX8,850,328298,377,6001,410,510
Astra 12h · Grid Official1,529,94995,668,352924,127
Astra 12h · Grid LoopX3,479,450213,635,8401,203,790
-

The later Sol old/new study changes both LoopX core and benchmark runner: planned + Explore, Sol/xhigh, TurnEnvelope off, public native feedback, no periodic evaluation, and a one-hour accepted-submission cooldown. Each task has one run per arm. Its 14-hour window was selected after earlier results had been read: the largest whole hour below the earliest actual termination, not a score-selected arm or an 18-hour completion. A separate Astra/xhigh Official/LoopX study uses each arm’s own first 12 outer hours, including preparation. Different treatment packages are not one pooled effect.

-

The Sol window reconciles 7,522 unique response IDs and 52 received native results; Astra reconciles 5,277 responses and 45 received results. Grid LoopX includes one completed timeout result without a numerical score, not a zero. Cumulative thread counters are not repeatedly added; reasoning is included in output. Schema’s account-switch recovery, including work after the chosen point and before the old session stopped, remains charged to its original outer clock. Inherited result aliases do not create new opportunities.

-

Astra Schema LoopX recorded 36 completed compactions versus Official’s four, and about 5.32 times its uncached input. Compaction can overlap work and is not all LoopX overhead; Official also spends some cooldown windows waiting. Both require attribution. Scorers, core/runner sources, evaluation concurrency, actual starts, adaptive restarts and shared-host load differ; an earlier operator read also exposed an Official terminal aggregate. One run per arm, missing billing and incomplete failure/resource accounting prevent a clean causal or net-cost verdict. Stopped or runner-invalid attempts stay historical; valid individual native results do not certify whole-run integrity.

-
-

Actual staged review: adoption improved, decision quality is mixed

-

An earlier nominal “with #7197” arm did not receive its staged reader and cannot count as treated. The later diagnostic uses actual fact reads, autonomous choices and writeback from the same source points: old Astra/xhigh control versus Sol/max continuation, with different versions and two-/four-hour windows. It is not a single-variable ablation. The two new tests stopped under their original finite clock; runner failure and unknown grading remain recorded. Their accepted native submissions can be inspected individually without promoting these runs into qualified benchmark results.

- - - - - -
First explicit replanOld controlStaged continuation
Schema · minutes / commands6.14 / 222.93 / 11
Schema · uncached / cached / output tokens146,208 / 1,979,648 / 6,75333,478 / 3,791,872 / 4,221
Grid · minutes / commands5.40 / 2014.74 / 23
Grid · uncached / cached / output tokens70,829 / 2,204,416 / 10,63636,689 / 5,723,776 / 21,904
-

Schema’s cheap first review selected a legal successor but did not complete the semantic writeback needed for another capture. Including the feedback review gives 17.86 versus 17.64 minutes, with different work in those rounds. Both initially chose CLI checks/configured statuses; a newer lifecycle test exposed stale registration options and improved 4/10→10/10 locally. Later testing of actual stateful execution addressed a more direct original configuration gap than the old compatibility detour. Native best nevertheless remained 0.786257, with one of six complete phases; three new accepted results did not improve the inherited best.

-

Grid’s old control already created successors, changed priorities and compared independent alternatives. Staging did not invent that autonomy. The newer continuation removed an agent-imposed veto against any local regression, kept hard validity/resource constraints and completed deeper-search tests. Its accepted native score improved the inherited point 2172→2163, then regressed to 2165 while 2163 was retained. A later historical point already had 2104. This is a useful local decision/result chain, not proof that every replan became smarter or that extra review paid off. The next discriminating question is whether an original acceptance gap or a falsifiable search/speed hypothesis changes the next completed experiment and its full cost—not whether more reviews are emitted.

-

Raw archives are not released with this article: readers get scope, methods and aggregates, not independent reconstruction of every run. Source qualification, model adoption, retained native gain and complete cost remain separate claims. The caller-convergence proposal above has functional validation, but no new model-outcome measurement here.

+

6. Context validation starts from zero

+

The current context study starts Grid, Schema and Ad Placement from their original tasks with Sol/max and an 18-hour upper limit per case. Historical Official or older LoopX runs provide descriptive references where usable. Their model/effort, source, scorer, opportunity and clock differences remain visible; they are not strict matched controls. A new baseline is warranted where the old material cannot answer the relevant question. Attempts with different source versions, continuity bases or transports are analyzed separately, rather than pooled as one treatment.

+

First verify that actual delivery changes: the initial full read, a subsequent delta with its continuity basis stated, complete fallback after known baseline loss, and a full review-to-work interaction. Then compare useful progress, retained artifacts and the complete usage vector. Requested flags, receipts and smaller local packets cannot substitute for that evidence. If the feature fails its intended behavior, stop the affected attempt, preserve its costs and history, repair it and use a new attempt identity.

+

The first Grid and Ad interactions on the new native Hook path have completed full paging, one delta and subsequent task work. Within each same capture, the delta payload was 19.53% and 19.48% smaller than its corresponding full packet. These are single-read payload comparisons: they exclude page envelopes, subsequent model input, hooks, recovery and review costs. They do not establish lower total cost. A complete review-to-native-outcome cycle, sustained benefit and failure recovery remain to be verified.

Our effectiveness target is useful progress after many hours and reliable retention of it. Our efficiency target is comparable accepted value with less complete cost and human attention. The next result must address both. Current runs retain the original deadline, and failed or replaced attempts retain their costs and history.

-

Scope: earlier EdgeBench Portfolio/Lean; same-point Portfolio/Graph; later Sol Schema/Ad and Astra Schema/Grid; finite Sol/max continuations. Figures retain their stated windows, versions and validity. Public implementation: LoopX; task/evaluation repair: EdgeBench #14. Raw trajectories, hidden evaluator material and runtime credentials are not published here.

- - -
+ + + diff --git a/apps/presentation/site/public/blog/zh/edgebench-feedback-and-memory/index.html b/apps/presentation/site/public/blog/zh/edgebench-feedback-and-memory/index.html index 3b6822df2a..6f313af13b 100644 --- a/apps/presentation/site/public/blog/zh/edgebench-feedback-and-memory/index.html +++ b/apps/presentation/site/public/blog/zh/edgebench-feedback-and-memory/index.html @@ -4,302 +4,91 @@ 让长程 Agent 的下一步有依据:LoopX 语义控制面的阶段性实验 · LoopX - + - + -
← LoopX 博客English
- +
-

Ruiteng Huang · 2026-10-07 · 阶段性研究稿 · 证据截点 14:40 UTC

-

让长程 Agent 的下一步有依据

-

从 EdgeBench 实验理解 LoopX 的长程语义控制面

-

Agent 可以连续工作很多小时,也可以保留完整对话,却仍然沿着一条低收益路线不断前进。LoopX 要解决的核心问题,是让原始目标、已经获得的证据和下一步行动之间,保持可检查、可修订的联系。

-

这段时间,我们在 Portfolio 风险校准与 Lean 形式化证明上研究这个问题。相较最初,两题的 blind 实验已经出现扎实的系统级进步:从长期零分、无效续行和缓慢推进,走到了更多可验证产物、更可靠的持续工作,以及 Lean 共同时间窗内明显更快的证明进展。LoopX 的机制修复、提示与 benchmark 跑法的优化共同促成了这一步。

-

我们的阶段性判断是积极的:长程语义控制面已经在真实任务中展现价值,整套系统也比最初更有效。现在需要拆清各项改进的贡献,并把已出现的进步变得更稳定、可复用。本文同时保留整体改善的证据、具体机制的技术解释,以及尚未解决的反例。

+

黄睿腾 · 更新于 2026 年 10 月 26 日 · 探索性研究

+

让长程 Agent 的下一步有据可依

+

从可信反馈,到持续进展,再到上下文成本

+

长时间运行之后,我们关心三个问题:第一次好结果之后还有什么改善,改善有没有保住,整个过程花了多少成本。

+

我们的 EdgeBench 研究经历了三个阶段:先让评测和续跑可信,再看积累的证据能否改变后续工作,最后削减交付这些证据的成本。早期 Lean 和后来的 Ad Placement 轨迹显示了实际进展。更强的基础模型基线也在前进。这些观察支持继续发展 LoopX,但尚不能分离各机制的贡献及净收益。

+

当前判断是有限正向:已有后程有效工作和恢复复盘流程改善的实例,尚无一般性的因果增益估计,也没有完整费用比较。

- - -

1. 控制面究竟控制什么

-

一个长程 Agent 至少同时维护两种历史。对话历史保留“此前说过、做过什么”;任务与证据状态保留“现在仍然要满足什么,哪些结论在什么条件下成立,下一步为何可做”。两者可以互补,却不能相互替代。恢复同一对话,不代表旧结论仍然适用;把 Todo 勾完,也不代表最初目标已经实现。

-

我们把 LoopX 的技术路线称为长程语义控制面。它围绕任务意义组织执行:原始目标与验收条件约束工作,当前证据支持或反驳路线,运行结果触发继续、重规划、等待或停止。模型负责提出和解释选择;控制面负责保存来源、检查状态转换,并把当前仍有效的义务交还给执行者。

-
  1. 目标验收条件、范围、停止条件
  2. 选择可执行候选与选择依据
  3. 行动工作、验证、真实结果
  4. 证据观察、解释、适用条件
  5. 修订继续、换路、等待或结束
-

这个循环有两个不同的保证层级。系统可以检查一次工作是否有对应结算、证据是否来自指定版本、被拒绝的写入是否留下副作用;它不能仅靠字段检查,证明模型理解了条件或选中了最好路线。协议正确性是可以逐项验证的;认知上的净收益需要行为与结果证据。

-

因此,长程能力不能用运行时长、Todo 数或图节点数替代。我们真正关心的是:在约束不丢失的前提下,系统能否更早排除错误路线、复用已验证结果,并把有限预算分配给有价值的下一步。这也解释了为什么可靠的评分器、恢复协议和上下文组织,会出现在同一项研究里。

-

研究问题:经验能否改善后半程的选择

-

2026-10-10 补充研究问题与比较方法。本次不增加实验成绩;下文数值仍对应各自注明的历史版本与观察窗口。

-

我们希望检验的是:同一模型、可比预算下,通用 harness 能否让 Agent 更有效地积累并使用经验,使执行中后期继续产生可验证的新进展?例如,一条失败路线留下的不应只有“失败过”,还应包括适用条件、排除了什么,以及什么新证据值得重试。是否保存了这条记录、它是否改变下一步、改变是否有效,需要分别检查。

-

同一主会话持续理解目标和解释证据,是观察这一问题的一条路径;跨会话恢复则检验状态能否可靠交接。会话连续本身不保证经验利用更好,fresh-context 与 workflow 也可以通过文件和外部状态保留经验。比较时应记录实际会话策略、信息可用性和交接成本,让结果决定适用范围。EdgeBench §5.2 与附录 G 对持续执行和独立重试、不同 harness 的比较,为这些对照提供了依据;它们并未隔离 LoopX 的增量收益。

-

2026-10-16 续篇沿原章节融入:原目标与恢复、历史证据复核、完整研究成本、planned/stride,以及 决策前 checkpoint 与真实对照、下一批方案。首屏与旧数值保留原截点。

-
- -

2. 两个研究阶段,分别比较

-

早期 Portfolio 与 Lean 研究反馈、持续工作和证据采用,后续从成熟研究点检查选路。下表保留早期五类方式,不是当前启动矩阵。第9节保留早期 stride 开启的对照;第10节将10月17日 stride 关闭的研究,与后续 Sol 新旧版、Astra Official/LoopX 及切模型接续分开陈述。

- - - - - - + +

1. 更多时间,应该换来什么?

+

LoopX 让原始目标、验收条件、工作归属和证据跨会话、跨宿主持久化。控制面约束状态转换,为模型的下一步提供反馈,但不能认证这个选择是否高明。一条发现、一次读取回执、一条 replan 记录都只是中间证据;真正需要追踪的链条,要落到实际工作和经过验证的成果。

+
  1. 目标验收与范围
  2. 证据结果与限制
  3. 决策继续或换方向
  4. 工作执行与验证
  5. 保留保住最佳有效成果
+

我们区分起点优势、后续增量和最佳成果保留。更高的最终分数,可能主要来自更强的起点;更好的中间候选,也可能没有留在终态工作区里。运行更久、Todo 更多、图更大,都不能替代这三项判断。

+

研究重点如何变化

+
执行方式保留什么用来回答什么
官方 worker官方 stop hook 与继续路径官方执行机制能推进到哪里
单次 Codex一次调用,自然结束没有外层续跑时会做多少工作
原生 GoalCodex 的目标执行与继续机制原生长程机制提供怎样的对照
LoopX Resume同会话恢复、Todo、重规划与结算语义控制与可靠续行的实际作用
LoopX ExploreResume 加可选证据记录与探索规划结构化证据是否进入下一次决策
+ + +
阶段问题证据能回答什么
反馈与续跑结果可信、授权工作能持续推进吗?评测缺陷、恢复故障、共同窗口内的系统进展
后续决策积累的证据改善了下一次实验吗?决策到工作的轨迹、成熟研究点之后的变化
上下文效率能否用更低完整成本交付相同义务?实际模型输入、恢复、工具往返和成果/成本比较
-

Portfolio 的历史设计覆盖五种执行方式 × native/blind 十臂;后续只补关键消融。Lean 主要比较 blind。native 可以取得 judge 反馈;blind 保留公开任务、训练数据、本地测试与验证工具,但无法取得 judge 分数和隐藏诊断。后台自动评测是研究者的观察,不向 blind solver 返回。因此 blind 是“无 judge 反馈”,不是“没有反馈”。

-

早期 Portfolio/Lean 和10月17日研究使用 gpt-6.1-sol / xhigh,后续批次分别声明模型与 effort。历史数字保留原预算、采样、评分与日期。Graph/Portfolio 接续保留已用时间、机会与冷却,受其累计36小时上限约束,不是每个 donor 新获36小时;较短观察窗也不代表原计划正常完成。

-

早期比较过预置阶段 Todo(seeded)与由原目标形成计划(planned)、复盘周期、上下文和 Explore。后续研究选择 planned + Explore,并明确每六个已结算有效工作 Turn 复盘;这是当前研究配置,不把旧批次的三 Turn 设置冒充新值,也不改写产品中显式配置的单位。提示、runner 与契约曾一起变化,因此早期 planned 结果不能单独证明普遍优势。

-

早期观察到的整体进步:保留原窗口

-

Lean 提供了较直接的共同时间窗证据。相同 blind 条件下,早期 LoopX v14 与该期 #5844 的有效采样点如下;同一时间能推进更多可验证证明,是实际进展,不能因为尚未拆清贡献就忽略。

-
Lean 原始分数早期 Resume v14#5844 Resume早期 Explore v14#5844 Explore
180 分钟0.11030.34780.11340.4019
450 分钟0.18820.52430.19960.5605
-

这些单次窗口里,该期两条 LoopX 路径约达到早期的 2.8–3.5 倍原始分数。这个倍率描述观测结果;提示、任务入口、runner 与控制机制一起变化,不能作为单项机制的因果增益,也不能直接推广到其他题目。

-

Portfolio 的进步形态不同。最初的长期零分里混有反馈包装和会计契约问题;修正以后,blind 组能产出合法账本、执行本地研究并得到有效评分。旧 Resume 的最好采样分为 17.32,后续 planned v17 达到 25.39,但其最后采样仅 12.38,旧 Resume 的最后采样为 15.57;两批预算和评分版本也不同。该期 #5844 的 Resume/Explore 在约 7 小时 45 分钟时,最好采样为 15.01/12.21,最近采样为 8.15/9.67。可评测性、续行能力与部分最好结果已经跨过早期障碍,终态质量与持续保优仍有明显空间。

-

我们据此肯定“系统整体比最初更有效”,同时保留两个后续问题:收益分别来自哪里,以及怎样避免新版本或更长运行出现回退。改进 benchmark 的跑法——保留共同迭代提示、正确恢复、按题配置采样与预算——本身也是长程系统工程的一部分。研究上需要记录它的贡献,不能把所有增益都记到证据图或 replan 名下。

- -
- -

3. 首先让反馈值得相信

-

最早的 Portfolio blind 零分,暴露了两个不同层次的问题。我们自己的 blind 包装不只移除了 judge 入口,还删掉了持续迭代、保留最好版本等提示;这让反馈消融混入了行为引导差异。修正后用新 attempt 重跑,保留旧结果。随后,对已结束样本的独立对账,又发现了评分器与真实成交语义之间的偏差。

-

一个十行就能说明的问题,可能使整条曲线失真

-

假设账户有 100,000 现金,资产价格从 100 涨到 200。直到第二天收盘才买入 100 单位,并付 10 佣金。买入后立即按同一收盘价估值,权益应为 99,990,NAV 为 0.9999。账户没有赚到买入之前的涨幅。

-

旧重建却用当日收盘后权重乘当日收益,得到约 1.199919992,进而拒绝正确账本。反方向,真实全现金路径 [1, 1, 1] 被报为 [1, 1.01, 1],仅校验期末的函数又会通过。前一个反例证明误拒,后一个证明局部校验漏检;后者不等于“完整 judge 会接受造假”。

-
两个独立反例:收盘后权重误归因此前涨幅;只校验期末遗漏中间 NAV 错误。
评测应从执行与价格重建整条经济路径,不能只核对终点,或用待验证的 NAV 反推自己。
-

对两个冻结的终末样本,我们不导入 solver 的计算函数,独立核对各 243 个交易日:权益残差小于 4×10⁻⁹,NAV 残差小于 5×10⁻¹⁶,股数一致。这证明了特定账本的一致性,没有证明策略优越。另有 7 组相同成交签名,实际上对应独立的现金、库存和费用变化;签名重复只能触发调查,不能代替经济核验。

-
ledger-v2 的关键技术约定 -

新版任务契约固定初始 1,000 万现金、零持仓,交易日收盘执行,5 bps 佣金、1 bp 现金滑点;借券成本按前一收盘空头市值、4% 年率、ACT/365 自然日计提。跨零仓位拆成有序执行腿。逐日验证现金、整数股数、费用、权益、NAV 与权重。

-
权益变化 = 前一日持仓 × 价格变化 − 佣金 − 滑点 − 借券成本
-

校验必须从价格与执行重建,而非信任报告里的现金或 NAV。负例包括费用遗漏、重复执行身份、无经济效果的额外成交、库存转换错误、中间 NAV 篡改、缺失日期与非有限数值;正例包括合法同量成交、周末借券和无交易日。规则变更有独立版本,不追溯替换历史分数。修复与公开契约见 EdgeBench #14。

-
-

修复反馈,不保证策略变好

-

single blind 的账本可以对平,去掉错误 NAV 扣分之后,其他表现小计仍约为 −1.87,截断后仍是零分。另一个样本消除重复签名误罚会得到 18.05 的反事实值,我们没有把它写成正式新成绩。

-

成本归因同样需要经济量而非次数。single blind 的 475 笔成交中,281 笔与对冲相关,但其佣金只约占初始资本 0.0412%;借券成本约为 0.4484%,占总费用 0.7129% 的大部分。题目又要求对冲,不能简单删除空头。真正可检验的问题是:公开训练期的策略选择与后续对冲调整,是否共享成本和风险目标。

-

这一层改进的价值很大,但性质明确:它使研究能分辨真实能力与测量错误,不能算作 LoopX 的求解增益。对正在运行的 blind 组,也不能把终末隐藏诊断变成定制建议。

-
- -

4. 目标、工作与继续执行,必须有不同的结束条件

-

上文数值表保留最初阶段稿的证据截点。以下新增机制与收尾观察更新至 2026-10-08 09:33 UTC;仍属探索性分析,不改变正式计分资格,也不代替完整终态验收。

-

一个具体故障是:seeded-blind 约 34 分钟时写入 no_followup,外层随后恢复了约 100 次,却没有恢复有效工作。调度器还活着,不代表语义上仍有可执行路径。另一类故障相反:模型已经知道需要重规划,控制面却先给出一个必然失败的选项,迫使它调用失败后才获得下一步。

-

根本区别在于:没有现成 Todo,不等于原目标已经完成。完成当前工作后,需要对照原验收判断:是否已满足;是否在已有授权范围内还有合理候选;是否只是在等外部条件;还是确实没有可做的后续。重规划可以生成新的工作,也可以有证据地继续原路线。它不应为了让循环转动而虚构任务。

-

为什么按有效 Turn 复盘,比按完成 Todo 更贴近长程工作

-

长任务可能持续数小时而不完成 Todo,所以复盘应以真实已结算工作为依据。按有效 Turn 触发的修复 已替换旧的隐式 Todo 完成计数;显式历史配置仍保留单位。本文第十节的新研究统一采用六个有效工作 Turn,早期三 Turn 或产品当时的五次设置仅描述对应版本。达到周期要求重新判断,不要求换路,更不授予额外预算。

-

这里的 Turn 不是一句模型回复,也不是一次工具调用。周期依据唯一的工作结算事实:未结算 refresh、重试、重复记录不应凭空增加次数。达到周期只要求重新审视方向,不强迫换路,也不授予额外预算或权限。真实入口已验证 Todo 仍 open 时能触发复盘、确认继续后能再次工作;净效果仍须看模型在复盘时作了什么判断。

-

计数还要区分工作与观察。已验证的负结果可以是有效工作;纯监控轮询、重复提交和未完成结算不能充数。这个区别让长期仍 open 的同一个 Todo 能定期复盘,也避免后台采样把模型推入无意义的 replan。复盘的输出应连接原目标、候选证据和接下来的行动;确认“继续”可以正确,单纯确认“已检查”不足以证明研究方向更好。

-

复盘成本也应按触发原因拆开:周期检查、局部工作完成后的目标缺口、关键假设被新证据推翻,可能需要不同深度的判断。调整周期只影响其中一类;如果每个小任务结束都重建全局计划,减频未必解决问题。另一方面,replan 阶段可能包含有效探测与验证,不能将整段时间都算成管理浪费。需要从轨迹区分有用的路线修订、重复取证和机械记账,再检验局部续行与较重全局复盘的边界。

-

恢复与结算是两条相关但独立的链

-

会话恢复负责保存执行上下文;结算负责把当前 Turn、选定工作、验证结果、持久写回与预算消耗关联起来。丢失响应后的重试,需要识别已有结果,避免重复执行或重复计数。恢复了 session 却丢掉结算,会反复处理同一个障碍;正确结算却恢复错 session,则会丢失求解上下文。

-

早期修复了精确会话恢复、下一步与收据绑定、无效续跑诊断;近期继续补齐 checkpoint 选择跳转与生命周期恢复。当前原则是:从原 Turn 和已提交结果恢复,重复响应不重复执行或记账,独立新工作到来后重新判断合法路径。能恢复正确工作与选出好工作,仍是不同验收。

-

把原目标留在选择工作的视野里

-

以下状态更新至 2026-10-17;保留前文历史窗口,分别核对源码、实际研究采用与效果。

-

近期我们把检查从“是否读了 Goal”推进到“读到的究竟是哪一个目标”。原题仍在提示与任务文件中,模型也确实读取过;但部分 benchmark 新建的结构化 Goal 只有通用研究提醒。一个工作可以满足这句提醒,却离原题的主指标越来越远。另一处信息损失发生在输入投影:借用公开展示过滤器,会因路径或疑似敏感字符串丢弃整个目标段落,或截断研究证据。

-

#6649 因此让新建 Goal 保留原题目标与优先级,并在已授权、同 Goal 的 replan 输入中保留完整来源文本;公开导出的边界另行处理。#6654 则把同源目标投影做成 LoopX 与 benchmark 的默认关闭、显式启用开关。开启后,planning horizon 在选择工作之前呈现原 Objective、来源、独立验收与回读入口;来源改变后,下一次读取随之更新。关闭时保留原 horizon 行为,既有 replan 的 Goal 输入不受这个开关控制。它没有再持久化一份目标,也不靠每 Turn 复制一句“记住目标”。

-

原目标修复 #6649 与 horizon 开关 #6654 均已合并;配置界面、CLI 读回和关闭路径各有验证。第十节的新同点研究实际显式开启同源 Goal horizon,并在当前复盘中读回原目标;旧 checkpoint 仍不自动改写。目标能到达选择入口,不保证模型正确排序目标,更不能用它解释此前所有低分。后续需要核查一次完整实验是否缩小了原题主指标缺口。

-

唤醒失败为什么没有终止整场实验

-

旧 Graph 开关对照中,stride-on 有 20/99 次外层唤醒失败,off 有 14/104 次;成功唤醒内还分别记录了 35、45 次阶段错误。失败集中于复盘、checkpoint 选择或未结算状态恢复。外层运行器仍可继续唤醒;此前已经落盘的候选、原生结果和部分 checkpoint 也不会随一次报错消失。因此实验还能推进,却可能多次恢复同一决定、延迟真实工作,或消耗研究与捕获时间。

-

两臂失败阶段记录的累计耗时约 49、35 分钟,它们不是全部损失,也不能把 20/99 解释成浪费了 20% 的工作。两边故障负担不同,整体差异就混入了恢复成本。选择跳转修复 与 生命周期恢复修复 分别处理具体断点:保留原 Turn 身份,识别已提交结果,在新独立工作到来时恢复合法路径。修复不补提交机会、不重置冷却,也不能把全部历史失败追溯改成成功。后续研究需要新源码的真实采用证据。

+
比较边界

历史研究包含 Official、单次调用、原生 Goal、LoopX Resume 和 LoopX Explore。Explore 在续跑基础上增加可选的证据采集和规划。盲跑仍可使用公开任务、训练数据和本地验证器,但收不到隐藏评测分数和诊断;后台操作者评测不是 solver 反馈。后来的 native-feedback 研究由 Agent 主动申请评测,按已接受提交执行一小时冷却,不做周期评测。这些是不同研究,不能合并成一个处理效应。

模型、effort、提示、runner 和预算共同演化。早期主要用 Sol/xhigh,后来的 Sol/max、Astra/xhigh 批次各自保留条件。每臂一次运行只能提供描述性证据。缺失、主动停止、无效和有效零分分别记录。Checkpoint 接续保留源时间、评测机会和冷却;donor 历史不算新的独立重复。

- -

5. Explore 的难点,是让证据到达一次真实选择

-

我们曾看到 Explore 开关已打开,两个组前 180 分钟的 20 次读取也都经过 hook,图却一直为空。模型并非没有发现:例如它把“有限前缀不能直接继承尾部界限”的反例留在本地验证记录中。缺口在于,工作结果没有自然进入图、关联当前问题,再被下一轮使用。提高读取 quota 无法解决一个尚未发生的写入。

-

因此,改进不只是“提示模型记得写图”。写入通过可选 capability hook 接入普通结果写回:在已有观察与路线决定上,显式补充问题、适用条件、输入版本和结论状态。对于已关联的问题,复用规范范围,减少重复填写;不能从低分自动推断反驳,也不能把“暂时停止”提升成“这条路线永远错误”。

-
    -
  1. 捕获:有价值的工作结果是否写入,拒绝或重试是否可恢复?
  2. -
  3. 关联:结论是否绑定到当前问题和 Todo,条件与版本是否完整?
  4. -
  5. 取回:后续决策是否实际得到它,摘要是否挤掉其他相关反证?
  6. -
  7. 采用:模型是否据此修改或明确维持选择,之后的行动是否一致?
  8. -
-

这四步不能由节点数代替。后来的冻结四组审计,两个 Explore 组分别已有 1 条和 3 条 finding,但检查的 7 个 Todo 都没有图关联。两次首写缺少 node_id,模型转而创建节点,遇到范围冲突,最后手动记 finding。图终于非空,完整采用链仍没有建立。

-

#5889 针对此处摩擦:新问题可由显式问题与适用范围派生稳定身份,冲突返回不一致的字段;已存在范围保持不可变,失败无部分写入,重试不重复添加。写入仍受当前 Todo、claim 与 lease 约束。它修机械身份与错误恢复,不替模型编造科学结论。真实带 lease 的写回与读回已验证;补充运行中也出现了自然捕获、关联和下一轮交付的正例。图相对文件或同会话记忆的增量价值仍未分离。

-

取回端也需要渐进式设计:先覆盖不同问题,再给同一问题更多记录;在小摘要之外提供带版本的分页和按问题展开。初始只显示三条可以是节省上下文的选择,三条成为不可突破的信息上限则会损失决策依据。扩大窗口与准确选择必须一起考察。

-

必须保留的反证:没有图,也可能记住并使用证据

-

Portfolio 轨迹中,有模型保留 12 个变体、5 个训练年份和 4 个暖/冷启动检查的结果;另一组用“训练 Sharpe 不低于基线且换手不高于基线”筛选 9 个候选并全部拒绝。后者不一定是好策略:所有候选训练收益更低,4 个冷启动表现更差,可能把有限搜索锁在过于保守的区域。

-

Lean 的该期 Explore 也会保留难点、记录错误陈述的局部反例,再去做别的章节。这些信息可以由本地文件、Todo 和同一会话携带。要证明图的增量价值,必须指出它额外避免了哪次重复、保住了哪项条件、改变了哪次选择;不能把所有记忆能力归给 Explore。

-

证据存在、行动采用与实际触达,分别验证

-

Portfolio 的一个补充样本把风险研究结论写回,再据此实现并测试尾部保护。但在本期实际输入上,受约束配置与无约束配置仍一致。结论进入代码、压力检查通过,不等于它在这次任务中产生了干预。Lean 的另一条链则从周期复盘声明候选,走到安装证明、全量构建和后续批次;这比节点数更接近采用证据,仍不能排除同会话与本地文件提供了相同信息。

-

边界故障也有研究价值。补充 Lean 运行在给同一个 Todo 关联第九个问题时,遇到最多八个关联的限制。它随后保留原有关联,将额外结论作为 Goal 范围内的独立证据记录,再恢复正常工作。这个限制约束当前任务关联集合,不是整张图最多八条结论。恢复发生不等于没有成本;合理的改进应减少捕获摩擦,同时保住当前决策需要的相关证据,不能靠静默删除旧反证换取成功。

-

复盘要审查紧邻的上次决定

-

历史证据在 checkpoint 中存在、模型曾经读过,与当前 replan 能结构化利用它,是三件事。我们遇到过新 Goal 的 Explore 投影报告“当前图为空”,但归档仍保留历史研究的情况。应修复来源与采用,而非据空投影判定没有经验。接续验证后来覆盖了研究状态、原目标和 Explore 的实际到达;成熟样本包含数十轮工作与上百条证据。这是可恢复性的依据,条目数本身不是研究质量。

-

另一项真实历史审计中,Graph 的 10 次后续复盘有 5 次仍引用更早的决定。这样会跳过刚做完的实验,持续复核一条已经陈旧的路线。沿既有历史序列与 stride owner 的修复,在原始前缀重放中为 10/10 次取得紧邻前次,并拒绝 5 个过期引用。它保证复核对象正确,不能代替模型判断前次是否实施、是否产生新信息,以及是否推进原目标。

-

有判别力的记录应把前次选择 → 实际候选版本 → 完成的实验 → 公开反馈 → 下一次采用或放弃连起来。Explore 的作用也应在这条链上评价:它额外保住了什么条件、避免了什么重复、改变了什么选择。一次新节点、一个 switch 标签或一张分叉图,都不能独立证明这个增量。

-
- -

6. 上下文优化,应围绕决策所需的信息流

-

最初的一个明确冗余是:todo list --todo-id … 已经指定单个 Todo,却在详情、列表和角色视图中重复输出正文。但轨迹进一步说明,精确读取并非主路径:模型也从 Goal 文档、普通 quota 的摘要、批量命令和前轮会话获取 Todo。只把这个单命令缩短,无法解释或解决整体成本。

-

#5844 因此把目标收拢为“当前工作只交付一份有效正文,其他信息按需要读取”。普通 heartbeat/quota 就提供选中 Todo 的完整要求、适用验收、相关开放 User 义务及实际参与的 hook 内容,不依赖启用 TurnEnvelope。已交付的来源不再重复列为待读命令;混合了目标、其他任务与历史的 Goal 文档仍保留精确完整读取。

- - - - - -
路径此前调整后
单个 Todo同一正文出现在三个视图一个完整规范对象;列表查询仍是列表
普通 quota当前工作摘要 + 后续读取命令当前工作的规范正文一次交付 + 剩余来源的读取命令
可选能力关闭通用 skill 仍可能诱导无效读取由参与的 hook 提示;关闭时无相应常规义务
更多背景与证据重复倾倒,或只有短摘要保留来源、完整读取及按问题/版本展开
-
同一合成 Goal 的具体测量,以及它不能说明什么 -

精确 Todo 的输出从 15,986 UTF-8 字节、三份正文,变为 2,721 字节、一份正文。普通 quota 相对命令型版本则从 23,088 增至 27,137 字节,因为附带了实际内容;待读来源从 preference + Goal + Todo 减为 Goal。不能据此宣布总 token 或延迟降低:若旧读操作本来就在一次批量调用里,少一个 CLI 进程未必少一次模型交互。

-

在冻结的 12 个实际 wake 样本中,12/12 获得完整 Todo,9 次来自内联或文件形式的 guard,3 次来自精确读取;另核对的 18 份正文与启动源摘要一致。这验证内容到达及来源一致,不验证理解、完整约束执行或最终净费用。此前“压缩约 78%”的合成结果也只能用于相应输出,不能推广到全程成本。

-
-

当前研究采用的信息组织围绕一次真实决定:当前工作直接得到完整约束;原目标以同源投影进入选择视野,更多历史与证据按适用问题和版本展开。已经交付的同一来源不应再被要求机械回读;尚未交付、来源失败或版本变化时,则沿当前契约取得完整内容。授权范围内的研究输入不应借公开展示规则删掉原目标或反证。优化单位是整条决策路径,而非某个 JSON 的长度。

-

可选能力尤其不能借通用说明越过开关。semantic-preference 关闭却仍因通用 skill 被反复读取,是边界泄漏;#5874 把指引放回参与的 hook。更短的包与更少的无效提示都有价值,但不应删掉验收尾部、适用范围、继续条件和失败恢复。优化单位是整条决策路径,不是某个 JSON 的长度。

-

工具的粒度,应对应一次有意义的操作

-

值得检验的方向是,把状态与恢复的复杂性收进语义完整、边界清楚的工具:例如取得当前工作所需的完整约束,或提交结果并关联它的来源与适用条件。工具内部可以执行多步校验,模型仍负责解释证据和选择路线。Anthropic 的工具设计经验 同样强调按真实工作组织接口,而非把每个底层 API 都交给模型。

-

这不是单纯追求更少命令。接口合并仍须保留权限、失败可见性和重试语义;是否更易学、更少出错,以及节省的交互能否转为有效工作,要通过真实执行验证。#6038 已改善具体 action 的 CLI 帮助与 lease 参数错误恢复;这属于使用路径修复,尚不能据此宣称任务效果或全程成本改善。

-

把一次研究的完整成本作为单位

-

近期 Portfolio 的一次固定 2×2 检查覆盖 14 个本地案例、56 行结果,其中 5 个为公开案例、9 个为合成案例。2×2 比较原 V7 与自适应协方差两种策略,以及对目标总持仓取整与对持仓变动量取整两种执行方式。以下成交数、费用与 Sharpe 均值均取这 5 个公开案例,固定 V7,仅改为持仓变动量取整:平均成交数从 451.2 降到 235.4,约少 47.8%;但费用从 62,683.15 只降到 62,682.18,约少 0.00154%,平均 Sharpe 仅增加 0.000133。另在全部 14 个案例中,有 10 个回撤变差。操作次数变化很大,原目标的变化却很小。这使“减少成交”从看似显著的改进,变成了需要与收益空间比较的候选机制。

-

solver 报告局部计算约用 25.25 CPU 秒;容纳这项研究的两次完整唤醒却约用 29.66 分钟,执行 90 条命令并输出约 6.80 万 token。另一个已完成的协方差研究段,7 次唤醒合计约 68.05 分钟墙钟与 14.47 万输出 token。这里包括模型思考、控制、编写、工具和等待,不是纯解码时间;部分诊断有信息价值,也不能全算管理浪费。但只报告小脚本的秒数,会遗漏决定是否值得继续的主要成本。

-

后续按完整研究段记录代价,再分开活跃工作、恢复、等待与原生评测。会话累计用量必须差分并去重,不能把祖先历史反复加总。局部计算更快、命令更少或 packet 更短,都只有在保持决策信息、并改善有效产出或完整成本时,才构成效率收益。

-

减少 hint,也要让真实调用方使用同一事实来源

-

10月24日的改进把交互分为读事实 → 自主选路 → 读写回格式:减少指定策略的提示,保留原目标、累计要求、公开反馈和执行边界。但源码有 reader,不代表模型已经使用:此前一个名义 test 仍收到旧 guard 和规划提示;后续 Host 审计又发现全量读取指令,以及入口与 writer 重复的结算计划。提案 #7269 在已评审版本 0ddd08ad 收敛 CLI 与 native Host/journal 交付,每轮保留核心 Goal 和当前 horizon,结算计划只交付一次。完整签名原件仍用于核验和恢复;缺少安全 reader 的旧归档保留兼容。它复用既有上下文差分 owner,没有新增缓存或阅读 ACK。下文冻结实验尚未采用这份提案。

-
整段读取的传输:一条路径变小,另一条可能变大 -

固定四个 Schema/Grid 历史快照,对照前一提案与已评审版本。UTF-8 总量包含入口、review、全部已提供的验收补读、适用时的 Explore 和 writer;恢复再加入完整原件。这是离线传输诊断,不是模型 token 或 benchmark 效果。

- - - - - -
读取路径此前字节修订后字节变化
Captured CLI550,039562,429+2.25%
结构化 Host622,317263,115−57.72%
Native renderer647,687257,599−60.23%
Native 加完整原件恢复647,687688,962+6.37%
-

native 路径把一次完整原件读取换成两到三次分段 CLI 读取;工具往返和恢复会抵销部分正常输入节省。与验证并发采集的局部耗时,不是受控延迟实验;外部证据工具正文、模型缓存、输出与账单仍未测。

-

另一项较早的结算诊断在预热后,每个后端交替做八对样本。SQLite 独立/组合 CLI 的中位耗时为 0.807/0.995 秒,File 为 0.796/1.018 秒;回传字节约少 46%,配对进程时间却约多 24%。一次操作者调用仍启动两个完整 CLI 并回读权威状态。可能减少的模型交互尚未实测,旧轨迹两次工具之间的时间也含推理与验证。

-
-

成本覆盖同样重要。下文有限 Sol/max 接续的逐响应核对,在 compaction 邻近找回 native notice 漏掉的 Schema 三条、Grid 两条用量:分别为 23,740 和 14,619 输出 token。正式 replan 占外层时钟 7.35% 和 8.94%,但首个原生任务之前已用约 21%。准备包含恢复、验证、修复和启动间隙,不全是复盘。因此全部机制合计 15% 的参考线仍未资格化:有效研究、控制、失败、共享资源与真实费用尚未全部拆账。

+

2. 先让反馈与续跑可信

+

最初的 Portfolio 实验先暴露了测量和执行缺陷。一个盲跑 wrapper 在移除评测入口时,也删掉了迭代优化提示;一个账本检查把更早的市场收益归给了收盘时才买入的持仓。它们都混淆了原本的比较。修复后必须另起尝试,旧结果继续保留。

+

一个小反例就能说明记账问题:初始现金 100,000,在收盘价 200 时买入 100 单位并支付 10 手续费,即时权益应为 99,990,NAV 为 0.9999;新持仓没有赚到此前从 100 涨到 200 的收益。之后,对两个冻结样本独立重建,各自 243 天全部吻合,权益残差小于 4×10⁻⁹,股数没有差异。这证明账本一致,不证明投资策略优秀。版本化修复见 EdgeBench #14。

+

续跑也有类似问题:某个工作项结束后,外层进程可以不断唤醒,却没有恢复出有用的下一步。判断必须回到原始目标。Todo 完成之后,可以继续实验、等待或结束,但它本身不能代表 Goal 验收。可靠反馈与恢复让之后的研究变得可解释。

+

早期系统进展可以量化

+
盲跑 Lean 原始分早期 Resume v14后期 Resume(#5844)早期 Explore v14后期 Explore(#5844)
180 分钟0.11030.34780.11340.4019
450 分钟0.18820.52430.19960.5605
+

这些单次运行的共同窗口里,后期原始分约为早期的 2.8–3.5 倍。提示、任务入口、runner 可靠性和 LoopX 机制一起变化。它支持整体系统有进展,不足以归因给某个机制,也不能保证其他题的终态表现。

- -

7. Lean 的历史反例:中期减速与候选分配

-

改进后的 #5844 Resume/Explore 两组在早期推进较快,中期被历史原生 Goal 超过。分析取各组 180–360 分钟的共同窗口,使用 solver 可见的工具结果和冻结源码快照;该期两组同源于 c0d519cf,历史 Goal 为 c46f397c。模型与公开任务摘要一致,日期、runner、提示和预算不同,每格一次,所以这是路线诊断,不能当作干净的框架因果比较。

- - - - +

3. 第一次好结果之后,还发生了什么?

+

后来的实验把重点转向十几个小时之后的工作。先比较共同观察窗口,再拆开起点、后续增量和保留的候选。只看终点排名,很容易混淆它们。

+
blind 组180 分钟原始分360 分钟原始分同期净减少 sorry涉及文件
Resume / planned / #58440.34780.491950217
Explore / planned / #58440.40190.514744218
原生 Goal / 历史基线0.30130.64771,01541
+ +
历史批次观察结果含义
Sol/xhigh,新旧 LoopX,Ad Placement · 14h49,589,589,573 → 49,615,495,839新版 2h 时落后、14h 时领先,终态工作区与保留的 best 一致
Astra/xhigh,Official Grid · 6h → 12h1862 → 1810,越低越好更强的基础模型基线仍在后程产生有效改善
-

只列已有效返回的采样点;原始分为 0–1 表示,未乘 100。sorry 从源码词元计数,排除字符串和注释;不是已证明定理数,也不是完整性认证。这些行保留当时的共同窗口,不随后续运行状态改写。

-

证明工作量与即时分数不是一回事

-

本题围绕固定原声明,检查公理依赖和原类型,基线不合格声明分母为 2,901。删除一个 sorry、增加 helper、局部编译成功和新增一个有效计分声明,并不等价。桥接自定义定义与 Mathlib 可能先投入再产生下游收益;若下游仍依赖 sorryAx,局部填洞未必获得对应信用。原陈述缺条件时,也不能通过偷偷改签名“完成”。

-

该期两组大体按章节推进,中期进入极限、级数、重排和极值。Resume 某个 Appendix B.2 Turn 用 16.6 分钟填 6 个洞,Explore 的 Section 8.5 Turn 用 31.5 分钟填 77 个洞,并留下困难点、记录两个原始错误陈述的反例。这些时长包含证明、验证与结算,不能当作纯证明耗时。它们说明有效工作中存在不直接换成正分的部分。

-

历史基线提示的是候选分配问题

-

180–360 分钟,Resume 的净填洞主要来自第 5/6 章(213/223),Explore 来自第 6/7/8 章(223/79/140)。历史 Goal 除这些区域外,还推进第 9/10 章、Misc 和 MeasureTheory;这四个区域贡献 344 个净减少洞。它在 41 个文件中推进,该期两组为 17/18 个。后者不只是“同样证明做得更慢”,也做了不同的工作。

-

不过,“LoopX 不会换路”同样不成立。Resume 约 197 分钟明确调整满射与保序桥接;约 252 分钟识别陈述限制后,从基础 Todo 切换到后续章节。Explore 约 325 分钟保留重排难点、转入 8.5,约 352 分钟保留反例后转入 9.1。复盘在发生,也有实质决策;尚缺的是:是否系统比较了少量可做候选及近期验证成本,从而改善预算分配。

-

目前没有证据支持“管理包越跑越大”

-

同一会话累计用量端点做差,Resume 前/后三小时输出约 303k/289k,Explore 317k/292k。含 LoopX 调用的工具事件输出量也从 1.14MB/0.72MB 降至 0.47MB/0.33MB。后者可能混合其他操作,只是传输观察,不能当精确控制开销;它至少不支持中期包体膨胀的解释。

-

已收集的成功全量构建日志中,声明审计 job 的前/中期时长总和也未增加:Resume 318/257 秒,Explore 181/119 秒,样本数分别为 14/12 与 7/5。对应 180/360 分钟评测的排队约 1.7–3.4 秒、运行约 7.2–11.2 分钟。回显延迟会使页面暂时缺点,但不能解释已经完成的这两个捕获时点的斜率。失败重试和全部验证成本仍未完整覆盖。

-

所以,下一步不该只提高 quota 或复盘频率。更值得检验的是:候选路线是否可比较,必要依赖与可独立推进部分是否区分,困难点是否保留复访条件。控制面应让这些判断有据可查,而不应把 Lean 的题目知识或隐藏分数硬编码为通用规则。

-

读曲线要分开三个时钟

-

求解器已经工作多久、源码在何时被捕获、分数在何时返回,是三个不同的时钟。Lean 全量构建和声明审计耗时较长,采样还可能排队;页面最近一次返回的分数,因此可能描述几小时前的源码。把它画在当前运行时长上,会把评测积压误读为研究停滞。

-

我们按原始捕获时点对齐共同窗口,保留排队与评测耗时,并区分自动采样、主动提交和最终产物。native 的主动提交不能补进 blind 的自动采样曲线;缺失点不能填零,最好采样也不能替换最后交付。已完成的共同窗口里,新补充组相对 #5844 的落后仍然存在,排队解释不能抹掉这项反证。另一方面,#5844 后段已返回采样仍有增益,也不能仅凭中期减速判定长程控制没有后期潜力。

-

验证成本与模型成本也要分开。官方重复组同样出现全量构建与探针并发、构建中止和降低线程数的轨迹,说明验证资源竞争可以在没有 LoopX 的路径上发生。输出 token 除以任务墙钟时间,包含思考、工具和等待,并非服务商的纯解码速度。当前证据支持同时考察工作选择、验证组织和模型时间;它还不能给出各因素的独立贡献。

+

Ad Placement 说明后程并非必然平台期:后来的差候选被拒绝,最佳版本保住了。原始分领先约 0.052%,幅度不大;这里的终态工作区核验也只覆盖这一臂。新旧包同时改变 core 和 runner,不能当作某个 LoopX feature 的独立效应。

+

Astra 的结果推进了我们观察到的基础模型能力边界。Official 将速度修改和搜索修改分开,得到连续的原生改善。这项进展属于基础模型/Official 路径,不能算到 LoopX 头上。更强模型也提高了 harness 的要求:面对不断进步的基线,上下文与复盘成本必须换来相应价值。

+

Schema:起点领先不等于持续改善

+

Schema 是这里展开的反例。Sol 新旧版 14 小时窗口,新版 0.804620、旧版 0.723684。但第一次原生结果已经是 0.794620 对 0.713158,且收到反馈的耗时不同。后续增量仅为 0.010000 和 0.010526。较大的终点优势主要来自起点;后续不断改代码,仍未完成原始六项目标。

+

另一组 Astra/xhigh 的 12 小时比较更不利:Official 达到 0.881813,LoopX 为 0.786257,两边 6h 到 12h 的 best 都没有提升。LoopX 记录了 36 次完成的压缩,Official 为四次;未缓存输入约为其 5.32 倍。压缩可能与有效工作重叠,版本、恢复、共享负载和评分条件也有差异。但轨迹仍指出了实际挑战:更多改动和控制活动,没有转化为更多验收价值。

+
这些窗口的条件与限制

Sol 新旧研究采用 planned + Explore、Sol/xhigh、关闭 TurnEnvelope、Agent 主动申请 native feedback、一小时冷却。14h 是读过早期结果后,按最早实际结束时间以下的最大整小时选定,并非完成 18h。另一组 Astra 比较各臂自己的前 12h,包含准备。Sol 窗口对齐了 7,522 个独立 response 和 52 个收到的原生结果,Astra 为 5,277 个 response、45 个结果;累计计数没有反复累加,reasoning 已在 output 中。历史基础设施失败及整次运行完整性未知继续保留。处理包不同、自适应重启,以及此前操作者读到过一个 Official 终态汇总,都限制了因果判断。

- -

8. 怎样评价这批改进

-

改善程度与技术深度是两条轴。一项深层契约修复可能只消除罕见死循环;一个简单的提示修正可能立刻释放大量工作时间。我们按解决的缺口与证据评价,不按 PR 数量或通过测试数排序。

- - - - - - +

4. 证据有没有改变下一步工作?

+

成熟 checkpoint 可以帮助观察一个具体决策边界。接收者继承相同科学状态和 incumbent,再追踪它读了什么证据、选了什么实验、实际做了什么、原生反馈如何。负向本地结果若能在明确条件下排除一条分支,也有价值。继续原方向有依据时,replan 不必强行改道。

+

近期 #7269 让 Agent 先读目标、事实和反馈,再读写回格式;释放过时的任务选择偏好,并在创建 successor 后保留原 Turn 的结算身份。它对应两个真实往返来源:决策前先读大段写入指令,以及后续任务创建后还要补一轮确认结算归属。

+
研究边界当前已验证仍待证明
目标与反馈账本误判可复现并修复;原 Goal 完整输入及同源 horizon 已有 CLI、安装与当前研究的模型读回任务优先级和净收益;旧点不自动迁移
研究状态与恢复联合捕获、决策前 fresh、保留原身份/机会/冷却/时限、成熟点接续和再次工作可检查不断增长研究点的长期稳定性、完整历史成本与用户端完整恢复旅程
证据与复盘条件化写入、后续交付、紧邻决定复核和真实行为链能核对;负结果与旧引用均保留Explore 超出同会话/普通文件记忆的增量;正确引用能否转成更好选择
planned 与 stride已合并首次质量/后续增益区分,围绕 retained best、目标瓶颈和实际实施提出判断问题新源码采用后的首次质量、后期增益与跨任务稳定效果
效果与效率Graph 质量增益被时间罚抵消,Portfolio 局部迁移反例和小幅 best 增益;完整研究段成本可分解干净匹配实验中的可重复净收益;不以局部速度或修复次数替代
+ + +
同点 Sol/max 接续基线 → 修订口径
Grid 恢复复盘2 → 1 次复盘唤醒;48 → 20 次工具;935 → 400 秒累计至首次联合准备完成所指的复盘
Schema 恢复复盘2 → 1 次复盘唤醒;37 → 17 次工具;1055 → 520 秒相同里程碑口径
Grid 原生结果 ↓2171 → 2165,继承 best 为 2172相同新提交机会;观察到小幅优势
-

早期整体进步支持继续研究这条路线;近期则把问题从“能持续工作”推进到“能否利用前半程经验改善后半程”。下面两项改动与真实案例,分别评价输入与判断机制、实际采用、原生收益和完整成本。不能把这些层级互相替代。

-

planned 与 stride:先做好,再判断还能提高多少

-

近期已合并的 #6621 把一个重要区别放回公共规划入口:首次交付应是预算内强而完整的可行产物,不能故意交一个弱起点,再把修复这份质量欠账称为长程能力;有价值的诊断仍然允许,也不能为了“准备充分”无限推迟交付。后续进步则以保留的最好产物为锚点。

-

stride 继续使用工作范围、路线距离和验证范围三个轴。它现在更明确地要求模型比较剩余原目标缺口、限制项与收益空间,检查提出的机制是否真正实施,并区分未实施、迁移失败与路线潜力不足。对候选自设的筛选阈值,还要问:它保护什么目标,同条件 incumbent 如何,以及这个差异是否足以否决一次有信息价值的原生评测。这些是更好的判断问题,不是强制每隔几轮换算法的数值规则。

-

研究轨迹也并非只有小范围调参:已出现完整协方差、类别先验与类内排序等不同机制尝试。真正缺口是,它们是否触达限制原生收益的因素,以及是否以相称成本完成检验。新指引、正确证据与更大实验都可能有用,但只有实际采用和后续结果才能说明收益。旧实验未热更新,不能据源码合并宣称已改善它们的选择。

+

两道修订臂都在第一次自主复盘完成分段读取、写回和原 Turn 结算。基线最终也完成了;额外轮次还包含有用验证和新增来源,不能把所有差额算作冗余。Grid 修订臂选择更深复用,进行了独立等价检查和更广的本地验证,最后比基线低六分。Schema 找到了真实的注册表生命周期缺陷,但新原生结果仍为继承的 0.786257;截止时基线没有本轮新结果。

+

这是流程的有限正向证据,伴随 Grid 小幅成果优势、Schema 反馈中性,不等于全任务加速。这组每题一对、各对同一原 checkpoint、Sol/max、普通 cadence 为三个有效工作 Turn,差分、TurnEnvelope 和 stride 关闭。恢复准备阶段暂用 cadence 一,直到语义复盘与原生 Turn 完成。它不是多轮稳定态三 Turn 复盘研究。

+

更早 Graph、Portfolio 的 retained/fresh-context 接续回答的是另一问题;源点龄、重建费用和接续仍算在原累计 36h 内。早期一个名义上“with #7197”的臂没有实际收到分段 reader,其得分不能判断该处理有益或有害。后来的 Astra 到 Sol 接续又同时换了模型和 effort。这些历史有诊断价值,但不能当成独立冷启动或互换的消融。

- -

9. 历史同点研究暴露了什么

-

2026-10-16 更新:下文为冻结源码下的 checkpoint 接续与轨迹诊断,不是新的完整 benchmark 排名。旧数值与版本保留;该轮四个研究 worker 已主动停止,分数、轨迹和归档保留;第十节另列新研究。

-

近期工程工作的主要产出,是让中后期研究变成可分支、可检查的实验。原生执行会话、LoopX 研究状态、工作代码、incumbent、公开反馈、提交机会、冷却与累计预算必须在同一个安全边界保存。只复制代码,会丢失“为何走到这里”;只保存聊天,会丢失可执行状态;只看到 snapshot 成功,又不能证明新实例能够恢复并继续。

-
  1. 原目标同一来源、约束与剩余预算
  2. 决策前存档上一工作结算,当前决定尚未发生
  3. 两种复盘保留会话,或 fresh 从共享证据决策
  4. 真实实验实施候选,取得合法原生反馈
  5. 采用与代价保留 best,核净增益与全研究成本
-

联合归档与再次捕获、准备阶段完整时限,以及 决策前 fresh 接续,逐步把保存、恢复、实际证据采用和再次工作接起来。资格验证包含隔离 Linux、真实 native HTTP/SQLite/Docker、普通安装包与成熟研究点;脚本化模型只证明机械链路,不证明模型选路。并发 receiver 的归档发布、原生执行回执和清理确认也要组合验证,不能拿某个独立 PR 的通过替代最终集成。

-

这里纠正过一次实验设计:必须在 replan 之前 dump,再由 fresh 会话重新决策。“在旧会话复盘完,再让 fresh 执行旧决定”测试的是执行上下文变化,不能回答 fresh replan 是否选得更好;该旧选项已经移除。新旧会话都可以访问同一 checkpoint 的研究证据与原目标,区别在于是否保留原生对话历史。该历史两臂均开启 stride;第十节的新上下文对照则统一关闭 stride,分别保留。

-

Graph:分类改善为何没有变成净收益

-

这对历史 Graph 接续沿用冻结 LoopX 源码 7b8b08f8。原生分数还扣除解题时间成本;只提高分类与校准质量,并不一定提高总目标。三个可绑定的完整评测均通过 4/4 检查、覆盖 10 个 split,未受资源罚:

- - - - +

5. 效率要算完整过程

+

完整账单包括模型输入输出、工具响应与重试、上下文重建、复盘结算、评测、共享资源和操作者介入。缓存输入在部分计费条件下更便宜,但不是免费;reasoning 已在 output 里。没有实际价格与账户对账,token 向量只能描述用量,不能直接当作费用。

+
Graph 原始分质量项时间罚最终分平均解题耗时
继承的 incumbent0.7537640.0186220.7351426.68 秒
保留会话的新候选0.7552890.0228920.73239710.47 秒
fresh 的新候选0.7547620.0280280.72673417.89 秒
+ + + +
#7269 共同窗口未缓存输入缓存输入输出
Grid 基线504,04726,283,904115,147
Grid 修订522,198(+3.60%)35,629,184(+35.56%)174,366(+51.43%)
Schema 基线847,12940,725,120113,674
Schema 修订622,478(−26.52%)37,570,432(−7.75%)113,162(−0.45%)
-

相对 incumbent,两项质量增加约 0.001524、0.000998,时间罚却增加约 0.004269、0.009406,均吞掉收益。两臂最后都保留原 best。这个 case 把下一问题定位到完整质量—时间权衡,而不是继续追更高的分类子指标;单次耗时仍受运行条件影响,不能由此断言 fresh 天生更慢。

-

Portfolio:更大路线也可能没有足够收益空间

-

一次完整协方差候选在五段公开训练代理上的平均 Sharpe 从约 1.394 升至 1.504,原生 Sharpe 却从 1.3731 降至 1.3272,候选得分 16.94,低于继承 best 20.53。该样本的回撤、换手约束项已分别取得 15/15、5/5;继续加严这些约束,并不自动补足 alpha 或风险调整收益。对负结果,应区分条件不迁移、干预未触达和原路线收益空间不足,再决定下一实验。

-

本轮停止时,Portfolio 保留会话臂的最好合法成绩为 20.54,fresh 为 20.53;前者比继承值高 0.01。Graph 两臂均未超过继承 best。它们说明真实研究和有效原生评测发生了,也保住了 incumbent;不能由这个小差异证明 fresh、retained 或 stride 的普遍优越性。历史故障组、最新接续组和今后新版本研究必须分开。

-

随后还发现一个输入路径缺陷:checkpoint 交接请求了完整决策捕获目录,heartbeat renderer 却同时开启 TurnEnvelope 短包。近期这四臂的实际回执均记录了这种隐式开启,因而不能作为普通默认输入路径的效果证据。决策前预检仍保留并要求读取完整原始包,不能据此断言历史目标或研究证据全部丢失;也不能从两臂共同受影响推断没有影响。已合并修复 #6661 将捕获与输入投影分开,只有显式开关才用短包。第十节的新研究采用独立捕获和普通完整输入路径;该通过不追溯消除历史混杂。回执准确记录了配置,并不证明配置符合研究设计。

-
这些观测怎样复核,哪些还不能复现 -

上述新观察按来源类型分别核对,而不是只复算文章中的加减法。Graph 的三行取自 solver 可见的完整原生报告,按候选源码与报告绑定;Portfolio 的固定实验从逐案例、逐变体记录重新计算,校验比较文件与执行引擎的摘要关联。下面列出各项口径,避免把不同分母、时间窗或验证层级拼成一个结论。

- - - - - -
观察样本与复核口径不能由此推出
Graph 质量与时间罚同一 incumbent 与两个新候选,三个完整公开反馈报告;各 10 个 split,质量减时间罚等于最终分,资源罚为零一次耗时差异不是上下文策略的稳定因果效果
Portfolio 固定 2×214 案例 × 4 变体;所列 V7 执行方式对照的均值取 5 个公开案例,回撤计数取全部 14 例本地代理改善不等于原生迁移
旧 Graph 故障与复盘203 条 wake 回执分两臂重数;11 次复盘去掉没有前次的首次,留下 10 次引用检查捕获报错不等于必然丢点;修复重放不等于模型已采用
研究段成本固定实验取两个完整 Turn;协方差研究取设计至原生反馈和回退的七个完整 Turn,剔除继承用量,分别记活动时间与墙钟脚本 CPU 时间不是完整研究成本,token 数不是价格
-

原始归档与复算材料已提供给独立 reviewer,但尚未随本文公开。现阶段公开读者可以核对本文的数值关系与样本口径,不能仅凭文章独立重建全部运行;源码修复 PR 和页面构建通过也不能填补这个数据可访问性缺口。后续数据发布应保留这些来源关联与负结果,而非只发布最好分数。

-
- +

这里覆盖截止 10 月 25 日 15:42:31 UTC 的共同 82 分 27 秒外层窗口,包含初始恢复、复盘、普通工作和未结束 Turn 已落盘请求。以四臂停止后保留的原生计数复核,扣除同一源点的历史用量,未发现计数缺口。各臂最后落盘请求最多相差 2 分 22 秒,尚未落盘的用量仍未知。Grid 修订臂的三类用量都更高;Schema 三类都未增加。早先 68 分 26 秒窗口里 Grid 未缓存输入下降 7.25%,延长共同窗口后却转为上升 3.60%,说明不能择取早期窗口来宣布节省。局部复盘减负未证明整段过程净省钱。

+

减少重复交付,同时保留义务

+

分段读取与上下文差分处理相关但不同的问题。分段把决策证据放在写入指令之前;差分只传相对精确基线的变化,并保持当前控制条件显式可见。原生 Hook 方案在同一会话、同一上下文周期内,完整分页读取后采用明确的连续性工程假设:这些内容经过正常工具交付后仍可使用。它不再要求常态开启完整模型输入诊断,也不把读取回执冒称为独立的保留证明。会话变化、已观察到的压缩、读取不完整或已知交付失败会使基线失效;恢复取自同一份不可变捕获。遗漏的 Hook、不可见的下游截断仍可能逃过检测,必须保留为验证边界。

+

历史离线回放说明了为什么必须算总量:结构化 Host 和原生呈现字节下降 57.72%、60.23%,原生入口加完整恢复上升 6.37%。这些是历史字节观察,不是当前提交的模型 token 结果。早期离线探针还曾报告 CLI 字节增加 2.25%,但因漏掉最终 CLI 压缩并重新格式化入口,已撤回其实际 CLI 交付测量资格。该数字仅作为无效历史记录保留,不用于完整交付或成本结论。不能把视图缩小 60% 写成总成本下降 60%。

+

当前效率工作把普通入口、分段交付接到共享传输,减少重复读取和重新绑定,消掉可避免的结算往返。差分关闭的默认路径同样重要;开启后也必须正确恢复,并让产品和 benchmark 都易于启用。所有机制合计 15% 的参考目标尚未完成资格验证;它不是每个机制各有一份额度,也不能用来漏记失败和重建成本。

- -

10. 从可恢复的点,走到真实研究选择

-

新增证据至 2026-10-24 19:37 UTC。下文10月17日观察仍保留原11:16 UTC截点,后续批次单列;第9节保留原冻结版本、分数与停止状态。以下观察未完成整场科学验收。

-

已执行的比较:固定 stride,改变复盘上下文

-

新的 Portfolio、Graph、Ad Placement donor 已从原目标启动,采用 gpt-6.1-sol / xhigh、planned + Explore。宿主仍执行有限预算,但 #6671 不再把宿主倒计时或常驻 runtime guidance 塞入模型研究输入。checkpoint 独立开启,TurnEnvelope 与 stride 关闭,Goal horizon 显式开启;原生反馈仍由模型主动提交触发,受理后冷却一小时,无周期或额外尾评。各冻结运行保留自己的版本,跨题结果不合并估计策略效果。

-

当前已从 Portfolio 与 Graph 各一个成熟点分出保留上下文和 fresh 两臂。这次两臂均为 stride-off,检验的是复盘上下文。fresh 在任何本次准备或复盘之前重置,再从同一研究证据与原目标作决定。原点不改,模型、Goal、评分器、反馈与累计预算保持一致;fresh 的操作说明、独立会话与共享宿主竞争仍是混杂,单点两臂不能建立上下文策略的一般因果结论。Ad 的同点对照尚未准入。

- - - -
研究点进入比较的状态预算与观察边界
Portfolio源龄约 7.22 小时;继承 7 次原生反馈与最佳 23.27按接续激活后的 1/2/4 小时共同窗口观察,安装与准备计入;累计上限 36 小时
Graph按预定时间与封存条件选点,源龄约 13.59 小时;继承 14 次原生反馈与最佳 0.844507同样观察 1/2/4 小时;共同重建和复算另等额扣除 496 秒,源龄与接续阶段累计 36 小时
-

原生机会和剩余冷却随点保留,不能靠复制获得额外机会。相关修复通过资格验证后,可以主动停止受影响旧源,为新比较释放容量;保留其全部分数、失败与停止原因,不按分数挑赢家。被替换的 Graph 源在停止前已有 17 次已完成原生结果,只有所选点的前 14 次进入新两臂。旧源后来得到的信息不补进原点。

-

恢复出的文件,还要能被普通工作用户使用

-

一个实际断点是:目录虽被还原,0700 目录或 0600 文件仍属于 root,工作用户读不到。所选研究副本的所有权移交修复 已独立评审,并在本次 Graph 研究接收端实际采用候选源码;它没有放宽文件模式,也不移交历史权限。该 PR 在本节截点仍未合并,不能称默认安装已更新。资料可读、模型采用、后续捕获与研究收益分别验收。

-

Graph 点中另有 37 份临时原始输出缺失。我们只用该点封存的源码、固定生成方法和输入摘要重建,核对保存的指标,再将共同派生数据单独封存供两臂使用;两边普通用户实际读到的字节和模式一致。原始输出摘要缺失,因此不能称为原始字节恢复,也没有回填旧点。预先把科研产物保存到声明覆盖的工作区,仍比不断追补临时路径可靠;#6696 提供这种引导,目录捕获并不自动发现全部动态依赖。

-

Graph 两边实际读取了同一来源的 68 条 Explore 事件,并完成当前 Goal 的语义 replan、准备结算与任务交接。第一选择相同:扩展邻居特征质量的均值与标准差;两边都停止原样重试已否定的候选,并把 37 份输出保存进工作区。fresh 启动本身没有带来第一条路线分化。完整实验、负结果后的选择、下一次自然捕获与原生增益仍待观察。

-

Portfolio 四小时:出现小增益,主目标缺口仍在

-

同点 Portfolio 的两小时观察里,两边各新增两次原生评测,都没有超过继承最佳。到了预定四小时截止,保留上下文组把已冻结的换手预算候选送入原生,得到 23.42;fresh 组仍保留 23.27。提交前候选、保存的三文件摘要、实际采用包与公开结果已对应核查,服务端尚无包摘要证明。它是相对该点的 +0.15 接续增益,也低于源 donor 后来取得的 23.48,不能写成历史最佳。

- - - - - - -
同一接续四小时窗口保留上下文fresh 后复盘
新增已完成原生结果32
最佳 / 相对继承值增益23.42 / +0.1523.27 / 0
已回执未缓存输入 token2,930,5303,447,509
已回执缓存输入 token122,126,336130,243,584
已回执输出 token556,410520,661
-

保留组的 Sharpe 从 1.8804 到 1.8952,回撤从 −1.12% 到 −1.08%;超额收益却从 −19.46% 到 −19.49%,IR 与 Sortino 仍没有得分。合法输出、较好的局部优化和小幅总分增益,都没有解决主要收益缺口。这个结果也不支持简单归因于模型忘了 Goal:两组能读到原目标,还要检查它们怎样排序目标、诊断限制项与选择实验。

-

有信息的负结果,怎样改变下一项研究

-

fresh 组根据均值影响审计,试验一个固定的 Equity 观测修复。部分训练均值改善,却在 2020 缺宏观输入的压力路径上将 Sharpe 从约 0.826 降到 −0.684、回撤从约 3.00% 增至 5.34%,终值相对减少约 52.95 万。模型保留全部结果并拒绝推广,继续保留原生 incumbent。固定规则的这个反例不排除所有稳健估计方法;它说明离线输入指标改善还必须经过真实持仓、离散选仓与成本链检验。

-

保留组也进入了不同机制:持有期 serial covariance 估计未通过信息门槛;完全抑制中间日自主短仓调整,虽改善部分年度结果,却损害半年度表现及空头相关性等要求,两条路线都未推广。fresh 后续的锥优化审计在四小时截止仍未完成,之后产生的重放与 panel 产物不追记为截止前成果,更不能当作全局最优性证明。完整实验、信息性反例、候选采用与原题收益需要分层记账;重叠窗口和 case-session 数量不是独立样本量。

-

成本排序也随窗口反转:fresh 的已回执未缓存输入,相对保留组在一小时约多 2.34%,两小时少 3.22%,四小时多 17.64%;四小时缓存输入多 6.65%,输出少 6.42%。统计扣除了继承线程计数,纳入 compaction 和截止时未闭合 Turn 已返回的用量。此外,fresh 首次任务事件的上下文窗口元数据为 258,400,保留组为 475,000,之后两组均为 475,000;事件元数据不等于已证明的实际响应上限,仍是需披露的差异。未返回响应、评测资源、宿主准入与完整账单仍需单列;共享宿主的资格验证和其他研究会影响时间。token 向量不能直接压成净效率胜负。

-

后续共同窗口:同时保留正向与负向批次

-

后续窗口的结果分化:新版 Sol 集成在 Schema、Ad 领先;Astra LoopX 在 Schema、Grid 落后 Official。下表各比较保留自己的模型、版本、时钟与有效性限制。

- - - - - -
批次 / 题目 / 方向对照 → LoopX test 最佳
Sol 新旧版 · 14h
Schema ↑
0.723684
→ 0.804620
Sol 新旧版 · 14h
Ad Placement ↑
49,589,589,573
→ 49,615,495,839
Astra Official/LoopX · 12h
Schema ↑
0.881813
→ 0.786257
Astra Official/LoopX · 12h
Grid ↓
1810
→ 2118
-

Sol test 两题均领先,但轨迹改变了解释。Schema 首次原生结果已经是 0.794620 对 0.713158,且获知时刻不同;从首次到14h,分别只改善 0.010000 与 0.010526。后期生产代码持续变化,原生最好分却不变;更多本地修复没有完成六项原始目标。Ad 则是“长程必然平台期”的正向反例:test 在固定2h窗口落后,14h领先;其后较差候选被拒绝,能取得的终态工作副本对应保留最佳,而不是最后一次提交。其余三臂缺少同等终态工作副本证明。

-

Astra 批次中,Schema 两臂在6h至12h均未提高最好分。Grid LoopX 从 2159→2118,Official 从 1862→1810:研究持续发生,差距却未缩小。LoopX 做更深 lookahead 和更宽 mutation 搜索,再拒绝同分或更差候选;Official 将速度变化与搜索变化分开,连续取得新原生成果。Schema 平台期也有大量生产路径变化。除了控制成本,还要审查实验选择与原目标转移,不能把分数持平直接写成代码没变。

-
完整观察窗的已记录用量与比较限制 - - - - - - - - - -
批次 / 实验臂未缓存输入 token缓存输入 token输出 token
Sol 14h · Schema base5,536,252381,548,9281,621,142
Sol 14h · Schema test7,444,288479,636,0962,078,121
Sol 14h · Ad base5,896,042328,260,8641,656,988
Sol 14h · Ad test4,069,556319,238,7841,341,356
Astra 12h · Schema Official1,663,308133,393,152613,099
Astra 12h · Schema LoopX8,850,328298,377,6001,410,510
Astra 12h · Grid Official1,529,94995,668,352924,127
Astra 12h · Grid LoopX3,479,450213,635,8401,203,790
-

后续 Sol 新旧版比较同时改变 LoopX core 与 benchmark runner:planned + Explore、Sol/xhigh、TurnEnvelope 关闭、公开原生反馈、无周期评测,提交受理后冷却一小时。每题每臂仅一次运行。14小时窗口是在读过较早结果后,按最早实际终止之前的最大完整小时选择,不按分数选臂,也不称跑满18小时。另一批 Astra/xhigh Official/LoopX 取各臂原外层时钟前12小时,准备计入。不同处理组合不合并成一个效果估计。

-

Sol 窗口核对 7,522 个唯一 response ID 与52项已收到原生结果;Astra 为 5,277 个响应与45项结果。Grid LoopX 包含一次完成但超时、无数值的结果,不填零。会话累计计数不重复相加,reasoning 已含在输出中。Schema 换号恢复,包括所选点之后到旧会话停止前的工作,仍计入原外层时钟;继承结果的别名不产生新机会。

-

Astra Schema LoopX 记录36次完成的 compaction,Official 为四次,未缓存输入约为其 5.32 倍。压缩可能与工作重叠,也不全是 LoopX 开销;Official 同样会在部分冷却窗口等待,两者都需归因。评分器、core/runner、评测并发、实际启动、自适应重起和共享宿主负载存在差异;较早一次操作者读取还暴露过 Official 终局 aggregate。每臂一次运行,账单、失败与资源拆账不完整,不能下干净因果或净费用结论。取消与 runner_invalid 保留历史,单次原生结果有效不认证整臂完整性。

-
-

真正使用分段复盘以后:采用更清楚,决策质量仍是混合结果

-

此前名义“with #7197”的一臂没有收到分段 reader,不能算有效 treatment。后续诊断沿同源点观察实际事实读取、自主选择与写回:旧 Astra/xhigh control 对 Sol/max 接续,版本及两小时/四小时窗口不同,不是单变量消融。两个新 test 按原有限时钟停止,保留 runner 失败和 grading unknown;可以逐项分析已接受原生提交,不能将整臂提升为合格 benchmark 结果。

- - - - - -
首个明确 replan旧 control分段接续
Schema · 分钟 / 命令6.14 / 222.93 / 11
Schema · 未缓存 / 缓存 / 输出 token146,208 / 1,979,648 / 6,75333,478 / 3,791,872 / 4,221
Grid · 分钟 / 命令5.40 / 2014.74 / 23
Grid · 未缓存 / 缓存 / 输出 token70,829 / 2,204,416 / 10,63636,689 / 5,723,776 / 21,904
-

Schema 较便宜的首轮选择了合法后继,却未完成允许再次捕获的语义写回;连同反馈后复盘,旧版 17.86 分钟、新版 17.64 分钟,两轮工作内容仍不同。最初都选择 CLI checks/configured statuses;新版生命周期测试发现注册选项陈旧,本地从 4/10→10/10。后续实际执行 stateful,比旧版兼容性绕行更直接补原配置缺口;原生最好仍为 0.786257,六阶段仅一项完整通过,新增三次已接受结果没有超过继承最佳。

-

Grid 旧 control 本来就会建立后继、调整优先级并比较独立候选,分段没有凭空创造自主性。新版取消了 Agent 自加的“任何局部退步都否决”规则,保留硬有效性/资源约束,完成更深搜索实验;已接受原生分从继承点 2172→2163,后又退至 2165,仍保留2163。另一个更晚历史点已有2104。这是有价值的局部决定与结果链,不证明每次复盘都更聪明或额外复盘已经回本。下一项有区分力的问题,是原验收缺口或可证伪的搜索/速度假设,是否改变下一项实际完成实验及完整成本,而不是复盘数量是否增加。

-

原始归档未随文章公开:读者得到的是范围、方法与汇总观察,不能独立重建全部运行。源码资格、模型采用、保留的原生增益和完整成本分别判断;上文调用链收敛提案已有功能验证,本节没有它的新模型结果。

+

6. 从零开始的上下文验证

+

当前上下文研究让 Grid、Schema、Ad Placement 从原始任务开始,使用 Sol/max,每题最多 18h。可用的历史 Official 或旧 LoopX 作为描述性参考,保留模型/effort、源码、评分器、机会和时钟差异,不冒称严格配对;旧材料无法回答相应问题时再补 base。各次尝试按实际源码、连续性依据和传输路径分别分析,不合并成同一处理。

+

先核实实际交付确实改变:首次完整读取、声明连续性依据的后续差分、已知基线失效时的完整回退,以及一次从复盘到工作的完整交互。再比较有效进展、成果保留和完整用量。开关、回执、局部小包都不能替代这些证据。Feature 偏离预期时,停止相关尝试,保留其成本和历史,修复后用新的尝试身份重启。

+

新原生 Hook 路径的首批 Grid、Ad 交互已完成完整分页、一次差分及后续任务工作。同一次捕获内,差分载荷分别比对应完整包小 19.53%、19.48%;这只是一轮读取的载荷比较,不含分页封装、后续模型输入、Hook、恢复或复盘费用,不能外推为总成本下降。完整复盘到后续原生成果、持续收益和故障恢复仍待验证。

效果目标是很多小时之后仍能取得有效进展并保住成果;效率目标是用更低完整成本和人工介入取得同等验收价值。下一份结果需要同时回答它们;当前运行不重置原定截止时间,替换尝试的失败和消耗也保留。

-

研究范围:早期 EdgeBench Portfolio/Lean、Portfolio/Graph 同点研究、后续 Sol Schema/Ad 与 Astra Schema/Grid,以及有限 Sol/max 接续。数字保留各自窗口、版本和有效性边界。公开实现:LoopX;任务与评分修复:EdgeBench #14。原始轨迹、隐藏评测材料和运行凭证不随文发布。

- - -
+ +
+ diff --git a/docs/assets/edgebench-research/narrative-after-en-desktop.png b/docs/assets/edgebench-research/narrative-after-en-desktop.png new file mode 100644 index 0000000000..a34a61bf44 Binary files /dev/null and b/docs/assets/edgebench-research/narrative-after-en-desktop.png differ diff --git a/docs/assets/edgebench-research/narrative-after-en-narrow.png b/docs/assets/edgebench-research/narrative-after-en-narrow.png new file mode 100644 index 0000000000..e263de5064 Binary files /dev/null and b/docs/assets/edgebench-research/narrative-after-en-narrow.png differ diff --git a/docs/assets/edgebench-research/narrative-after-zh-desktop.png b/docs/assets/edgebench-research/narrative-after-zh-desktop.png new file mode 100644 index 0000000000..15fcc943da Binary files /dev/null and b/docs/assets/edgebench-research/narrative-after-zh-desktop.png differ diff --git a/docs/assets/edgebench-research/narrative-after-zh-narrow.png b/docs/assets/edgebench-research/narrative-after-zh-narrow.png new file mode 100644 index 0000000000..fc9d699e0d Binary files /dev/null and b/docs/assets/edgebench-research/narrative-after-zh-narrow.png differ diff --git a/docs/assets/edgebench-research/narrative-before-en.png b/docs/assets/edgebench-research/narrative-before-en.png new file mode 100644 index 0000000000..f2bc7114f1 Binary files /dev/null and b/docs/assets/edgebench-research/narrative-before-en.png differ diff --git a/docs/assets/edgebench-research/narrative-en-cost-desktop.png b/docs/assets/edgebench-research/narrative-en-cost-desktop.png new file mode 100644 index 0000000000..e51e610f94 Binary files /dev/null and b/docs/assets/edgebench-research/narrative-en-cost-desktop.png differ diff --git a/docs/assets/edgebench-research/narrative-zh-cost-narrow.png b/docs/assets/edgebench-research/narrative-zh-cost-narrow.png new file mode 100644 index 0000000000..cf32aa9cb5 Binary files /dev/null and b/docs/assets/edgebench-research/narrative-zh-cost-narrow.png differ