全部播客 · 系列

智能体编码能力

围绕当下编码智能体背后的系统展开的对谈式深挖——模型能力、外围框架、评测方法,以及大规模运行它们时的真实工程状况。

60 · 60 期含音频 · Updated 2026年8月3日

单集列表

Podcast cover for From Code Generation to Agentic Work.

T1E1 · 2026年5月6日 · 9:26

From Code Generation to Agentic Work

Completion, generation, editing, agentic work — why fixing a repository is not writing a snippet

节目笔记

This episode separates completion, generation, editing, and agentic software work.

来源材料

完整单集页面
Podcast cover for The Agent-Computer Interface.

T1E2 · 2026年5月6日 · 9:26

The Agent-Computer Interface

Search, file views, edits, execution — the same model looks careful or confused depending on its tools

节目笔记

This episode explains the interface layer between the model and the computer: search, file views, edits, execution, and feedback.

来源材料

完整单集页面
Podcast cover for SWE-bench — Real Issues, Real Repositories.

T1E4 · 2026年5月7日 · 9:22

SWE-bench — Real Issues, Real Repositories

Real GitHub issues, pinned environments, and fail-to-pass tests — how repository-level evaluation got honest

节目笔记

A reference-material episode explaining SWE-bench and repo-level issue resolution.

来源材料

完整单集页面
Podcast cover for SWE-agent and the Agent-Computer Interface.

T1E5 · 2026年5月7日 · 9:28

SWE-agent and the Agent-Computer Interface

Linter-gated edits and scoped file views — designing the interface an agent actually reads

节目笔记

A reference-material episode on SWE-agent and the Agent-Computer Interface.

来源材料

完整单集页面
Podcast cover for GitHub Copilot Cloud Agent — From Session to Reviewable Work.

T1E7 · 2026年5月7日 · 8:55

GitHub Copilot Cloud Agent — From Session to Reviewable Work

What a cloud agent leaves behind when the work is done — an artifact trail for audit, evaluation, and training

节目笔记

A reference-material episode on GitHub Copilot cloud agent as an observable production workflow.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff panel, a cyan trace ribbon running through a hidden-test gate to a needle trust meter, with a small rack of measuring dials for benchmark families. No text, no 3D.

T2E0 · 2026年6月3日 · 15:55

Evaluation and Code Review for Coding Agents

A map of how experts judge coding agents — and why review is its own skill

节目笔记

A topic-overview map of how experts judge coding agents: the benchmark families and what each is shaped to see, the verification signals from hidden tests to human review and their blind spots, code review as a first-class capability, and why reviewer trust — not raw bug-catch count — decides whether a review agent is used. Built around one running example: a data-library fix that must pass hidden tests and survive code review.

How do experts evaluate coding agents without fooling themselves? Maya and Leo map four working areas — benchmark families, verification signals, code review as its own skill, and reviewer trust — through one running example: a data-library patch that must pass hidden tests AND survive human review. Includes the real expert splits: single leaderboard vs. fresh private evals, tests-as-oracle vs. human/verifier judgment, and bug recall vs. precision in review.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff panel with a small paper receipt curling out beneath it; a cyan trace ribbon runs from the diff through a hidden-test gate and a short winding trajectory path to a needle trust meter, with a small rack of measuring dials for benchmark families. No text, no 3D.

T2E1 · 2026年6月3日 · 11:12

How to Evaluate a Coding Agent in Practice

The working loop behind a coding-agent score — beyond one leaderboard number

节目笔记

The practical on-ramp to Topic 2: what you actually do when a coding agent lands a real change and someone needs a verdict. Maya and Leo walk the evaluation loop in four moves — pick the instrument that fits the work (bug-fix vs. feature vs. terminal), record what signal judged it (visible tests, hidden tests, oracle, human review), read the trajectory when the path carries signal the diff erased, and judge both the change and the engineering process. Built around one running example: a data-library fix that passes every hidden test but silently breaks refunds for one currency.

