Harness & Self-Improvement · 30 Tough Questions
Each with intent, framework, and bonus points: Harness essence / design patterns / context auto-evolution / reward hacking / RSI progress and risks
THE QUESTION THIS PAGE ANSWERS
ANSWER FIRSTWhat is the key idea behind “Harness & Self-Improvement · 30 Tough Questions”?
Each with intent, framework, and bonus points: Harness essence / design patterns / context auto-evolution / reward hacking / RSI progress and risks
Make the claim earn its place. Use this page as a decision aid, not a definition to memorize. Connect the idea to one real task, one observable result, and one failure that would change your mind.
Write one question you could answer with evidence after trying this idea.
A conclusion that sounds complete but leaves the key assumption untested.
- Define it first: Harness is the runtime system surrounding the base model. It determines how the model thinks and plans, calls tools and acts, perceives and manages context, stores artifacts, and evaluates results. The model provides the intelligence; Harness makes that intelligence work in the real world.
- Provide evidence: Successful products like Claude Code, Codex, and Cursor have proven that the Harness layer is as important as the raw model intelligence. A mediocre model with an excellent Harness often outperforms a stronger naked model.
- Explain the PM perspective: Swapping models is easy — Harness is the product's true moat. With the same model, the quality of the Harness design can produce user experience differences of several orders of magnitude.
- Elevate the insight: Harness is shifting from a supporting engineering role to becoming the optimization target itself. Cutting-edge research lets models improve the Harness surrounding them — this is the real-world path to recursive self-improvement.
- Name the three patterns: workflow automation, filesystem as persistent memory, and sub-Agents with background tasks. These cover 90% of the architectural decisions in today's most capable Agent systems — they are structural requirements with no real optionality.
- Pattern one — the loop: An Agent is a goal-oriented loop: Plan → Execute → Observe → Improve → Execute again. Failure is the trigger for self-correction: a failing test or a command error causes the Agent to analyze its trajectory and adjust.
- Pattern two — memory: Artifacts from long tasks quickly overflow the context window. The right approach is to persist state to the filesystem and let the Agent read and write as needed. One-sentence principle: context is working memory; filesystem is long-term memory.
- Pattern three — parallelism: The parent Agent acts as a process manager: spawning sub-Agents, polling progress, canceling failed branches, and merging results. Sub-Agent outputs must be persisted to files so they can be recovered after interruption.
- Diagnose the root cause first: Most likely it is naive append-only context management. Stuffing all tool responses and history into the context fills the window as the task runs long, pushes out early information, and causes output quality to plummet. This is a strategy problem — a bigger context window only delays the symptoms.
- Phase 1 solution: Introduce filesystem persistent memory. After each round, write progress, error logs, and intermediate results to files, freeing the context; read selectively on the next round. Context usage goes from continuously growing to constant, enabling stable runs of dozens of rounds.
- Phase 2 solution: Introduce ACE-style structured context maintenance. Generator does the work, Reflector reviews and distills insights, Curator organizes insights into itemized playbooks, incrementally merging and deduplicating. Experience gets sharper with use while the context gets leaner.
- Timeline commitment: Phase 1 is an engineering refactor — results visible within a week. Phase 2 requires building an evaluation set to verify convergence; report changes in long-task success rates bi-weekly using metrics.
- Correct the premise first: Manual Prompt writing is just the starting point. The optimization target follows an evolution line: instruction Prompt → structured context → workflow → Harness code → optimizer code. The stronger the model, the more complex the target it can optimize.
- Explain ACE: It optimizes context content. Maintains a structured bullet-point playbook; Generator executes tasks, Reflector distills insights from success and failure trajectories, Curator incrementally merges entries using deterministic logic. Never rewrites in bulk — avoids context collapse. The limitation is that update rules still require manual design.
- Explain MCE: Separates "how to manage context" from "what is in context" — two-layer optimization. The inner layer finds the optimal context for a given skill; the outer layer compares different skills to select the optimal mechanism. Both what you remember and how you remember evolve together.
- Explain Meta-Harness: One layer deeper — the optimization target is the code itself that determines how information is stored, retrieved, and presented. The Proposer is a coding Agent that outputs a set of Harness candidates on the Pareto frontier. Most general, but each revision requires a full trial run to score, making it the most computationally expensive.
- Acknowledge the problem is real: This is reward hacking — the most dangerous anti-pattern in self-improvement loops. Optimizing unit tests leads to overfitting test cases; optimizing the judge model teaches gaming; optimizing benchmark scores leads to exploiting benchmark flaws.
- Give the boundary principle: Evaluators and permission controls must sit outside the evolution loop, maintained by humans or tamper-proof independent mechanisms. The exam setter and the grader must be independent of the student being tested. The editable surface must have boundaries — editing at the OS system-config level breaks the abstraction boundary.
- Give the validation mechanism: Reference the Self-Harness three-stage loop. Weakness Mining clusters failure patterns from failure trajectories; Harness Proposal submits bounded edits; Proposal Validation uses held-in and held-out datasets to verify — only accepting edits with no regression.
- Give the capability prerequisite: STOP experiments show that a recursive structure does not guarantee improvement by itself. GPT-4 can continuously improve; weaker models amplify noise and actually regress. Before deploying this system, evaluate whether the base model can support meta-level optimization.
- Give the conceptual coordinates first: RSI was envisioned from Good (1965) to Yudkowsky (2008) — a system using its current intelligence to improve the very mechanism that produces intelligence. It remained a theoretical concept for decades; only in the past two years has a real-world path emerged.
- Clarify the real-world path: Models do not directly rewrite their own weights. What they improve is the Harness surrounding them: context management, workflows, tool orchestration, evaluation. A better Harness produces a stronger model; a stronger model in turn simplifies the Harness — a positive-feedback flywheel.
- Give the true state of progress: STOP proved that an improver can recursively improve itself, and automatically rediscovered classic strategies like genetic algorithms and Beam Search. Self-Harness lets Agents improve their own configurations by mining weaknesses, proposing edits, and validating against regressions. But all of this happens inside bounded, verifiable loops.
- Directly answer the out-of-control question: There are still seven gates before "out of control": weak evaluators making feedback signals noisy, poor memory lifecycle management, reward hacking, diversity collapse, and difficulty measuring long-term health. These are fundamental system-design challenges, and the shared solution points toward keeping humans in the loop and providing oversight at the right level of abstraction.
- Name the five-level ladder: instruction Prompt → structured context → workflow → Harness code → optimizer code. Tuning the prompt is only Level 1; the end of this line is optimizing "the code that writes the optimizer."
- Explain the upward shift: The smarter the model, the more complex the target it can optimize and the more general the method. ACE optimizes context content, AFlow searches workflows, Meta-Harness edits Harness source, STOP optimizes the improver itself — each level has representative work.
- Give the PM judgment: First see which level the team is stuck at. Most teams are still between Level 1 and Level 2; every step up steeply raises the demands on the evaluation system.
- Locate the role first: The parent Agent is a process manager and does four things: spawn sub-tasks, check logs and progress, cancel failed branches, and merge successful results. This is operating-system-level thinking.
- Explain explicit inspectability: Parallelism cannot be fire-and-forget. The parent Agent must be able to inspect each sub-Agent's status, output, and errors at any time.
- Explain output persistence: Sub-Agent results should be stored as files, logs, or state records — not only passed back into the parent Agent's context. That way they can be recovered even after an interruption.
- Explain the fault-tolerance net: Background tasks will time out, crash, or produce low-quality results. The Harness must pre-design retry strategies and graceful degradation.
- Give the division-of-labor principle first: Context is working memory; the filesystem is long-term memory. Current-task instructions, immediate tool results, and the last 2–3 turns of conversation go in context; historical experiment results, error logs, summaries of finished sub-tasks, and long-term strategy go in files.
- Explain the artifact reality: Artifacts from long tasks (experiment logs, code diffs, paper abstracts, error traces, full execution trajectories) quickly overflow the context window. Stuffing them all into the prompt is a structural dead end.
- Give the design rationale: File read/write is a basic LLM skill — it needs no complex external toolchain, and it benefits from base-model gains: the smarter the model, the more efficient the file management. A bolted-on memory system does not get that dividend.
- Explain the work habit: A good Agent maintains its own scratchpad, todo list, and experiment notes, managing the workspace the way a human programmer does.
- Give the three conditions of fit: Evolutionary search works only when all three hold: the search space is large and discrete, gradients are unavailable but evaluation is easy, and fitness can be quantified as a number. Only then is it worth adopting.
- Give the unfit list: A single evaluation takes hours, the criteria are fuzzy and subjective, you mainly rely on heuristic judgment, compute budget is limited, or a human-review step is required. Hit any one of these and stay away for now.
- Map it to our own business: The key question is whether our Agent tasks have an evaluation set that can be scored automatically. If not, step one is building evaluation — that priority is far higher than adopting an evolutionary algorithm.
- Give a reference frame: DGM used evolution to lift SWE-bench Verified from 20% to 50%, but that is a coding task where pass/fail is naturally auto-evaluable. First confirm whether your own tasks have that kind of "scale."
- Lay out the mechanism first: ACE maintains a structured bullet point playbook; each entry has an identifier and a description. Generator works from the playbook, Reflector distills insights from success and failure trajectories, and Curator writes those insights back into the playbook.
- Explain the key design: Curator outputs structured (identifier, description) entries and merges them into the playbook with deterministic logic — it never rewrites the entire prompt.
- State the reason: Letting the model iteratively rewrite a whole blob produces context collapse and conciseness bias; useful details get squeezed out pass after pass. Incremental merge plus periodic refine-and-dedup makes experience sharper with use, without making the context thicker.
- Name the limitation: ACE's update rules are still hand-designed — that is exactly the problem MCE then takes on.
- Define skill first: An MCE skill defines a context function c = F(x; ρ). ρ is the static component (prompts, knowledge bases, codebases); F is the dynamic operator (search, select, filter, format). The method of managing context itself is formalized.
- Split the two layers: The inner layer, given a skill, finds the optimal context on the training set; the outer layer compares different skills on the validation set and selects the optimal mechanism. Optimize content first, then method, in alternation.
- Explain the evolution method: The system maintains a skill database recording each (skill, context, train score, validation score) tuple; a Meta-agent uses agentic crossover to hybridize new skills from history.
- Contrast with ACE: ACE's update rules are hand-designed and fixed; MCE puts "how to remember" into the optimization loop as well, so what you remember and how you remember evolve together.
- Explain the storage structure: Each proposed harness is a dictionary on the filesystem: source, scores, trajectories, state updates. History does not go into the prompt — it all lands on disk.
- Explain the access method: The Proposer itself is a coding Agent; it uses grep and cat to read execution history on demand, fetching only the slice it needs, so nothing is stuffed wholesale into context.
- Explain the output shape: What it produces is a set of harness candidates on the Pareto frontier — under multiple objectives it keeps a family of solutions each strong in different ways, so you can pick by scenario.
- Admit the real bottleneck: What does not scale is the evaluation side: every harness revision needs a full trial run to score. Of the three context-optimization methods, Meta-Harness is the most general and the most computationally expensive.
- Explain the representation first: A workflow is represented as a directed graph: nodes are LLM call actions, edges are logical operations in code (conditional branches, loops, data passing). The design problem thereby becomes a tree-search problem.
- Explain the search loop: The initial workflow is the root; a soft mix of score and uniform exploration picks the node to expand, balancing exploitation and exploration; the LLM generates modified variants (add/delete/edit nodes and edges); execute and evaluate, and if there is improvement, add it back to the search tree.
- Answer the termination condition: Loop until the top-k average score stabilizes, or the compute budget is exhausted.
- Give the positioning: Contrast ADAS, which relies on a meta-agent self-refine to improvise freely; AFlow uses MCTS for systematic search, converges more stably, and also beats hand design and ADAS in experiments.
- Name the pipeline: Propose a research idea → write code → run experiments → analyze results → write the paper → peer review. All six steps are LLM-driven, running a complete research loop end to end.
- Explain the review stage: Review brings in LLM-as-judge for quality control; the papers it produces are formally complete.
- Give the reality check: Being able to write a paper falls far short of being able to do science. System tests found six recurring failure modes: default-value preference from training data, implementation drift under execution pressure, memory and context degradation, over-optimism, insufficient domain intelligence, and weak scientific taste.
- Deliver the judgment: These are structural bottlenecks. An expert-designed Harness can indeed coordinate most stages of a research loop, but the quality of judgment inside those stages is still far behind.
- Name the role system: Four roles collaborate: Challenger writes questions, Weak Solver and Strong Solver each try to solve them, Verifier / Judge arbitrates.
- Give the core criterion: The difficulty gap is the quality signal: keep only questions the strong solver can solve and the weak solver cannot.
- Explain why: Questions both can solve have no training value; questions neither can solve may themselves be bad questions. Questions that sit on the capability boundary have the most value for improving the model.
- Give the PM transfer: This idea of "using two capability bands to pinch out a difficulty belt" can be moved directly into evaluation-set construction and training-data tiering.
- Correct the object first: STOP does not directly improve the solution s; what it repeatedly improves is the "improver" I itself that produces better solutions. The seed improver takes three inputs — an initial solution, a utility function, and a black-box model — and returns an improved solution.
- Explain the key to recursion: The improver itself is also text (a prompt or a piece of code), so the same improvement logic can act on the improver: I_t = I_{t-1}(û, I_{t-1}; M), letting today's self upgrade yesterday's self.
- Give the experimental answer: It really can get better — but there is a threshold. Driven by GPT-4 it improves continuously, and even automatically discovered classic optimization strategies such as genetic algorithms, decomposition improvement, multi-armed Prompt Bandit, simulated annealing, and Beam Search; driven by GPT-3.5 and Mixtral it actually regresses.
- Give the conclusion: A recursive structure only supplies the possibility of improvement; convergence is not guaranteed. Weaker models lack programming intuition at the meta level and only amplify noise.
- Name the method: The first phase of Self-Harness is called Weakness Mining: cluster failure trajectories into verifier-grounded failure modes, rising from individual cases to patterns.
- Explain the record spec: Each failure record is a three-piece set: the terminal-verifier-level failure reason, the causal state of the relevant Agent behavior, and the abstract Agent mechanism the trajectory exposed. With those three, a failure becomes addressable.
- Explain the downstream use: The proposal stage prioritizes addressable, repeating error patterns — fix one place, repair a whole class, instead of treating symptoms.
- Give the PM landing point: How to build a failure-trajectory library and along which dimensions to cluster it is infrastructure a PM can push right now; the method can be copied as-is.
- Give the validation mechanism: Self-Harness phase three, Proposal Validation, validates candidate edits on held-in and held-out datasets and only accepts edits with no regression. Improvement is not allowed at the cost of existing capability.
- Explain the edit scope: The proposal itself is a bounded Harness edit. What the model receives is the editable surface, a summary of failure modes, records of passing behavior, and a history of already-tried edits — it is boxed in before it even acts.
- Give the experimental evidence: Experiments on Terminal-Bench-2 with MiniMax M2.5, Qwen3.5-35B-A3B, and GLM-5 showed Self-Harness learning model-specific harness instructions for each model.
- State the product implication: The same framework produces different optimization paths for different bases, which means harness improvement is context-sensitive. When you swap models you cannot copy the harness config as-is — you have to rerun a round of optimization.
- Give the direction first: The answer is in the last of the seven gates: humans move up the stack and stay in the loop. AI takes over the execution layer; human value moves up to setting goals, judging direction, and holding the line.
- Give concrete duties: Several things must be maintained by humans: evaluators and permission controls sit outside the improvement loop; the boundary of the editable surface is drawn by people; which problems are worth solving is defined by people.
- Give the evidence: Among the six failure modes of automated research, "weak scientific taste" and "insufficient domain intelligence" are exactly human strengths: judging whether a question is worth asking, and holding tacit knowledge that never makes it into documents.
- Close with a stance: Quote the line that ends the course: humans are an indispensable steering wheel in the system — never the bottleneck to be replaced. Oversight has to happen at the right time and the right level of abstraction.
- Explain the object first: DGM explicitly evolves an editable harness code repository; the Agent is allowed to modify its own harness code — more radical than AlphaEvolve editing someone else's program.
- Explain the loop: Start from a coding agent in the pool; pick a parent by performance probability; the parent agent inspects its own benchmark evaluation logs and proposes an improvement; mutate a new agent; after evaluation, only enter the pool if performance is high enough; loop until a stopping condition.
- Quote the numbers: Based on Claude 3.5 Sonnet, SWE-bench Verified went from 20% to 50%, Polyglot from 14.2% to 30.7%, with no human intervention throughout.
- Add the tool surface: The toolset is startlingly plain: bash plus an editor (view / create / edit). The power is in the loop design — you do not need fancy tools.
- Explain Promptbreeder: Uses a rich set of mutation operators to evolve task-specific prompts. The key innovation is meta-evolution: the mutation prompt itself is also improved through evolution — even the method of change is evolving.
- Explain GEPA: Combines reflection-based prompting with evolutionary search: the Agent first reflects on the shortcomings of the current prompt, then uses evolutionary operators to produce candidate improvements, and finally picks the best.
- Give the historical position: Both works are pioneers of prompt evolution and laid the foundation for later, larger-scale Harness evolution (AlphaEvolve, DGM). They proved that text can evolve; later work expanded the evolvable object to code and the entire harness.
- Answer whether they are worth it: Yes. Once you understand the kernel of meta-evolution, every new paper feels familiar.
- Explain the mechanism first: That is exactly SIA's approach: three roles enter the same optimization loop. A Meta-Agent proposes a new harness design, a Task-Specific Agent executes tasks under the new harness, and a Feedback-Agent decides from the results whether the next step updates the harness or the model weights.
- Give the evaluation: The direction is interesting, but the evidence is still tentative. Two open challenges are unsolved: training stability, and the Goodhart effect — optimizing a proxy metric until the true objective degrades.
- Explain the risk with an analogy: Rewriting the race-car engine while also rewriting the track. Both sides change at once, and when something goes wrong you cannot attribute it to either.
- Give the recommendation: In the near term it is more stable to run harness optimization and weight training separately; only talk about joint optimization after each single-sided loop has converged and is controllable.
- Explain the main loop: Maintain a pool of candidate programs; use a frozen LLM to generate code diffs that improve the programs; repeatedly evaluate subprograms and keep the best-performing ones. The model is never trained; all gains come from the search loop.
- Break down the prompt design: The evolution prompt is jointly composed of the parent program, evaluation results, instructions, and meta-information; EVOLVE-BLOCK markers explicitly circle the improvable region, constraining search to the designated range.
- Explain the meta-prompt: The instructions and context themselves also co-evolve; they are not fixed.
- Cite the ablation: The evolutionary process, the context prompt, the meta-prompt, whole-file evolution, and a stronger LLM — ablation showed each has an independent contribution. What is worth copying is exactly this practice of verifying every component's necessity.
- Explain the cost bulk: Search-style methods concentrate spend on evaluation: every round is LLM inference plus code execution plus a benchmark, and the more generations you run the more you burn. How to balance compute efficiency (how many evaluations per generation) against evolutionary gain (how much each generation improves) is still an open question even in the literature.
- Give a cheap-to-expensive ranking: ACE-style structured context maintenance is the lightest — it runs inside the normal task flow; MCE's two layers require an extra skill-evolution loop; Meta-Harness needs a full trial run to score every revision, the heaviest of the three computationally.
- Give the investment pacing: First ship ACE-style maintenance to stabilize long tasks, then build an evaluation set that can run automatically; only after evaluation is standing do you assess which tier of search method to adopt.
- Give the stop-loss line: A single evaluation takes hours, the metric is subjective, or the budget is limited — hit any of those three and stay at the lightweight tier. These are also the unfit scenarios for evolutionary search that the course lists explicitly.
- Take a position first: Yes, store them. Knowing what does not work is as important as knowing what does; a research Harness should make failed attempts and dead ends easy to save and retrieve.
- Explain why it is hard: Scientific literature is heavily biased toward success stories; LLMs may be poor at deciding when to abandon a hypothesis or honestly report a negative result. Automated research systems inherit that bias as-is.
- Explain how to store without steering off course: The use of negative results is pruning: label clearly what was tried, how it failed, and why, so when the Agent retrieves it it does not walk the same dead end again. Self-Harness feeding the proposer a "history of already-tried edits" is the same logic.
- Tie it back to a failure mode: Automated research's "over-optimism" problem (claiming a significant beat over the baseline when it is all noise) is exactly the symptom of a system that lacks the habit of honestly recording negative results.
- Give the classification framework first: The seven gates fall into four classes: evaluation-related, data and memory, safety and stability, and the human role. Report by class and you are less likely to miss one.
- Cover evaluation and memory: Weak and fuzzy evaluators (many goals have no fast, precise verifier, so the feedback signal is blurry); context and memory lifecycle (memory demand explodes with autonomy, and context engineering should become a core part of intelligence itself); negative results (failed attempts must be easy to save and retrieve).
- Cover the three safety gates: Diversity collapse (candidates crowd into minor variants and innovation stops), reward hacking (overfitting tests, gaming the judge model, exploiting benchmark loopholes), and long-term success (chasing test passes while ignoring maintainability, ownership boundaries, migration cost, and backward compatibility).
- Close on the human role: The seventh gate is the place of humans: provide oversight at the right time and the right level of abstraction. These seven are fundamental system-design challenges — do not treat them as ordinary engineering issues and just drop them into the sprint.
- The "use it now" layer: The three design patterns (automation loop, filesystem memory, sub-Agent parallelism) are already standard on Claude Code, Codex, and Cursor, covering 90% of the architectural decisions in the strongest Agent systems — just build to that.
- The "try next quarter" layer: ACE-style structured context maintenance. Generator, Reflector, and Curator are a clear engineering pipeline; the prerequisite is having an evaluation set first to verify convergence.
- The "adopt if conditions hold" layer: Search methods like AFlow and DGM require automated evaluation, quantifiable fitness, and sufficient compute. Coding tasks benefit first; DGM's SWE-bench numbers were produced under exactly those conditions.
- The "keep watching" layer: SIA joint optimization still has unsolved training stability, and Meta-Harness is the most computationally expensive; both are still in a tentative-evidence stage — following the papers is enough.
- Explain the pathology: Evolutionary algorithms and RL loops naturally tend to exploit known high-reward patterns. Short-term scores look great, and the problem is hidden.
- Explain the symptoms: Every candidate in the population collapses into a minor variant of the same solution; each new generation looks more like the last, and innovation stops. The course analogy is apt: if the whole class copies the top student's homework, scores look good, but no one will ever come up with a new solution again.
- Give the antidote: You need dedicated mechanisms to keep the solution space from collapsing: diversity rewards, archive preservation.
- Give a monitoring suggestion: Watching the score curve alone will not reveal collapse; you also have to measure how different the solutions inside the population are. Difference trending to zero is the alarm — it arrives far earlier than a score drop.
- Give the root cause first: This is "long-term success" among the seven gates: current optimization targets are too short-term. A coding Agent can finish the task in front of it, but is not clear enough on how to protect the long-term health of the repo.
- List what tests cannot catch: Standard sandbox RLVR training rarely captures maintainability, ownership boundaries, migration cost, or backward compatibility. Those are exactly the gates human review is holding.
- Give the risk picture: An Agent that only chases passing tests may bury time bombs in technical debt. The day they go off will not be written in any test report.
- Give a compromise: Review can change shape: light review for routine changes, focused review for architectural ones. Humans move up, watching ownership boundaries and long-term structure, and leave line-by-line checking to tools.
Why “Harness & Self-Improvement · 30 Tough Questions” depends on the operation
“Each with intent, framework, and bonus points: Harness essence / design patterns / context auto-evolution / reward hacking / RSI progress and risks” makes the structure concrete. The useful comparison is not which name sounds more advanced, but how the data is arranged and how far the most common operation has to travel.
Read a structure through access and change
“Each with intent, framework, and bonus points: Harness essence / design patterns / context auto-evolution / reward hacking / RSI progress and risks” exposes a trade-off that is easy to miss: reading by position, looking up by key, adding at either end, inserting in the middle, and traversing relationships do not favor the same organization. A structure that is fast for one operation is not automatically fast for all of them.
- Provide evidence: Successful products like Claude Code, Codex, and Cursor have proven that the Harness layer is as important as the raw model intelligence. A mediocre model with an…
- Explain the PM perspective: Swapping models is easy — Harness is the product's true moat. With the same model, the quality of the Harness design can produce user experience differe…
- Timeline commitment: Phase 1 is an engineering refactor — results visible within a week. Phase 2 requires building an evaluation set to verify convergence; report changes in long-t…
Count scale and update frequency together
Use “Each with intent, framework, and bonus points: Harness essence / design patterns / context auto-evolution / reward hacking / RSI progress and risks” as a boundary check. Write down the data size, the dominant operation, and the latency you can accept before deciding whether an AI-generated structure actually fits.
Take the example one step further
The lesson starts with “Provide evidence: Successful products like Claude Code, Codex, and Cursor have proven that the Harness layer is as important as the raw model intelligence. A mediocre model with an excellent Harness often outpe…” and then moves to “Explain the PM perspective: Swapping models is easy — Harness is the product's true moat. With the same model, the quality of the Harness design can produce user experience differences of several orders of magn…”. Reading those two pieces together makes the distinction clearer: which points are facts in the lesson, and which judgments depend on their conditions.
Carry the judgment into the next situation
When you meet a new data structure, do not begin by memorizing its definition. Write down the most frequent operation, estimate scale and update behavior, and check whether the structure satisfies all three conditions.
- “Harness & Self-Improvement · 30 Tough Questions”: Provide evidence: Successful products like Claude Code, Codex, and Cursor have proven that the Harness layer is as important as the raw model intelligence. A mediocre model with an excellent Harness often outpe…
- “Take it further”: Explain the PM perspective: Swapping models is easy — Harness is the product's true moat. With the same model, the quality of the Harness design can produce user experience differences of several orders of magn…
- “The closing point”: Give the PM judgment: First see which level the team is stuck at. Most teams are still between Level 1 and Level 2; every step up steeply raises the demands on the evaluation system
The final “The closing point” brings the discussion to “Give the PM judgment: First see which level the team is stuck at. Most teams are still between Level 1 and Level 2; every step up steeply raises the demands on the evaluation system”. The useful thing to carry forward is knowing which judgments must be revisited when input, scale, or risk changes.
I turned one judgment from this article into a small experiment I could run today. Knowing what to observe next is more useful than simply remembering the conclusion.
After reading this, I first looked for the conditions behind the idea instead of copying the method into a project. That order made the later trade-offs much clearer.
When this judgment reaches real work, which constraint should be added first? I am curious which step matters most between reading and the first practical attempt.
No discussion on this article yet.