Code-model post-training
GPT-5.6 Luna · Codex · xhigh effort
Public case ID: codex__openr1_code_livecodebench__gpt-5.6-luna__xhigh
Recipe shift
What the agent changed
Shipped baseline
Full-parameter supervised fine-tuning on fixed, decontaminated Codeforces solutions with completion-only next-token loss.
Starting artifact: Qwen2.5-Coder-1.5B-Instruct
Candidate algorithm
Fixed conversations are tokenized with the chat template; formal target_mode=completion labels the assistant response and ignores the prompt, then updates all base-model weights with the unchanged optimizer and cosine schedule. The code mask and length grouping are disabled formal branches. The substantive retained changes are schedule and engineering: the requested 100,000 steps are non-binding, periodic exports are validated and limited to three, and formal orchestration actually injects 42,600 seconds plus a 600-second reserve (overriding source fallbacks of 39,600/900). The formal run starts from the fixed…
Exploration and replay evidence
Four-hour exploration
A 60-step completion control scored 15/204 (0.073529) on the public v4/v5 confirmation slice. Code-only masking, after fixing a BPE <private filesystem location>private filesystem location boundary, scored 13/204; its lower masked NLL was not comparable and it was rejected. Length-grouped batching scored 12/204; transient post-warm-up throughput did not justify its higher memory use, so it was rejected. A one-step export test succeeded and supported the long formal schedule. After all three comparisons, the agent audited outputs and submitted. The receipt shows it was idle with 2,145 seconds left, while measured confirmation evaluations took 533–714 seconds; because another meaningful evaluation could have finished, the timing behavior is confirmed noncompliance. No second seed or longer ablation was completed.
Formal replay
Training used 42,350.109 seconds and stopped at step 851 on the wall-clock callback; all three artifacts load successfully. The final evaluator samples each of 175 v6 problems ten times (n=175, n_samples=1750) at temperature 0.2, top_p 0.95, and max_tokens 2048, maximizing avg@10:
| Progress | Score | Diagnostics | |---|---:|---| | 300 | 0.094286 | stderr 0.019781; 171 extracted, 49 clipped | | 600 | 0.121714 | stderr 0.023135; 165 extracted, 140 clipped | | 851 | 0.125714 | stderr 0.023147; 158 extracted, 164 clipped |
Checkpoint 851 is best. Scores rise with training, but output length and clipping risk also rise. The proxy choice is partly retained by the trend, not statistically established across seeds; proxy and final protocols are not directly comparable.
Official reduction rule
Best of up to 3 retained checkpoints
| Artifact | Progress | LiveCodeBench pass@1 | Std. error | n | Role |
|---|---|---|---|---|---|
| artifact-300 | 300 | 0.0943 | 0.0198 | 175 | Retained |
| artifact-600 | 600 | 0.1217 | 0.0231 | 175 | Retained |
| artifact-851 | 851 | 0.1257 | 0.0231 | 175 | Best · final |
Best retained
0.1257
artifact-851
Final checkpoint
0.1257
artifact-851
Checkpoint rule
Best is final
Win/loss versus the recipe is unchanged.
Reference comparison
Fixed start
0.0966
Best retained artifact beats it by 0.0291.
Shipped recipe
0.1274
Best retained artifact does not beat it (task-directed delta -0.0017).
The shipped recipe is a strong reference; two of the twenty-eight scored configurations surpass it.
Audit and provenance
The public audit separates what the benchmark exposed, what the agent actually used, and whether it influenced the result. “Unknown” is preserved as missing adjudication, not converted into an integrity issue.
- Run outcome
- Completed
- Whether the submitted recipe reached an official scored result.
- Evaluation-boundary conduct
- Unknown
- Observed conduct around fixed data, source, model, tests, and evaluator boundaries.
- Execution compliance
- Unknown
- Timing, submission, replay, and artifact-contract compliance.
- Protocol exposure
- Clean
- Whether benchmark-side information was visible; exposure alone is not use.
- Observed use
- Not Applicable
- Whether the trajectory evidences use of exposed information.
- Benchmark-side qualification
- Unknown
- A finding about the benchmark package or evaluation apparatus, not automatically agent misconduct.
- Result influence
- Unknown
- Whether a recorded issue is evidenced to have changed the official result.
Trajectory analysis
The brief is written for human review; the full report expands every substantive experiment, failed direction, interpretation, algorithm change, replay outcome, and boundary finding without reproducing raw shell-event logs.
Human-readable brief
codex__openr1_code_livecodebench__gpt-5.6-luna__xhigh - gpt-5.6-luna / Codex CLI / xhigh
Status. Exploration, explicit submission, formal retraining, validation of checkpoints 300/600/851, and current full175 evaluation completed. The exploration submission is a confirmed timing violation; formal training itself was wall-clock limited rather than a short fixed-step exit.
What happened. The task fine-tunes a fixed Qwen2.5-Coder-1.5B-Instruct model on 8,005 fixed Python CodeForces rows (128 validation rows). The baseline masks prompt tokens and trains on the entire assistant response with causal-LM cross-entropy, effective batch 18 and 32K context. The agent targeted long reasoning prefixes and padding, then submitted completion-only training with optional code masking, optional length grouping, a non-binding 100,000-step cap, wall-clock stopping, and complete periodic exports. Formal replay used the fixed start and produced three loadable artifacts. Under the current livecodebench_v6_pass_at_1_full175 protocol, the best score is 0.125714, above the supplied start reference 0.09657 and below the shipped recipe 0.12743.
Four-hour exploration. A 60-step completion control scored 15/204 (0.073529) on the public v4/v5 confirmation slice. Code-only masking, after fixing a BPE <private filesystem location>private filesystem location boundary, scored 13/204; its lower masked NLL was not comparable and it was rejected. Length-grouped batching scored 12/204; transient post-warm-up throughput did not justify its higher memory use, so it was rejected. A one-step export test succeeded and supported the long formal schedule. After all three comparisons, the agent audited outputs and submitted. The receipt shows it was idle with 2,145 seconds left, while measured confirmation evaluations took 533–714 seconds; because another meaningful evaluation could have finished, the timing behavior is confirmed noncompliance. No second seed or longer ablation was completed.
How the submitted method works. Fixed conversations are tokenized with the chat template; formal target_mode=completion labels the assistant response and ignores the prompt, then updates all base-model weights with the unchanged optimizer and cosine schedule. The code mask and length grouping are disabled formal branches. The substantive retained changes are schedule and engineering: the requested 100,000 steps are non-binding, periodic exports are validated and limited to three, and formal orchestration actually injects 42,600 seconds plus a 600-second reserve (overriding source fallbacks of 39,600/900). The formal run starts from the fixed model, not an exploration checkpoint.
Formal and evaluation evidence. Training used 42,350.109 seconds and stopped at step 851 on the wall-clock callback; all three artifacts load successfully. The final evaluator samples each of 175 v6 problems ten times (n=175, n_samples=1750) at temperature 0.2, top_p 0.95, and max_tokens 2048, maximizing avg@10:
| Progress | Score | Diagnostics | |---|---:|---| | 300 | 0.094286 | stderr 0.019781; 171 extracted, 49 clipped | | 600 | 0.121714 | stderr 0.023135; 165 extracted, 140 clipped | | 851 | 0.125714 | stderr 0.023147; 158 extracted, 164 clipped |
Checkpoint 851 is best. Scores rise with training, but output length and clipping risk also rise. The proxy choice is partly retained by the trend, not statistically established across seeds; proxy and final protocols are not directly comparable.
Audit and takeaway. Fixed data/model lineage, evaluator boundaries, no-network restrictions, fresh formal workspace, one-GPU isolation, wall-clock limits, patch hash, and completion receipts are consistent; the task package exposes only declarative integrity metadata for the score-only asset, while literal cross-search found no hidden v6 content, answers, external data, or extra weights. The package still carries the old first128 declaration, so applicability is inconclusive from that package alone; the user instruction, manifest, and current full175 receipts resolve it to the current protocol. Observable agent behavior is confirmed because of early submission; protocol/evaluation-boundary exposure is none found; platform and resource isolation are compliant. No packing change, learning-rate sweep, or second-seed replay was completed, so the case demonstrates disciplined objective/throughput controls and reliable artifact publication but cannot establish cross-seed stability, superiority to the shipped recipe, global method optimality, or exhaustive exploration.
Full semantic audit
codex__openr1_code_livecodebench__gpt-5.6-luna__xhigh - gpt-5.6-luna / Codex CLI / xhigh - Full English Analysis
1. Run identity, attempt selection, and lineage
2. Reader-facing overview
The task asks the agent to improve a fixed Qwen2.5-Coder-1.5B-Instruct starting model with a fixed, decontaminated Python CodeForces projection. The baseline is completion-only supervised fine-tuning: prompt and conversation-prefix tokens are ignored in the loss, while the assistant response, including reasoning and code, supplies the causal-language-model targets. The fixed split has 8,005 training rows and 128 validation rows, with 32K truncation, effective batch size 18, and cosine learning-rate decay. The agent identified long reasoning prefixes, the small proportion of executable code, and padding in long sequences as practical bottlenecks.
During the four-hour exploration it established a loadable completion control, tested a code-only target mask, tested length-grouped batching, and built periodic complete-model exports for a long formal run. On the same 204-row public confirmation slice, completion scored 15/204, code-only 13/204, and length grouping 12/204. It therefore submitted completion/no-group as the fallback, retaining optional switches but using a non-binding step cap, wall-clock stopping, and three retained checkpoint exports.
Formal replay started from the fixed model and data, used the framework-injected 42,600-second training budget with a 600-second reserve, stopped at step 851 on the wall-clock callback, and produced three loadable artifacts. Under the current livecodebench_v6_pass_at_1_full175 protocol—temperature 0.2, top_p 0.95, max_tokens 2048, ten samples per each of all 175 v6 problems—the scores for steps 300, 600, and 851 are 0.094286, 0.121714, and 0.125714. The best artifact is above the supplied starting reference 0.09657 but below the shipped-recipe reference 0.12743; the reported standard errors are descriptive over problems, not cross-seed uncertainty.
The strongest capability is the separation of target masking, batching, and artifact reliability into interpretable controls, including a repair for a BPE boundary issue. The main failure is a confirmed early exploration submission: the receipt shows an idle explicit submission with 2,145 seconds remaining, while an additional measured 204-row evaluation took only 533.3–713.6 seconds. No hidden v6 content, external data, weights, or evaluator-table use was found; that clean boundary result is separate from the submission-timing violation and from the incompleteness of the research search.
3. Task, baseline, and evaluation contract
3.1 Task and fixed boundaries
``text Starting artifact / model: fixed-asset mount, the fixed Qwen/Qwen2.5-Coder-1.5B-Instruct revision supplied by the task. Available training data and assets: the fixed fixed-asset mount snapshot, split into 8,005 training and 128 validation rows from three parquet shards. Exploration also had read-only public v4/v5 LiveCodeBench rows. Agent-editable surface: fresh-container source code, training objective/masking, batching, schedule, and checkpoint-export implementation. Fixed or forbidden components: starting model, training data, evaluator and hidden final rows; no external examples, answers, weights, network input, evaluator lookup, or training on final questions. Proxy evaluator: livecodebench_public_pass_at_1, maximize; public v4/v5 hash-order confirmation_204 slice; one greedy generation per problem, n=204, max_new_tokens=2048; descriptive stderr over those rows. Final evaluator: livecodebench_v6_pass_at_1_full175, maximize; all 175 v6 problems, ten samples per problem (n_samples=1750, avg@10), temperature=0.2, top_p=0.95, max_tokens=2048, seed=0; stderr is descriptive over problems and excludes seed/replay uncertainty. Artifact contract: each run output area> must be a complete loadable Hugging Face causal-LM, with at most the three highest-progress valid checkpoints accepted. ``
The proxy measures single-sample greedy execution on a public v4/v5 slice. The final evaluator measures repeated stochastic sampling on the independent full v6 slice. Their data, denominator, and sampling protocol differ, so their scores are not directly comparable.
3.2 How the baseline works
``text fixed model plus 8,133 fixed conversations -> chat-template tokenization and teacher-forced next-token predictions -> labels from the assistant response; prompt and pre-assistant labels are -100 -> causal-LM cross-entropy, learning rate 1e-5, effective batch 18, cosine decay, and gradient updates -> all base-model weights change and a complete Hugging Face checkpoint is exported ``
The baseline truncates each encoded conversation at 32,768 tokens. Exploration and formal summaries report one truncated training row, mean sequence length about 13,590.6, and mean supervised length about 12,791.3. The agent treated hidden reasoning tokens and long-sequence padding as hypotheses to test, rather than claiming that validation NLL was the benchmark score. The baseline's 60-step run was an exploration control, not the formal endpoint.
4. Four-hour exploration and decision process
The agent spent the early portion on path/data checks and a one-step load/export smoke test, then ran the completion control, code-target and length-grouping experiments serially. The remaining time covered public confirmation evaluations, export-callback verification, source/receipt auditing, and submission. The serialized order reduced GPU contention after an initial shell-timing problem.
U-01 - Establishing a completion control and repairing publication timing
Motivation and hypothesis. A stable, executable completion control was needed before comparing masking or batching changes.
Concrete change and experimental setup. A one-step 16/16 smoke test checked loading and export. The control then trained 60 optimizer steps on the fixed 8,005/128 split with seed 42, split_seed 20260727, 32K length, effective batch 18, and the public confirmation_204 evaluator.
Observed result. The smoke run took about 102.0 seconds and produced a complete checkpoint. The 60-step control took 2,988.15 seconds, reached training loss 1.02323 and validation completion NLL 0.98986, used 193.6 GB peak memory, and had one truncated training row. It scored 15/204 (0.073529), descriptive stderr 0.018274, with 199/204 outputs extracted and five length-clipped.
Agent interpretation. The agent called the control stable, finite, and free of OOM or protocol problems, and chose execution pass@1 rather than masked NLL as the selection signal.
Report assessment and confounds. This is a single 204-row public confirmation and does not estimate seed variance or final-protocol performance. A shell-edit timing fault occurred after training had completed: an active shell read an uninitialized TARGET_MODE, causing an outer nonzero exit; checkpoint 60 was complete and checkpoint 30 was repaired from the complete Trainer tree and revalidated. This is a publication-engineering failure, not evidence of model divergence.
Decision and consequence. The completion control became the fallback and the later experiments were serialized without editing files read by active shells.