A coding-agent score is a receipt, not the meal. Maya and Leo build the practical evaluation loop you run when an agent lands an actual change: pick the instrument for the work (SWE-bench-style hidden tests vs. Aider's edit-reliability split), notice that pass/fail is a property of the judge not the patch, read the trajectory when the path holds signal the final diff erased, and judge both the change AND the review of it. One running example carries it — a data-library patch that passes every hidden test but disables refunds for one currency — plus the honest limit: even a careful workflow has a shelf life when benchmarks get contaminated.

来源材料

完整单集页面
2D editorial illustration: a vertical ladder of cream rungs (eye, key-locked gate, balance scale, magnifier lens, human eye) re-judging the same code-diff panel, a cyan trace ribbon threading up to a needle trust meter, one diff line faintly flagged. No text, no 3D.

T2E2 · 2026年6月3日 · 13:40

Public Tests, Hidden Tests, and Oracle Tests

The verification-signal ladder — what each rung proves about a patch, and what it stays blind to

节目笔记

Verification is a ladder, not a switch. Maya and Leo climb it rung by rung — visible tests the agent can read, hidden tests it writes blind against (SWE-bench's catch and guard split), oracle tests that compare to a known-correct answer, LLM-based verifiers that score the whole trajectory and intent, and human review — showing what each rung proves and exactly what it stays blind to. The thread throughout is one false positive: a data-library patch that passes the tested path while silently disabling refunds for an untested currency, and which rung finally catches it.

来源材料

完整单集页面
A 2D editorial illustration on a dark navy workspace of a central cream score panel being inspected through a flat magnifier that fans its result into several smaller labeled cards, with a stack-of-attempts motif behind it and a small freshness tag on the incoming task panel; cyan, mint, and amber line work, no readable text.

T2E3 · 2026年6月3日 · 11:47

Leaderboard Literacy

How to read coding-agent leaderboards without being fooled by a single number

节目笔记

A coding-agent leaderboard reports one number, but that number is a bundle — task shape, the room the agent worked in, the judge that scored it, language coverage, contamination risk, and the failure modes a ranking never shows. Maya and Leo pull the bundle apart across the real benchmark families (issue-fixing, edit-and-repair, terminal, feature-development, open-ended, and mobile) so you can read the next benchmark headline critically.

Two coding agents post the identical score — one fixed clean Python bugs in a single attempt, the other took fifty tries with a reranker and quietly dropped flaky tasks. This episode unpacks why a single leaderboard number is incomplete: task shape, harness, scoring method, languages, contamination, and the cost and failure modes the ranking hides. Grounded in SWE-bench Verified, SWE-bench-Live, Aider's polyglot leaderboard, and the terminal, feature, and open-ended benchmark families.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff panel pinning one exact line, with a faint connector to a small adjacent untouched-code panel showing a break icon, an intent tag clipped to the diff, and a cyan trace ribbon running through a hidden-test gate to a needle trust meter. No text, no 3D.

T2E4 · 2026年6月4日 · 12:56

Code Review Agents: The Other Half of Agentic Coding

Why reviewing a patch is a separate capability from writing one — and how to measure it

节目笔记

Writing a patch and reviewing one are two different jobs — and almost nobody scores the second directly. Maya and Leo treat code review as its own agentic capability: reading the pull request's intent, understanding the diff against the surrounding repository, localizing to the exact line, judging severity, and earning a real human reaction (accepted comments, author responses, applied fixes, post-merge outcomes). Built around one running example — a data-library fix that passes every test yet silently disables refunds for one currency, a bug only a reviewer reading intent against context ever catches.

Review is the other half of agentic coding. Maya and Leo argue that reviewing someone else's patch is a separate skill from writing your own — generative versus forensic — and walk a reviewer's desk: reading PR intent, understanding the diff against untouched code, exact-line localization, severity, and the acceptance loop (accepted/rejected comments, author responses, applied fixes, post-merge signals). One running example threads through: a data-library patch that passes every visible test yet quietly kills refunds for one currency. Includes the honest limitation — human acceptance is the best ground truth we have and it's still biased.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff panel dotted with solid and hollow comment-pins, a cyan trace ribbon carrying the pins through a fine mesh sieve that holds back the hollow noise-pins, ending at a needle trust meter. No text, no 3D.

T2E5 · 2026年6月5日 · 12:35

Evaluating Review Quality

Why a reviewer that catches more bugs can still be the worse reviewer

节目笔记

Review quality is not bug recall. This concept deep-dive builds the review-quality scorecard row by row — recall and precision, the signal-to-noise line, specificity and actionability, the special danger of hallucinated issues, and the trust row they all feed into — using one running example: two agents reviewing the same data-library patch, where the quieter reviewer that catches fewer bugs is the one the developer keeps reading. Maya and Leo show why noise sits on the cost side of the ledger for review the way it never did for patch generation, and why trust can only be measured by what a human does next.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff panel passing along a corridor of five icon-only doorways for five review-benchmark families, a cyan trace ribbon threading through them to a needle trust meter, with a small rack of measuring dials. No text, no 3D.

T2E6 · 2026年6月3日 · 14:12

Code Review Benchmarks and Datasets

A map of the code-review benchmark family — and why review is graded differently from patches

节目笔记

A map episode of the code-review benchmark family. Maya and Leo walk eight benchmarks — CodeReviewer, CodeReviewQA, CodeFuse-CR-Bench, CR-Bench, SWE-PRBench, CodeReviewBench, Code Review Bench by Martian, and MetaMateCR — grouped into five rising bars: writing the review comment, understanding the diff, being useful despite noise, whole-pull-request realism, and production trust. The throughline: unlike a patch benchmark, a review benchmark has no green-checkmark oracle, so each one invents its own ground truth — and that choice is what makes them different instruments.

Hand the same pull request to eight code-review benchmarks and they won't agree on what 'good' means. Maya and Leo map the code-review benchmark family — CodeReviewer, CodeReviewQA, CodeFuse-CR-Bench, CR-Bench, SWE-PRBench, CodeReviewBench, Martian's Code Review Bench, and MetaMateCR — as five rising bars from comment generation to production trust, and explain why review is graded so differently from patch generation: there's no executable oracle, so every benchmark invents its own ground truth, and false positives finally count against you. A map before the per-benchmark deep dives.

来源材料

完整单集页面
A flat-vector editorial illustration of a benchmark grading workbench. A human review lens hovers over a repository-issue card and a hidden-test gate, a cyan check-mark clears fair task cards onto the bench while an amber tray discards broken ones, and a mint trace ribbon runs from a cleared card through two test gates to a result panel.

T2E7 · 2026年6月3日 · 10:46

SWE-bench Verified

The human-cleaned answer key that became the field's default coding-agent score

节目笔记

SWE-bench Verified is the human-cleaned subset of SWE-bench that became the default coding-agent score. This episode explains why the original benchmark's auto-harvested tasks were noisy — underspecified issues, over-strict hidden tests, broken environments — how human engineers (with OpenAI) validated 500 tasks to fix that, how the hidden fix-flip and guard tests decide "percent resolved," and what a clean number still cannot tell you about other languages, feature work, review quality, or contamination.

来源材料

完整单集页面
2D editorial illustration: a code-diff panel resting on a flat desk calendar with earlier pages fanned behind it, a small container icon feeding it through a closed hidden-test gate, a cyan trace ribbon running past a reviewer's loupe to a needle trust meter. No text, no 3D.

T2E8 · 2026年6月6日 · 13:14

SWE-bench-Live

Beating contamination with a calendar, not a scrub

节目笔记

SWE-bench-Live is the continuously-refreshed answer to a benchmark's slow expiry. Maya and Leo unpack why it exists — a fixed set of public GitHub issues gets contaminated and goes stale — and how Live sidesteps both by automatically curating fresh, post-training issues each month, scoring them with the same hidden catch/guard tests inside auto-built containers. They contrast it with Verified's hand-cleaned frozen set, explain how frozen lite/verified splits keep ranking fair, and walk the real costs: environment flakiness, test-validity decay, perpetual maintenance, and noisy small snapshots.

How do you keep a code-fixing benchmark honest when models keep memorizing its answer key? Maya and Leo dig into SWE-bench-Live — the live, contamination-resistant variant of SWE-bench that automatically curates fresh GitHub issues every month so the tasks are newer than the model. Same resolve-the-issue, hidden-test scoring as the original, but the calendar does the auditing that contamination-checking can't. They cover the automated curation pipeline, the agentic environment setup that makes monthly refresh feasible, the frozen splits that keep head-to-head ranking fair, and the honest limits: containers don't guarantee isolation, tests decay over time, upkeep never ends, and each month's snapshot is small and noisy. A paper deep-dive in the Evaluation and Code Review topic.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff panel whose changed lines feed through a small slot-and-key edit-format adapter onto a cyan trace ribbon toward a hidden-test gate; one misaligned line falls away from the ribbon, and a small fan of six language tiles feeds the same adapter. No text, no 3D.

T2E9 · 2026年6月7日 · 13:04

Aider Polyglot Benchmark

When being right isn't enough — measuring whether a model can hand over an edit the tool can actually apply

节目笔记

A deep dive on the Aider polyglot benchmark and why it scores something most leaderboards hide: not just whether a coding model finds the fix, but whether it can deliver that fix as an edit the tool can mechanically apply. Built on 225 challenging Exercism exercises across six languages (C++, Go, Java, JavaScript, Python, Rust), the benchmark reports two numbers — a pass rate and a percent-well-formed — so a fumbled handoff stops looking identical to a genuine reasoning failure. Maya and Leo unpack edit formats (whole-file vs. diff), the counterintuitive finding that harder formats make models write worse code, and the benchmark's honest limits: self-contained puzzles rather than real repos, likely training-data contamination, and run-to-run variance.

来源材料

完整单集页面
2D editorial illustration: a flat command-line terminal panel inside a small sandbox outline feeds a cyan trace ribbon through a hidden-test gate to a reviewer's loupe over a code diff and a needle trust meter, with a checkmark file-icon for final-state verification. No text, no 3D.

T2E10 · 2026年6月7日 · 12:34

Terminal-Bench 2.0

The benchmark that makes the messy terminal itself the exam

节目笔记

Most coding-agent benchmarks hand the agent a clean room — repo installed, tests wired up. Terminal-Bench 2.0 refuses: it drops the agent into a raw, sandboxed command line and makes operating the environment end-to-end — install, build, debug, reach the goal — the actual exam. Grading checks the final state of the world rather than the commands typed, each hard task ships human-authored verification, and frontier agents are still well short of solving it. Maya and Leo unpack why the terminal, not the patch, is where agents break — using the running example of a data-library fix that first has to build and run before it can pass hidden tests or survive review.

Terminal-Bench 2.0 makes the messy terminal itself the test: a coding agent is dropped into a raw sandboxed shell and must do the whole job — install, build, debug, reach the goal — graded on the final state of the environment, not the path it took. Maya and Leo cover why it's curated-and-brutal rather than huge-and-shallow, why frontier agents still fall well short (the failures are state-tracking and unchecked-command failures, not coding failures), and the honest limits: environment drift, small samples, and reward hacking of outcome checks. Tied back to the running data-library example, where getting the project to build is half the battle before any test or reviewer sees the patch.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a wide code-diff panel that fans into several connected file-cards, with thin test-mark connectors tracing a feature boundary across them like a stencil; a cyan trace ribbon runs through a hidden-test gate, and a small detached feature-block lifts clear while the rest of the codebase stays standing. No text, no 3D.

T2E11 · 2026年6月8日 · 12:27

FeatureBench

When the task isn't a bug fix but a whole feature — and the score collapses

节目笔记

A deep dive on FeatureBench, a benchmark that grades coding agents on building whole features — not fixing single bugs. Maya and Leo unpack its core trick: deriving feature-sized tasks by tracing unit tests along a project's dependency graph (the test suite as a stencil), checking that each feature is cleanly removable, and grading whole capabilities with hidden execution tests. The episode's headline is the score drop — a frontier model strong on bug-fixing benchmarks falls off a cliff on feature tasks — and what that gap reveals about the difference between the narrow patch skill and the wide engineering skill. Built on the running data-library example, stretched from a bug fix to a streaming-support feature ask.

来源材料

完整单集页面
2D editorial illustration: two mirrored code-diff panels facing a small bracket-shaped competition arena, a reviewer's loupe over one diff, a cyan trace ribbon looping through the arena to a needle trust meter, with a tiny round-loop arrow and a small rack of measuring dials. No text, no 3D.

T2E12 · 2026年6月3日 · 13:05

CodeClash

When the test is a live opponent: goal-oriented, competitive software engineering

节目笔记

CodeClash evaluates coding agents on open-ended, competitive goals instead of fixed bugs. Two codebases are improved over many tournament rounds, then dropped into a shared arena where a winner falls out of the competition itself — no spec, no hidden test grading the diff, and an opponent that can't be memorized. Maya and Leo unpack what this measures, how it differs from issue-fixing benchmarks like SWE-bench, and the honest limits: results are noisy, the arena is synthetic, and the headline that top models lose every round to human experts measures one narrow skill — open-ended strategic development — not the well-scoped fixes models are already good at.

What happens when a coding benchmark replaces the hidden-test answer key with a live opponent? Maya and Leo dig into CodeClash, which scores agents on goal-oriented software engineering: two codebases improve over many tournament rounds, then compete head-to-head in an arena where the winner is decided by score, resources, or survival. They contrast it with one-shot, fixed-target benchmarks like SWE-bench, explain why a live adversary is contamination-resistant, and stay honest about the limits — noisy outcomes, a synthetic arena, and the finding that models are tactical but not strategic and let their codebases rot. The result that gets overread: top models lose every round to expert humans in this setting — which is one narrow lens, not a verdict on bounded coding.

来源材料

完整单集页面
2D editorial illustration: a small flat model figure holds a reviewer's loupe over a fan of three near-identical candidate code-diff cards, two paired by a cyan bracket; a criteria checklist with three ticks sits beside the lens, and a trace ribbon carries a small confidence needle to a trust meter, with a faint hidden-test gate behind. No text, no 3D.

T2E13 · 2026年6月9日 · 12:30

LLM-as-a-Verifier

When the judge of an agent's work is another model — decomposed, repeated, and calibrated

节目笔记

When executable tests run out, can a language model judge a coding agent's whole trajectory well enough to pick the best work? This episode unpacks LLM-as-a-Verifier — a framework that scores agent runs by decomposing the judgment into separate criteria, repeating the verification to beat sampling noise, and reading the model's own logprobs so its confidence stays inside the score, then ranking candidates in a round-robin tournament. Maya and Leo show where it helps that tests can't reach, and where it inherits four honest failure modes: verifier hallucination, calibration drift, self-preference bias, and cost.

Tests pass or fail — but a lot of engineering judgment never lands in a test. LLM-as-a-Verifier asks whether a language model can be a disciplined judge of a coding agent's whole trajectory. Maya and Leo walk three moves that turn 'rate this run' into a measurement — break the question into criteria, ask more than once, and read the model's confidence through its logprobs — then use a tournament to pick the best of several candidates. They land it on the topic's running argument (tests-as-oracle vs. model judgment) and name the four limits every model-as-judge inherits: hallucination, calibration drift, self-preference bias, and compute cost.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff card on a small three-stop training conveyor — a gate stamp, a speech-note tag, and a wrench mark — with a faint multi-tint stack of diff cards behind it and a cyan trace ribbon running left to right. No text, no 3D.

T2E15 · 2026年6月9日 · 12:26

CodeReviewer

The paper that turned code review into a learnable, three-part task

节目笔记

The foundational code-review paper. Maya and Leo unpack CodeReviewer — a model pre-trained specifically on review situations (diffs paired with the human comments left on them, across nine languages) rather than on plain code. It splits reviewing into three scoreable jobs: judge the diff (the Verdict), write the comment (the Note), and fix the code (the Patch). The honest confession: the Verdict and Patch have answer keys, but the Note — the part that decides whether a reviewer is trusted — is scored against one human comment among many valid ones, so a high comment score means plausible, not useful. Plus the limitations that drove the rest of the field: dataset noise and a single-hunk view that can't see whole-PR, cross-file bugs.

Can you pre-train a model just for code review? CodeReviewer says yes — feed it diffs paired with real human review comments across nine languages, then split reviewing into three trainable jobs: a Verdict (is this diff okay?), a Note (write the comment), and a Patch (fix the code). Maya and Leo walk the three tasks, the review-shaped pre-training behind them, and the honest limitations: the comment score rewards sounding like one specific reviewer, the training comments are gloriously noisy ('lgtm', 'nit', 'rebase'), and a single-hunk keyhole can't see the whole-PR, cross-file bug — the exact gap later review benchmarks were built to close. Grounded in the running example: a data-library fix that passes the tests but silently disables refunds for one currency.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff panel, with a cyan ribbon splitting into three small icon-marked question cards (a shape tag, a pin on a line, a wrench among options), a closed hidden-test gate upstream and a needle trust meter downstream. No text, no 3D.

T2E16 · 2026年6月10日 · 12:55

CodeReviewQA

Grading whether a model understood the change before it ever writes the comment

节目笔记

CodeReviewQA grades the part of code review that comment-generation benchmarks can't: did the model actually understand the change? Maya and Leo unpack how the paper turns review comprehension into multiple-choice question-answering over a diff — recognizing the change type, localizing it to the exact line, and identifying the right fix — so a single fuzzy 'bad comment' becomes a readable per-step diagnosis. They run the topic's data-library patch through the three gates, then weigh the catch: multiple choice tests recognition, not the open-ended review you do in the wild.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff panel embedded inside an open repository folder with a linked-issue card and unrelated file tiles, a cyan trace ribbon that briefly forks through a rule-check stamp and a judging-eye icon before rejoining toward a needle trust meter. No text, no 3D.

T2E17 · 2026年6月10日 · 11:50

CodeFuse-CR-Bench

Closing the reality gap — grading a whole code review, not a clean snippet

节目笔记

CodeFuse-CR-Bench attacks the 'reality gap' in code-review evaluation: instead of grading a clean snippet question, it drops a reviewer model into real pull requests with full repository context — the linked issue, the PR, the repo state — and grades the whole review end to end. Maya and Leo unpack the design: a fused rule-based checker (location, syntax) paired with a model-based quality judge, why no single model turns out to be well-rounded across review's dimensions, how redundant context becomes its own test of focus, and the benchmark's own limits (single language ecosystem, a model-as-judge with its own blind spots, and the gap that always remains between a frozen benchmark and a live reviewer).

来源材料

完整单集页面
Flat-vector illustration of a reviewer lens over a code-diff panel; one highlighted line marks a real defect, and the lens sorts output into a short tray of accepted comments and a taller tray of crossed-out false alarms.

T2E18 · 2026年6月11日 · 12:13

CR-Bench: Evaluating the Real-World Utility of AI Code Review Agents

Why catching every defect can still make a review agent useless

节目笔记

A code review agent that finds every bug can still be useless if it buries the real ones in noise. This episode unpacks CR-Bench, which measures the real-world utility of AI code review agents — how it scores a comment on defect coverage, exact-line localization, severity, and actionability; why it counts false positives as first-class; how it differs from patch-generation benchmarks; and the hard frontier it surfaces between catching issues and keeping a developer's trust.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a fanned stack of several code-diff panels forming one whole pull request, with small comment markers pinned to a few lines and a funnel narrowing wide context into a focused beam; a cyan trace ribbon runs past a hidden-test gate to a needle trust meter. No text, no 3D.

T2E19 · 2026年6月3日 · 13:10

SWE-PRBench

Grading review agents on whole, real pull requests — against what human reviewers actually flagged

节目笔记

SWE-PRBench moves coding-agent evaluation from writing patches to reviewing them. Maya and Leo unpack a benchmark that grades agents on whole, real pull requests — multi-file diffs as humans submitted them — against the comments real reviewers actually left before merge. The humbling result: frontier models recover only a minority of human-flagged issues on the diff alone, and counterintuitively often do worse when handed more file context, because attention dilutes. A clear-eyed look at why review is a separate skill from generation, plus honest limitations: the oracle is model-judged, the human gold standard is itself noisy, and the slice is open-source review culture.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff panel with one line pin-marked as a known bug, the cyan trace ribbon passing through two small matching judge-stamp icons, and a faint thread reaching to two offstage file corners for a cross-file defect. No text, no 3D.

T2E20 · 2026年6月12日 · 12:16

CodeReviewBench: Planted Bugs, Two Judges

A deterministic, auditable code-review benchmark — known bugs, two model judges, every trace in the open

节目笔记

CodeReviewBench scores AI code reviewers against bugs it already knows the location of, then has two independent language models grade whether each reviewer caught them — a deterministic, fully-published alternative to human-annotated review benchmarks. Maya and Leo walk through how it builds planted-bug test cases across five languages, why it splits local-logic from cross-file defects, why coverage and validity are one dial you can't game separately, and why publishing every score, trace, and judge's reasoning is the point — alongside the honest limits: a finite known-bug answer key and graders that are themselves language models.

Can a code-review benchmark be rigorous AND auditable by anyone? CodeReviewBench plants known bugs, has two independent model judges score reviewer comments, and publishes every trace so you can re-check the leaderboard yourself. Maya and Leo cover the planted-bug bench across TypeScript, Python, React, Ruby and Java; the coverage-versus-validity dial you can't game one side of; the local-logic versus cross-file split that exposes reviewers who can't see around corners; and the two real limits — a finite answer key and model graders that can be fooled. Builds on the prior SWE-PRBench episode's human-annotated ground truth as the complementary opposite.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff panel feeding a trace ribbon that splits into a quiet curated checklist card and a busy stream of pull-request tiles, bridged by a two-headed comparison arrow that continues to a needle trust meter. No text, no 3D.

T2E21 · 2026年6月12日 · 12:00

Martian's Code Review Bench: Graded by Real Developer Behavior

A code-review benchmark that grades itself against real developer behavior

节目笔记

Martian's Code Review Bench (v0) is a code-review benchmark that doesn't fully trust itself. It pairs a curated offline gold set of marked bugs with a live behavioral signal — which review comments developers in a large pool of real open-source pull requests actually act on — and treats disagreement between the two as evidence the benchmark itself is stale. Maya and Leo unpack the 'gold room and the street' design, why acted-upon is a usefulness proxy for review (and where it breaks), and the v0 honesty: the two halves don't agree yet, no tool clears a modest recall bar, and the gold set likely undercounts real issues.

A code-review benchmark that grades itself. Maya and Leo dig into Code Review Bench v0 from Martian: a curated offline gold set paired with a live signal from real open-source pull requests tracking which review comments developers actually acted on — with divergence between the two read as proof the benchmark is wrong, not just the tool. They cover the self-correcting, monthly-refreshed design as a defense against benchmark overfitting, why 'acted-upon' is a behavioral proxy for review usefulness, and the v0 limits: offline and online still diverge, no tool clears a modest recall bar, the gold set likely undercounts issues, and the behavioral street is open-source norms, not every codebase.

来源材料

完整单集页面
2D editorial illustration: a reviewer's loupe over a code-diff panel where a small drafted-patch card hangs under one comment with a cursor about to press apply; a cyan trace ribbon runs through a hidden-test gate to a needle trust meter resting partway up. No text, no 3D.

T2E22 · 2026年6月13日 · 12:31

MetaMateCR: AI-Assisted Fixes to Code Review Comments at Scale

When a developer applies the AI's fix in production, evaluation finally touches ground truth

节目笔记

MetaMateCR is Meta's production study of AI-assisted fixes to code-review comments at scale: instead of just flagging a defect, the system drafts the actual fix and the real signal is whether a developer applies it. Maya and Leo unpack why the applied-fix rate is the strongest real-world evidence in the whole topic — revealed preference in production, impossible to game like a leaderboard — including a sharp developer-in-the-loop lesson (showing the draft to reviewers slowed reviews down; showing it only to authors fixed that) and the honest limitation: the strongest signal is also the least portable, bolted to one company's scale and proprietary comment-fix data.

来源材料

完整单集页面
Flat 2D editorial illustration on dark navy: a large cream magnifier lens lifts one highlighted function card out of a repository file-tree panel and sets it onto a small pass/fail checkpoint gate, with a fanned stack of five file tabs behind the tree and a short rising ladder of gates beside a cyan trace ribbon.

T2E23 · 2026年8月3日 · 11:47

RepoQA: A Unit Test for Find-the-Code, Not Understand-the-Codebase

Why a 90%-on-needle-function score tells you the model can locate code — and almost nothing about whether it should touch it

节目笔记

RepoQA's Searching Needle Function task looks impressive — 500 tests across 50 repositories and five languages, with top models scoring around 90%. But what is that score a score of? Maya and Leo take opposite sides on whether a controlled find-the-function probe still earns its keep in 2026: Maya defends it as the necessary bottom rung every harder repo task depends on, Leo presses the context-length collapses, memorization inflation, and structural blind spots that show the probe doesn't track the job. They converge on a layered evaluation ladder and one blunt synthesis — RepoQA is a unit test for 'find the code,' not an integration test for 'understand the codebase,' and definitely not a safety check for 'make the right change.'

来源材料

完整单集页面
2D editorial illustration: a central four-node agent loop wrapped in a cream harness frame fed by a context card-stack, a tools rail, and a memory note; a cyan trace ribbon spools out to a log reel while an amber arrow hands off to a pull-request branch glyph. No text, no 3D.

T3E0 · 2026年6月19日 · 20:02

Agent Systems, Harnesses, and Observability

Why a coding agent is a system, not a model — and why the crew, not the driver, wins races

节目笔记

A topic-overview map of the coding agent as a system, not a model. Maya and Leo walk four pillars — product-style async workflows that turn a task into a reviewable pull request, single-vs-multi-agent orchestration, harness engineering (context, tools, memory, validators), and observability as the flywheel that feeds debugging, evaluation, training, and safety. Built around one running example: a pit crew servicing a single race car — a payments service silently dropping one in a thousand transactions — where the model is the driver and the harness, orchestration, and telemetry are the crew that actually wins the race.

来源材料

完整单集页面
2D editorial illustration: an assigned-task ticket enters a cream harness frame through a gate into a four-node agent loop fed by a context card-stack, a tools rail (one repo-plug icon, one browser icon), and a memory note; a cyan trace ribbon spools to a log reel while an amber arrow hands off to a dashed, half-open draft pull-request branch glyph guarded by an approval-gate checkmark lens. No text, no 3D.

T3E1 · 2026年6月21日 · 16:24

GitHub Copilot Coding Agent: From Task to Reviewable Work

How an autonomous agent turns one assigned issue into a draft pull request you review like a teammate's

节目笔记

GitHub's cloud coding agent, opened up. Maya and Leo follow one assigned task through four rooms — Intake (the many doors a task enters through), the Workshop (a throwaway GitHub Actions environment where the agent plans, edits, and runs the real tests), the Hand-off (a draft pull request, never an auto-merge), and the Back-and-forth (where a PR review comment becomes the agent's next prompt). Along the way they show the harness made concrete in a settings page — default GitHub and Playwright MCP servers, custom-instruction files, a memory preview — and the guardrails that encode intended task size: no auto-merge, one repo per task, a hard 59-minute ceiling, and branch protections that block the agent until it's explicitly trusted. Running example: an API field rename across forty files, reviewable the whole way down.

来源材料

完整单集页面
2D editorial illustration: one definition-of-done card at the left splits into three arrows feeding three identical sealed sandbox boxes inside a cream harness frame, each box holding its own four-node agent loop and marked with a small closed-lock notch for internet-free isolation; cyan trace ribbons spool from all three and converge into one shared log reel, then a single amber arrow hands off to a dashed, half-open draft pull-request branch glyph guarded by an approval-gate checkmark lens. No text, no 3D.

T3E2 · 2026年6月19日 · 13:40

OpenAI Codex: Tasks, Workflows, and the Agent-First Loop

How a cloud coding agent turns a 'definition of done' into parallel sealed tasks that hand back evidence, not promises

节目笔记

OpenAI's Codex, made concrete. Maya and Leo follow what it takes to hand a cloud coding agent a job and trust what comes back, organized around three things you pack before sending a task off — the Brief (an explicit 'definition of done' plus a repo-root AGENTS.md the agent reads before any work), the Sandbox (a fresh, isolated cloud environment preloaded with your repo, with no internet access by default though you can enable it per environment, where containment is the safety feature and parallelism falls right out of isolation), and the Receipt (cited terminal logs and test outputs so claims arrive with proof, plus a proposed pull request the human still has to approve). They trace the agent-first loop — plan locally where being wrong is expensive, outsource the long implementation to parallel cloud tasks — across the IDE, CLI, and cloud surfaces, including code review with @codex review. Running tension: Leo's honest objection that parallelism is a throughput lie if every branch funnels back through one human reviewer, and Maya's steel-manned answer — fan out the work where a test can be the judge, keep close the work where you have to be.

来源材料

完整单集页面
2D editorial illustration: a central four-node agent loop in a cream harness frame fans three branch-arrows out to three smaller satellite loops, each carrying its own small context card; their findings converge back to the center, a cyan trace ribbon spools out past a small check-mark footnote node to a log reel, and an amber arrow hands off to a pull-request branch glyph. No text, no 3D.

T3E3 · 2026年6月23日 · 17:36

Building a Multi-Agent Research System

When a team of agents beats one — and the exact seam where fanning out stops helping

节目笔记

Anthropic's engineering writeup on the multi-agent system behind their Research feature, turned into a conversation. Maya and Leo unpack the orchestrator-worker shape — a lead 'Planner' agent that spawns parallel 'Scout' subagents, each with its own context window, plus a citation agent that checks the footnotes — and the ~90% win it posted over a single strong agent on research. Then they stage the real split: when does fanning out help, and when does it corrupt the work? Built around the topic's running example — a pit crew on one race car, a payments service dropping one transaction in a thousand — they find the seam: fan out the wide, separable investigation; keep one hand on the deep, entangled fix.

来源材料

完整单集页面
2D editorial illustration: a central four-node agent loop inside a cream harness frame fed by a checklist of tick/cross marks, a tools rail, and a folded memory note; the memory note is handed across a faint seam from a darkened finished station to a bright new one, while a cyan trace ribbon with a small branch save-point marker spools out to a log reel. No text, no 3D.

T3E4 · 2026年6月24日 · 16:35

Effective Harnesses for Long-Running Agents

How a chain of forgetful agents finishes a project too big for any one of them — the baton, not the brain

节目笔记

Long-running coding agents work in shifts, and every shift starts with amnesia — so the project survives only in what the last one wrote down. Maya and Leo unpack Anthropic's harness write-up around three durable artifacts left on the workbench — a Punch List (a locked-down JSON feature list that doubles as a test sheet), a Shift Log (the handover notes), and a Save Point (git commits you can roll back to) — plus a forced ritual: read everything, build one feature, verify it in a real browser, write it down, commit. They ground it in the topic's payments-bug car, now a multi-day rebuild no single session could hold, and stay honest about the limits: the agent can't see alert modals, and whether one general agent or a crew of specialists is the right design is left open.

Imagine a relay where every runner forgets the race the instant they hand off the baton — that's a long-running coding agent. Maya and Leo dig into Anthropic's harness engineering for agents that build across dozens of memoryless sessions: the two opposite failure modes (one-shotting the app vs. declaring a half-built app done), the split between a one-time setup agent and the coding shifts that follow, and the three artifacts that carry the work — a structured feature list locked into JSON so the model can't quietly rewrite its own scorecard, a progress log, and git save points. They reuse the topic's payments-service bug as a multi-day fix, then mark the seams the source admits: blindness to browser alert modals, web-app-only tuning, and the open question of single agent vs. specialist crew.

来源材料

完整单集页面
2D editorial illustration: inside a cream harness frame, a left maker loop assembles a small app-window while a right critic loop presses a reviewer lens and cursor onto that same running app; a folded contract card sits between them; the inherited context card-stack, tools rail, and memory note feed the frame, a cyan trace ribbon spools to a log reel, and an amber arrow hands off to a pull-request branch glyph. No text, no 3D.

T3E5 · 2026年6月19日 · 14:56

Harness Design for Long-Running Application Development

Why an agent can't grade its own homework — and how a skeptical second agent turns a six-hour build into something that actually works

节目笔记

Hand a coding agent a whole application to build over hours and it will happily finish, look at its own broken work, and call it great. Maya and Leo dig into Anthropic's write-up on harness design for long-running application development, where the fix is architectural: borrow the adversarial shape of a GAN and split the job into a Maker that builds, a Critic that tries to tear the work apart, and a Contract that pins down what 'done' means before any code is written. They unpack why separating the roles buys tractable skepticism rather than free skepticism, why the Critic must click through the live app like a user instead of grading a screenshot, how the exact wording of the grading criteria quietly steers the whole product, and why a strong harness is scaffolding you tear down as the models get better — costs, blind spots (the agent can't hear its own music app), and all.

来源材料

完整单集页面
2D editorial illustration: a four-node agent loop running inside a cream harness frame drawn as a small workshop bay; fed by a trimmed index card-stack, flanked by linter guard-rail bars stopping a mis-routed arrow on one side and an inspection mirror-lens on the other; a cyan trace ribbon spools to a log reel and an amber arrow hands off to a pull-request branch glyph. No text, no 3D.

T3E6 · 2026年6月26日 · 15:03

Harness Engineering in an Agent-First World

A million lines, fifteen hundred pull requests, zero human-written code — and the four jobs the environment had to do

节目笔记

What were the humans doing if agents wrote every line? Maya and Leo dig into OpenAI's harness-engineering report — a five-month run that shipped roughly a million lines of code across about fifteen hundred pull requests with no code written by human hands. The episode names the four jobs the environment had to do: the Map (a ~100-line agent file as a table of contents, because context is scarce), the Rails (mechanical enforcement via layered architecture and linters whose errors carry the fix), the Mirror (verification loops that give the agent senses and hard thresholds), and the Janitor (scheduled agents that clean up AI slop). Leo steel-mans the cost — the heavy harness ran a lot more expensive than a solo agent — and they settle on what's transferable (the discipline) versus local (the economics), landing on the season's turn: in an agent-first world, you build the garage, not the car.

来源材料

完整单集页面
2D editorial illustration: an inner four-node agent loop in a cream harness frame is enclosed by a larger outer 'proposer' loop whose arrow reaches a filesystem shelf stacked with past harness cards, each paired with a small trace reel; cyan trace ribbons feed into the shelf, the proposer loops back to redraw the inner harness frame, and one discovered harness card branches to a row of identical small loops standing for transfer across models. No text, no 3D.

T3E7 · 2026年6月19日 · 17:32

Meta-Harness: End-to-End Optimization of Model Harnesses

When a search process out-designs the best hand-built harness — by refusing to throw its own history away

节目笔记

Every episode of this topic, the harness was hand-built by smart people. This paper asks: who builds the harness, and why is that still a human? Maya and Leo unpack Meta-Harness, an outer loop that searches over harness source code. An agentic proposer reads a filesystem holding every prior candidate's code, scores, and full execution traces — refusing the aggressive feedback compression that hobbles older prompt optimizers — and writes the next candidate. The payoff: a discovered harness beats a state-of-the-art context manager by ~7.7 points at a quarter of the context budget, a single found math harness lifts five held-out models by ~4.7 points, and discovered harnesses out-search the best hand-engineered baselines on terminal coding tasks. The running pit-crew example goes up a floor — a second race engineer who redesigns the crew after reviewing every past race in full telemetry — and Leo presses the honest soft spots: the search cost the abstract never prices, and whether the coding win used held-out tasks or just held-out runs.

来源材料

完整单集页面
Flat-vector navy-and-cream technical diagram: a central agent-loop ring inside a cream harness frame fed by a context card-stack, tools rail, and memory note; an amber hand-off arrow passes through a three-way format-selector gate into a file card, where two wavy snapped channels (broken diff and find-and-replace) fail and one clean channel of tag-chips flows smoothly; a cyan trace ribbon spools to a log reel, and a small padlock bracket fences off an external loop at the frame's edge.

T3E8 · 2026年6月19日 · 16:27

The Harness Problem

Why the edit format — not the model — quietly sets your coding agent's score

节目笔记

Same model weights, double-digit swings in success: this episode digs into Can Bölük's 'The Harness Problem,' which benchmarks 16 models and shows the edit format — how the agent tells a file what to change — can matter as much as a model upgrade. Maya and Leo walk through three editing dialects (patch, search-and-replace, and the content-hash 'hashline' that swaps copying text for pointing at it), why the weakest models gain the most, and the live fight over whether harness research should happen openly or stay locked inside each vendor's walls.

来源材料

完整单集页面
2D editorial illustration: a four-node agent loop inside a cream harness frame, with a jig-clamp guide icon feeding it on the left and two gauge icons reading the output on the right — one a hard-edged dial, one a soft reviewer-lens; the three feed panels, a cyan trace ribbon to a log reel, and an amber pull-request hand-off remain. No text, no 3D.

T3E9 · 2026年6月19日 · 18:36

Harness Engineering as a Discipline

Guides steer, sensors catch, and the loop between them is the engineering — Böckeler's case for naming the field

节目笔记

The closing frame of Topic 3: Birgitta Böckeler's case that wrapping a coding agent isn't folklore — it's a software-engineering discipline. Maya and Leo unpack guides (feedforward controls that steer before the agent acts) and sensors (feedback controls that catch after), the two sensor speeds — computational (fast, reliable) versus inferential (slow, probabilistic) — and the three regulation harnesses: maintainability, architecture-fitness, and the admitted wall, behaviour. What earns the word 'discipline': lifecycle-wide placement and a steering loop where every repeated failure improves the net instead of the catch. Carried on the topic's running example — the pit crew that stops servicing the car and writes the inspection manual every garage must follow.

来源材料

完整单集页面
2D editorial illustration: an improvement bench with a large pull-lever on the left linked across to a small coding-agent figure exercising in a fenced training pen subtly split into four bays; a row of locked control dials, a cyan trace line stepping up, and an amber arrow dropping the gain into an open crate of reusable task-cards. No text, no 3D.

T4E0 · 2026年6月20日 · 15:22

Training Signals and Improvement Studies

How to read a coding-agent improvement study without crediting the wrong thing

节目笔记

A topic-overview map for reading coding-agent improvement studies without crediting the wrong thing. Maya and Leo introduce the five-link Causal Chain — lever, setup, result, artifact, implication — and four 'gyms' one bug-fixing agent gets sent to: the World-Model Room (learn what code does when it runs), the Task Forge (manufacture training tasks), the Reward Range (RL and reward design), and the Terminal Yard (data-engineered environments). Built around one running example — a single team trying to make its agent better at fixing one real repository bug — and a staged debate on synthetic vs. real training tasks.

来源材料

完整单集页面
2D editorial illustration: an improvement bench whose pull-lever is driven by a small execution-trace filmstrip — frames of a code block with changing variable-state cells; the lever links across to a coding-agent figure exercising in a fenced pen holding a magnifier over one code line, past a row of locked control dials, with a cyan trace line stepping up and an amber arrow dropping into an open crate of small container-box artifact cards. No text, no 3D.

T4E1 · 2026年7月1日 · 13:46

CWM — Code Generation with World Models

Teaching a model what code does when it runs, not just how it looks

节目笔记

The first deep dive of Topic 4 opens the World-Model Room. Maya and Leo unpack CWM — Meta's open-weights Code World Models LLM — whose lever is mid-training a 32B model on observation-action traces from a Python interpreter and agentic Docker environments, so it learns what code does when it runs, not just how it looks. They show the payoff on the topic's running bug — a cache that returns stale data on the second call, which a read-the-code model misses and a world model catches by simulating two calls — and stage the real attribution debate: did the trace footage win the SWE-bench number, or did the verifiable-environment RL on top? The throughline: the artifact worth copying is the recipe for turning program runs into world-model training data, and the open checkpoints are an invitation to settle the credit.

来源材料

完整单集页面
2D editorial illustration: an improvement bench whose execution-trace filmstrip is laid flat like a patient on a diagnostic clinic panel, tagged with three icon-only fault markers — a greyed cut-off tail frame (token exhaustion), a variable-cell of torn misaligned pieces (string tokenization), and a wrong-branch fork after which the cells stay tidy (wrong action, state still tracked). A coding-agent figure in a fenced pen holds a magnifier over the filmstrip, a row of locked control dials stands fixed, a cyan trace line steps up, and an amber arrow drops a folded failure-map card into an open artifact crate. No text, no 3D.

T4E2 · 2026年7月2日 · 14:42

Debugging Code World Models

Where a model's in-head simulation of code quietly breaks — and why

节目笔记

Topic 4's second deep dive takes the code world model from the last episode and puts it on the workbench. Maya and Leo walk through Debugging Code World Models — a diagnosis, not an improvement study — that asks where a model's in-head simulation of a running program quietly breaks. They name two close-up failures: honest traces that write the full state after every step get token-heavy enough to exhaust the budget on long programs, and errors that pile up in string-valued variables because subword tokenization lets the model see strings only in misaligned pieces. Then they stage the real split on the long run: is the step-thirty drift a fundamental Transformer limit on state tracking, or something more fixable? The paper's controlled permutation-tracking benchmark separates generating the next action from propagating state — and when correct actions are handed in, state tracking holds, so the drift was wrong-action generation, not broken memory. The throughline: the artifact here is a failure map, and a simulator you can't trust everywhere is still useful if you know exactly where not to trust it.

来源材料

完整单集页面
2D editorial illustration: an improvement bench whose two-notch pull-lever forks into two cyan branches — one looping back into a fenced pen where a coding-agent figure trains (fine-tuning the agent), the other running to a mint reviewer-lens (training the verifier). The agent fans out many small patch-cards for one ticket, some tagged with a pass-tick and some with a fault-mark; the verifier-lens highlights exactly one card, which alone continues along the cyan trace to a rising results step. A row of locked control dials stands fixed, and an amber arrow drops the reusable task-cards plus a stamped graded-trajectory stack into an open artifact crate. No text, no 3D.

T4E3 · 2026年7月3日 · 14:33

SWE-Gym — Training Agents and Verifiers

A cage of runnable bug tasks, and the two levers it lets you pull at once

节目笔记

Topic 4's third deep dive steps all the way out of the agent's head and into the gym. Maya and Leo break down SWE-Gym — the first environment for training real-world software-engineering agents — built from around 2,438 executable Python tasks, each a runnable codebase with stood-up dependencies, wired-in unit tests, and a plain-English problem. Because the tasks actually run, every agent attempt (search, commands, failed test, retry, final diff) gets auto-stamped resolved-or-not by a real check — a mountain of trajectories labeled with ground truth, for free. The episode's spine is that SWE-Gym pulls two levers at once and the hosts refuse to blur them: the successful trajectories fine-tune the agent (a stronger single swing, up to ~19 points absolute), and all trajectories — wins and losses — train a separate outcome verifier that picks the best of many sampled attempts at test time (best-of-sixteen, reaching state-of-the-art for open-weight agents at ~32% on SWE-bench Verified and ~26% on Lite). They stage the real split — better agent vs. better picking — and resolve it into a relay that compounds: the agent must land a correct patch in the batch for the verifier to find it, but the selection lever scales on a second axis (test-time rollouts) and neither curve has plateaued. The throughline: the reusable artifact was never the athlete — it's the cage and the record of every graded swing taken in it.

来源材料

完整单集页面
2D editorial illustration: an improvement bench whose left lever drives a cream 'bug foundry' conveyor — one intact code-card goes in, many small fractured code-cards come out, stamped by four tiny icon-only forge-heads (a pen-nib for LM rewrite, a hammer for procedural syntax edits, two clipped cards for combining, a rewind-arrow for reverting a real pull request). The fractured cards pass a single mint validity gate where each must light a small red test-mark to continue, then feed a fenced pen where a coding-agent figure trains. A row of locked control dials stands fixed; an amber arrow drops one shared environment box (carrying a whole stack of task-cards) into an open artifact crate; a cyan/mint results trace rises at the end. No text, no 3D.

T4E4 · 2026年7月4日 · 16:11

SWE-smith — Scaling Data for SWE Agents

Stop catching bugs, start manufacturing them — four ways to break working code, verified by a real test

节目笔记

Topic 4's fourth deep dive turns scarcity into manufacturing. The whole public world holds only a few thousand real, runnable bug-fixing tasks — so Maya and Leo unpack SWE-smith, a pipeline from the SWE-bench team that stops catching bugs and starts making them: point it at a Python repository, stand up its environment, and automatically forge verified bug tasks by breaking working code. They walk the four bug-forging stations — an LM rewriting a function to be subtly wrong, blunt procedural edits to the syntax tree, combinations that make compound fractures, and PR mirroring that reverts a real human pull request — landing about fifty thousand tasks from roughly a hundred and twenty-eight repos, an order of magnitude past prior work. The load-bearing distinction: the bug's ORIGIN can be synthetic, but its FAILURE never is — every surviving task must make a real test go red. The episode stages the genuine intra-paper split over bug provenance (cheap-but-invented vs. authentic-but-scarce reverted PRs) and resolves it into a portfolio: the realistic source sets the quality ceiling, the infinite sources fill the volume. The proof it transfers — an open agent trained on the manufactured flood resolves about forty percent of the real SWE-bench Verified exam, state of the art among open models — and the durable artifact is the bug-manufacturing pipeline, not the model.

来源材料

完整单集页面
2D editorial illustration: an improvement bench where the lever's linkage reaches a cream 'comparison grader' instead of a test harness — two patch-cards lie side by side, a cyan candidate patch and a mint human-merged patch drawn from a long ribbon of past pull-request cards, clamped by a small overlap/diff bracket that emits a single partial-fill cyan bar (a similarity score, a smooth dial rather than a pass/fail check). A long horizontal ribbon of many tiny stacked pull-request cards feeds the lever (public software history replacing a built environment); a torn-cornered amber card sits in a discard slot (the penalty for an unparseable patch). A fenced agent pen trains from the grader's signal, a row of locked control dials stays fixed, a cyan/mint results trace rises, and an amber arrow drops a small reward-recipe card into an open artifact crate. No text, no 3D.

T4E5 · 2026年7月5日 · 15:55

SWE-RL — Reinforcement Learning on Software Evolution

Reinforcement learning that never runs the code — grading patches against the fix a human actually merged

节目笔记

Topic 4's fifth deep dive throws out the stopwatch. Every prior episode graded a coding model by RUNNING the code — build the gym, run the tests, pass or fail is the truth. SWE-RL refuses to run anything: Maya and Leo unpack a method from Meta that does reinforcement learning on raw software-evolution data — the public history of issues, pull requests, and merges — and grades each generated patch by how closely it resembles the fix a human actually merged. The reward is a text-overlap score (a sequence-matching ratio, the kind behind a diff view), a smooth dial from zero to one rather than a single pass/fail bit, with a negative penalty for any output that won't even apply. That dense signal scales to essentially all of GitHub with no environment to build. The episode stages the real split it provokes — does grading resemblance teach correct repair, or just mimicry of human style, since a genuinely better-but-different patch scores low? It resolves into a division of labor: the soft reward buys REACH (every merged patch becomes a training signal), execution buys CERTAINTY (a passing test is ground truth). The proof it transfers: the resemblance-trained 70B Llama resolves about forty percent of the executable SWE-bench Verified exam — best at the time for any model under a hundred billion parameters — and, trained only on software fixes, it got BETTER at math, reasoning, and language it never trained on, while a supervised-copy baseline got worse. The durable artifact is the similarity-reward recipe, not the model.

Last episode SWE-smith manufactured executable tasks where verified failure — run the test, watch it go red — was the whole point. This one pulls the floor out: SWE-RL does reinforcement learning and never runs a line of the code it produces. Maya and Leo dig into a Meta paper that trains on raw software-evolution data (the public record of issues, pull requests, and merges) and grades each generated patch by its TEXT SIMILARITY to the patch a human actually merged — a smooth overlap score instead of pass/fail, with a negative penalty for outputs that won't even apply, computed across millions of pull requests with no environment to stand up. They stage the real fight it starts: a resemblance reward might teach style rather than skill, and it under-credits a correct-but-different fix that diverges from the human's — but a passing-test signal is something you can only compute a thousand times, while resemblance you can compute a billion. It resolves into a division of labor — soft reward for reach, execution for certainty — and the punchline lands twice: the resemblance-trained 70B Llama resolves about two in five real, executable SWE-bench Verified issues (best at the time under a hundred billion parameters), AND it generalized outward, getting better at math, code reasoning, and language it never trained on while a supervised baseline degraded. The takeaway: execution tells you WHETHER it worked, resemblance tells you WHICH WAY is warmer — and a warm signal you can compute a billion times beats a perfect one you can run only a thousand. The artifact you keep is the reward recipe, not the checkpoint.

来源材料

完整单集页面
Flat-vector navy-and-cream technical diagram: a coding-agent figure in a fenced training pen swings at a patch card and fails a mint unit-test gate; a curved cyan arrow loops feedback (a plan tile, a torn error slip, a footstep step-note) back into the pen, after which a second swing passes; a small reviewer-lens scout beside a rising results trace highlights one card from a fan of finished patches; an amber arrow drops an unlabeled stack of trajectory cards (some with a small red fault-mark, some with a mint check) into an artifact crate.

T4E6 · 2026年7月6日 · 16:07

Agent-RLVR — Guidance and Environment Rewards

How coaching a failing agent turns a too-sparse reward into a teachable one

节目笔记

Reinforcement learning from verifiable rewards is honest but unforgiving: on real software-engineering tasks a base model almost never passes, so the reward almost never fires and there is nothing to learn from. Agent-RLVR keeps the strict unit-test reward and adds guidance — strategy, error feedback, and interaction notes fed back after a failed attempt so the agent can re-attempt and win on its own. Those manufactured successes tripled resolve rate on a 72B model, and the same logged attempts trained a reward model that picks the best patch at test time. Maya and Leo stage the real split — is the test the teacher, or is the guidance? — and resolve it into a division of labor: guidance for reach, the verifiable reward for truth.

来源材料

完整单集页面
Flat-vector navy-and-cream technical diagram: a coding-agent pen sprays patch-cards into a forked two-judge gate — one mint execution/test-tick grader, one cyan reviewer-lens diff grader — and only cards stamped by both rise along a cyan results trace; a stack of commit-cards feeds the lever, and the artifact crate holds a pipeline-recipe card and a two-grader scheme card.

T4E7 · 2026年7月7日 · 17:19

R2E-Gym — Procedural Environments and Hybrid Verifiers

Mining commit history for executable tasks, and picking the winning patch with two graders that fail differently

节目笔记

Executable software tasks are scarce because the grader is the expensive part. R2E-Gym mines them straight from commit history — back-translating verified human fixes into tasks and keeping only the generated tests that actually separate broken from fixed. Then it tackles a second problem nobody had nailed: when you can't run the hidden test, which of the agent's candidate patches do you ship? An execution verifier and an LLM judge each cap in the low forties on SWE-bench Verified — but they fail on different patches, so combining them lifts an open 32B model to fifty-one percent. Maya and Leo stage the execution-versus-judgment fight in full and resolve it into a rule worth keeping: a perfect grader is a fantasy, two graders that fail in opposite directions are a strategy.

来源材料

完整单集页面
Flat-vector navy-and-cream technical diagram: a horizontal data-factory conveyor runs through four icon-only stations — a container-builder turning a repo-card into a runnable box, a press stamping out many tiny bug-fix cards, a single detailed repair card with an issue-report slip, and a blueprint being assembled into a built structure — each output carrying a QC stamp drawn firmly for the repair lanes and faintly for the build output; the artifact crate holds a small factory-line icon card instead of plain task-cards, beside the inherited agent pen, control-dial row, and rising results trace.

T4E8 · 2026年6月20日 · 18:21

SWE-Hub — A Production System for Executable SWE Tasks

From hand-making one training task at a time to running the data factory: four stations from environment to feature creation, on one line

节目笔记

Every other paper in this topic perfected one kind of training task — forge a bug, mine a commit, grade with two judges. SWE-Hub stops making dishes and builds the line. It operationalizes a 'data factory': four integrated stations on one floor — an Env Agent that turns any repo into a runnable multi-language container, a high-throughput engine that presses out cluster-validated localized bug-fixes, a Bug Agent that builds realistic system-level repairs with human-like issue reports, and SWE-Architect that goes past repair into building whole features from a spec. Maya and Leo stage the real fight in full: is covering creation, not just verified repair, a leap in capability or a crack in the verified foundation? They resolve it into a rule worth keeping — breadth across the lifecycle is the right bet, but trust is not uniform across the floor, so an honest factory labels which station each task came off and never lets a soft build-grade pass as a verified fail-to-pass.

来源材料

完整单集页面
Flat-vector navy-and-cream technical diagram: two small task-kitchen heads feed a pull-lever — one stamping copies off a single real reference card (seed-based), one fanning fresh cards out from a skill-tile cluster (skill-based) — both pouring through a mint quality-filter gate that passes a few cards and drops most into an amber reject bin; inside the fenced pen a small agent figure operates a stubby command-prompt panel with an output strip (driving a terminal), the control-dial row re-drawn as three icon knobs (funnel/filter, stepped ladder/curriculum, long bar/long-context), and the artifact crate holding one small pipeline icon card beside the rising results trace.

T4E9 · 2026年6月20日 · 16:52

Nemotron-Terminal — Data Engineering for Terminal Capability

How a synthetic task pipeline taught a 32B model to drive a terminal — and matched models twice its size

节目笔记

A coding model can write a flawless shell script and still freeze the moment it has to drive a live terminal. Nemotron-Terminal treats that gap as a data-engineering problem, not a model-size one: it manufactures terminal-training tasks entirely synthetically — seed-based generation for fidelity, skill-based construction for coverage — then does the real work in selection, with hard quality filtering, a difficulty curriculum, and long-context training. Maya and Leo walk the two 'task kitchens' and the three engineering 'dials', stage the seed-vs-skill design debate, and unpack how a 32B model jumps from roughly 3% to 27% on Terminal-Bench and matches much larger systems — while staying honest about the synthetic-dialect risk and how far a single benchmark generalizes.

来源材料

完整单集页面
Flat-vector navy-and-cream technical diagram: a cream exam envelope held shut by a mint padlock (the sealed hosted test set) fans out three icon-only spec slips toward a fenced pen — a lined prose slip (product spec), a small framed wireframe slip (Figma design), and a thick two-tone layered stack-card (the mixed Swift/Objective-C codebase); inside the pen a small agent figure works against a tall phone-shaped app frame, and the cyan results trace rises only one short step before stalling low (the ~12% ceiling). A second identical agent-in-pen wired to the same locked envelope reaches a much higher step, with a small cyan branch fork between the two (same model, up to six-fold swing across agent designs). The artifact crate holds one icon-only ruler card stamped with the same padlock — a sealed yardstick, not task-cards.

T4E10 · 2026年6月20日 · 17:25

SWE-Bench Mobile

The topic built ten gyms; this is the sealed final exam — a real production iOS app where the best agent scores twelve percent

节目笔记

Topic 4 spent nine episodes building gyms — places to train coding agents. SWE-Bench Mobile builds the sealed final exam, and it comes back brutal. Drawn from a real production iOS app, each task hands the agent a written product spec, a Figma design, and a quarter-million-line mixed Swift/Objective-C codebase, then grades it on held-out tests that only pass if the project first builds in a simulator — run as a hosted challenge so the questions stay locked. The best of twenty-two agent-model configurations scores about twelve percent. Maya and Leo unpack why mobile is harder than the SWE-bench everyone quotes, stage the model-capability-vs-agent-design debate (the same model swings up to six-fold across agents; simpler prompts beat elaborate ones), and land on the capstone reading: the model sets the ceiling, the agent design decides how much of it you reach — and a low score on the real job is the first honest measurement, not a verdict that agents are useless.

来源材料

完整单集页面
2D editorial illustration: one cream work-record card for a bug-fix run, its body split into six icon-only layer-bands (ticket, container, dotted trajectory ribbon, check-and-cross, warning triangle, padlock), half-slid into an open filing-cabinet drawer; a cyan sorting fork copies the card into three bins — an open cyan trainable tray, a sealed mint eval-only tray, and a locked amber safety vault — with a small scanner lens passing over the card. No text, no 3D.

T5E0 · 2026年7月11日 · 17:01

Data Products for Agentic Coding Training

Why the deliverable for a model-training team is a replayable work record, not a pile of code

节目笔记

A topic-overview map for the unglamorous question every model-training team eventually faces: when a coding agent finishes a run, what do you actually write down? Maya and Leo argue that the deliverable is not code but a replayable work record, and walk a six-drawer filing cabinet — Task, Environment, Trajectory, Verification, Failure-and-Safety, Governance — built around one running example: a single bug-fix run treated as a hospital chart. They show how the same run becomes three different products (trainable, eval-only, safety-sensitive) and stage the real expert split — public benchmarks vs. fresh private evals — as a first-person debate resolved by watching the contamination gap.

The valuable output of a coding agent isn't the patch — it's the replayable record of how the work happened. Maya and Leo open the six-drawer filing cabinet of an agentic-coding data record (task, environment, trajectory, verification, failure-and-safety, governance) through one running example: a single bug-fix run as a hospital chart. They show why failed steps are worth more than clean wins, why a passing test isn't the same claim as 'a senior would ship this,' and how the same run sorts into trainable, eval-only, or safety-sensitive products. Includes the staged debate — shared public benchmarks vs. fresh private evals — resolved by watching the gap between the two scores. The throughline: collect work traces, not just code.

来源材料

完整单集页面
2D editorial illustration: a cream work-record card half-slid into an open filing-cabinet drawer, enlarged so its top two icon-only layer-bands read clearly — a ticket/clipboard task band fixed by a small pin to a frozen repo-snapshot icon, and a container/box environment band clamped shut to read as runnable. A trajectory ribbon flows out of the environment band tethered by a thin alignment thread, and a scanner lens passes over the card top; behind, a cyan trace ribbon runs to a sorting fork feeding an open cyan trainable tray, a sealed mint eval-only tray, and a locked amber safety vault. No text, no 3D.

T5E1 · 2026年7月12日 · 14:24

The Agentic Coding Data Record

Why the commit pin and the runnable environment are the two load-bearing fields in a replayable work record

节目笔记

A field-by-field read of the agentic-coding data record. Maya and Leo open the top three drawers of one bug-fix run — task, environment, trajectory — and argue that the two least glamorous fields, the commit pin and the runnable environment, are the load-bearing ones: freeze the world the agent saw, or every downstream replay, re-grade, and failure reproduction falls apart. Then they stage the real expert split on the verification drawer — executable tests vs. human/LLM judgment — and resolve it by recording all three signals separately so the place they disagree becomes the most valuable label in the record.

What actually has to be in a coding-agent's record so someone else can replay it six months later on a clean machine? Maya and Leo open the top three drawers of one bug-fix run — task, environment, trajectory — and make the case that the two boring fields nobody gets promoted for, the commit pin and the runnable environment, are the load-bearing ones: a patch is directions with no map unless the repo is frozen at one commit, and a written description of an environment trusts a hostile future to still install. They show the three drawers are a dependency chain, then stage the genuine expert split on verification — executable tests (deterministic, trainable) vs. human and LLM judgment (maintainability, intent) — and land on recording all three signals separately, because a 'tests-green but human-rejected' disagreement is the most valuable label in the whole record.

来源材料

完整单集页面
2D editorial illustration: the trajectory band of a cream work-record card enlarged into a long step-dotted ribbon of small icon-only step-nodes — a magnifier for search, a file for read, a pencil for edit, a check-or-cross for a test run. Partway along, one node is stamped with a small cross (a wrong move) and the next node bends back to rejoin the line as a recovery turn, so the path reads as failed-then-recovered rather than straight. Small color-coded tags clip onto each node (step labels / action taxonomy) and a scanner lens hovers over the recovery bend. The rest of the record card sits in its open filing-cabinet drawer at left, and a cyan trace ribbon runs to a sorting fork feeding an open cyan trainable tray, a sealed mint eval-only tray, and a locked amber safety vault. No text, no 3D.

T5E2 · 2026年7月13日 · 12:15

Trajectory Data for Training and Analysis

Why failed and recovered agent runs — labeled step by step and typed by action — are the richest training and diagnostic data in the record

节目笔记

What's actually inside a coding-agent trajectory, and should you keep the runs that went wrong? Maya and Leo live inside the trajectory drawer of one bug-fix run — the agent edits the wrong file, the test fails, it reads the error and recovers — and argue that the recovery is the most teachable second in the run, even though most teams archive only 'solved in two tries.' They stage the real expert split over training on failures (imitation learning imitates the flailing) versus keeping them (clean wins never show recovery), and resolve it: it's labeled failures vs. raw failures, where step-level labels and an action taxonomy turn a junkyard of broken runs into a parts catalog you can both train on and study.

The final diff is the destination; the trajectory is the drive — and you learn very different things from each. Maya and Leo open the trajectory drawer of one bug-fix run, where the agent edits the wrong file, the test fails, and it reads the error and recovers on the second try — then watch the team archive only 'solved in two tries' and throw away the single most teachable second. They take opposite sides of a genuine split: train only on clean successes (every token is a token the model might imitate, so failures teach the flailing) versus preserve failed and recovered runs (clean first-try wins show error recovery exactly zero times). The argument collapses to labeled failures vs. raw failures: keep the negatives, but only once step-level labels and an action taxonomy mark the wrong move and the recovery and type each step — search, edit, test, retry — so the recurring failure shapes (can't-find-the-file, invented API, misread test, over-editing, the same-move loop) separate into a map you can train on and query. One honest limit: a trajectory shows the plays you ran, never the better play you never called.

来源材料

完整单集页面
2D editorial illustration: the verification band of a cream work-record card enlarged into a short vertical ladder of icon-only stamp-rungs climbing the card — bottom rung a check for a passed public test, next a check behind a shield for a passed hidden test, next a lens-and-check for a verifier score, top rung a small human head with a speech bubble for human review. The machine rungs each show a cyan check while the top human rung shows an amber cross, reading as a green-machines / red-human disagreement. A small review-transcript slip clips off the top rung with icon-only comment marks — one carrying an applied-fix tick (acted on), one struck through (ignored) — and a clock with a late red dot hangs past the top of the ladder as a post-merge regression arriving after the fact. The rest of the record card sits in its open filing-cabinet drawer at left, and a cyan trace ribbon runs to a sorting fork feeding an open cyan trainable tray, a sealed mint eval-only tray, and a locked amber safety vault. No text, no 3D.

T5E3 · 2026年7月3日 · 13:44

Verification and Review Labels

Why a passing test is a fact and not a verdict — and how the rich labels above the test line (code quality, review acceptance, severity, acted-on comments, post-merge regressions) are the ones training teams actually need

节目笔记

Once a coding agent's patch passes every test, what's left to label? Maya and Leo open the verification drawer of one bug-fix run — public tests green, hidden tests green, verifier score high — and then the senior engineer rejects it in ninety seconds: 'this works, but nobody will be able to maintain it.' That gap between the green machines and the red human is the episode. They climb the verification ladder (public tests, hidden tests, verifier score, human review), show that a review is a transcript of comments and severities rather than a yes/no, and stage the real expert split over code review: optimize for recall (catch every bug, tolerate noise) versus trust (a noisy reviewer gets muted even when it's sometimes right). The resolution: stop scoring reviewers on theoretical bug recall and score them on whether a developer actually acted on the comment — the quietest label in the drawer and the one that settles the fight.

A patch can be green on every machine and still be wrong to ship. Maya and Leo open the verification drawer of one bug-fix run — public tests, hidden tests, and the verifier model all say yes, then the senior engineer rejects it with one line about maintainability — and use that green-machine / red-human gap to unpack why training teams need labels beyond pass/fail. Green is a fact; good is a judgment. They climb the verification ladder from the weak green of public tests the agent could see, to the stronger green of hidden tests it couldn't, to the verifier score, to human review — and show that review acceptance isn't a yes/no but a transcript: comments, severities, author responses, and whether the fix got applied. Then they take opposite sides of a genuine split on what makes a reviewer good: maximize defect recall and flag everything (a missed bug is the expensive one) versus maximize precision and trust (high-volume noisy comments get the whole reviewer muted, so the real bug at comment thirty-seven goes unread). Both extremes fail, and the resolution is to change what you measure — score a reviewer on whether developers acted on its comments, the referee that settles recall versus trust and the highest-value field in the drawer. One sobering label sits above the rest: the post-merge regression, the only verdict reality gives you after every earlier signal said yes. The honest limit: the richest labels are human judgments, and human judgments are noisy — so record who said it and what happened next, never just 'good: yes.'

来源材料

完整单集页面
2D editorial illustration: at far left a small app/window panel with a branch-and-pull-request fork mark emits a stream of identical small cream record cards along a cyan trace ribbon, reading as a live product producing records as exhaust. Before the ribbon reaches an open filing-cabinet drawer, the card-stream passes through a vertical gauntlet of four small inline gate-checkpoints, each holding a tiny icon-only glyph — a head silhouette for privacy, a key with a slash for secret-scan quarantine, a document with a seal for license, two overlapping rings for contamination overlap with the eval set. One card bounces off a gate and peels away downward as a rejected record. A small scanner lens hovers over the gate row as the governance scan. Cards that clear all four gates continue into the cabinet drawer and on to a sorting fork feeding an open cyan trainable tray, a sealed mint eval-only tray, and a locked amber safety vault. Calm left-to-right system diagram, navy background, no text, no 3D.

T5E4 · 2026年7月15日 · 16:30

From Production Telemetry to Training Data

How the exhaust of a live coding-agent product — branches, reviews, merges, post-merge outcomes — becomes the most valuable training data you have, but only after it survives a gauntlet of privacy, secret-scan, license, and contamination gates

节目笔记

The best training data you could want is the run that already happened in production — a real ticket, an agent's pull request, a reviewer's two changes, a clean merge, three weeks live with no rollback — and at most companies it gets deleted at midnight. Maya and Leo follow that record out of a live coding-agent product and ask how its exhaust becomes usable training data. Telemetry hands you four labels reality wrote for free (did it merge, did the developer rewrite it, did the comments get applied, did it survive post-merge), but it is guilty until proven clean: it has to run a gauntlet of four gates — privacy, secret-scan, license, contamination — and fail any one and it is not data. Then they take opposite sides of the real split: manufacture clean synthetic tasks you fully control, or mine the radioactive-but-real production stream. The resolution is a division of labor — synthetic for volume and coverage, telemetry for distribution-truth and reality's labels — and the quiet punchline that the teams who get to learn from production are the ones who built the governance plumbing first.

Imagine the perfect training example: a real engineer's ticket, a coding agent's pull request, a human reviewer's two requested changes, a clean merge, and three weeks in production with no rollback — every label you would pay for, written by reality for free. At most companies that record is deleted at midnight because it ran in a customer's private repo. Maya and Leo use that to unpack module 5.4 — turning production telemetry into training data. Telemetry is the exhaust of a live product (branches, reviews, CI runs, merges, post-merge outcomes), and its appeal is simple: a synthetic task is something you describe, a telemetry record is something that actually happened, carrying four reality-labels nothing else can give you. But it is radioactive, so before a single record becomes data it runs a gauntlet of four gates: privacy (whose information is in it), secret-scan (a leaked credential poisons the weights and can never be un-leaked, so the whole record is quarantined), license (are we allowed to train on this code), and contamination (does it overlap the eval set and teach the model its own exam). Then they stage the genuine split — synthetic data, clean and scalable by construction, versus production telemetry, the only real distribution — and land on a division of labor: synthetic for volume and controllable coverage, telemetry for distribution-truth and the labels reality writes for free, with the quiet punchline that whether you get to use telemetry at all is decided by whether you built the privacy, secret-scan, license, and contamination plumbing before you needed it. Governance is the permission slip, not the tax. The honest limit: even cleaned telemetry is a mirror of today's product, blind to the tasks users never tried, and its free labels are still tired-human judgments — a merge can mean 'this is good' or 'it's Friday, ship it' — so never confuse 'this happened in production' with 'this was good engineering.'

来源材料

完整单集页面
2D editorial illustration: a tall cream work-record card divided into six thin icon-only layer-bands (ticket, container, step-dotted ribbon, check-and-cross, warning triangle, padlock) is half-slid into an open cream filing-cabinet drawer on the left, feeding a cyan trace ribbon into a sorting fork on the right. Pinned to the card's bottom governance band sit three tiny clearance tags — a sealed document for license, a head silhouette for private information, a key with a slash for secret-scan. Rising straight out of the sorting fork is a solid flat cyan dividing wall that cleanly separates a cyan trainable tray on one side from a sealed mint eval-only tray on the other, so train and test cannot touch; an amber safety vault stays locked at a third track. Inside the sealed eval tray sits a small flag-on-a-pin canary marker with a faint line back to the wall, a planted leak detector. A small scanner lens hovers over the card's governance band. Calm left-to-right navy system diagram, no text, no 3D.

T5E5 · 2026年7月3日 · 17:25

Governance and Splits

Why the last drawer of the data cabinet — license, secret-scan, and private-info clearance plus the train/eval split — decides whether every benchmark number above it is trustworthy or a memorization score in a capability costume

节目笔记

A team's benchmark climbs past eighty, the champagne comes out — and then a skeptic finds an eval task sitting in the training data. Same repo, same bug, same fix. The model didn't learn to debug; it learned to recite. Maya and Leo open the last drawer of the data cabinet — governance — and find it doing two jobs in one coat: clearance (is this code licensed, is there private information or a live secret buried in it, each a standing flag the record carries as proof) and placement (is this a study card or a test card). Then they fight about the hard half: a random ninety-ten split is the bug, because cards from one repository share DNA and old-versus-new snapshots leak a codebase's future — but holding whole repos out for eval can starve a small team of its best training data. They land on a real resolution: keep your hardest repos in training, seal a separate small private eval up front, keep it fresh by harvesting new held-out tasks, and plant canaries to catch the leaks you missed. The punchline that stings: the honest team posts a lower number than the sloppy one and loses the demo — until production, where a memorization score evaporates and a real one holds. A benchmark is only worth as much as the wall between training and test.

A team trains an agent on its full data lake, the benchmark climbs past eighty, and then someone pulls one eval task and finds it sitting in the training data — same repo, same bug, same fix. The score wasn't capability. It was memorization in a costume. Maya and Leo use that to open the sixth and last drawer of the agentic-coding record card — governance — and module 5.5 of the curriculum: governance and splits. The drawer does two jobs. Clearance asks whether a record may exist in the corpus at all: is the code licensed for training, is a real person's data in it, is a live credential buried in a log line (and the brutal rule — a secret fails the whole record, not the line, because a model has no delete key), each check stamped as a standing flag so provenance travels with the data. Placement asks which pile a cleared record belongs to: train, eval-only, or safety. Then they stage the genuine fight over the train/eval split. A random shuffle is a self-inflicted lie, because the unit isn't independent — near-duplicate cards from one repository and old-versus-new code snapshots let the model recite answers it studied; you cannot half-leak a repository. But a strict structural holdout can yank a small team's hardest, richest repos out of training to protect a benchmark, a purity tax not everyone can pay. The resolution is real: keep the hard repos in training, designate a separate small private eval up front that nothing in training has touched, keep it honest with freshness (continuously harvest new held-out tasks created after the latest training cut), and audit the wall with canaries — uniquely planted markers that trip when the model emits something it could only have learned from the sealed eval. The honest limits land hard: perfect separation is impossible because open source is one shared corpus, so you bound contamination rather than close it; and governance costs the wrong people — the careful team posts a lower number than the sloppy one and loses the demo, until production settles it. A benchmark number is only worth as much as the wall between your training and your test.

来源材料

完整单集页面
A flat-vector technical illustration on dark navy: one layered work-record card with six icon-only bands, a faint cyan blueprint grid stamped over it and connector lines threading all six bands down to a single key icon; three slim cream view-frames fan off the same card each highlighting a different subset of bands, with a small version tab at the corner. The card slides into a filing drawer that forks at a cyan/mint sorting point into a cyan trainable tray, a sealed mint eval-only tray, and a locked amber safety vault, a scanner lens passing over the card.

T5E6 · 2026年7月17日 · 17:15

The Six-Layer Content Schema

Why a data product is a contract, not a folder

节目笔记

Six episodes opened the drawers; this finale asks the question that makes them worth anything — what shape must the record take? Maya and Leo separate a schema from a list: required typed fields enforced at the door, join keys that wire the six layers so cross-layer questions become one query, and one shared record that training, eval, safety, and product each read as a different view. Then they fight the real schema-design tension — rigid up-front normalization versus flexible append-as-you-learn — and land on a typed spine plus a versioned extension area. The episode closes on the limit a schema can't fix: it guarantees shape, never truth.

来源材料

完整单集页面