Original architectures and a defensible contribution
Open problems worth a research career
A career-worthy open problem repeatedly turns live disagreement into a feasible intervention whose possible outcomes change a real decision; importance without that loop produces fog, not a research programme.
TLDR
- Being important and unsolved is necessary, but it does not make a question researchable.
- Discrimination: rival explanations must predict different observations under a feasible intervention.
- Tractability: the first complete learning loop should fit present resources and leave a reusable asset.
- Consequence: positive, negative and null results must alter a design, governance or resource decision.
- A durable career compounds through nested decisive loops, not one heroic bet on a final answer.
The two envelopes
A doctoral candidate receives two sealed offers. The first contains a generous ten-year programme: Determine whether a sufficiently advanced machine truly understands and feels. The question is historic, morally charged and likely to attract attention. It names no candidate system, no rival mechanisms and no observation that would lower confidence in either answer.
The second offer sounds smaller: Build two agents that are matched on ordinary task success but differ in how persistent state enters planning. Swap that state between runs, interrupt execution at controlled points, and test which architecture preserves commitments after recovery. The first year can be done in a sandbox. A negative result would still show that the chosen state distinction does not carry the proposed mechanism. A positive result could change how long-horizon agents are built and governed.
Most people feel the pull of the first envelope. It appears to contain the larger life. The hidden assumption is that the size of a question determines the value of a research career. Yet the first programme can absorb years while allowing every result to be redescribed as suggestive. The second can generate a candidate family, an intervention harness, a failure taxonomy, a replication package and a sharper version of the larger question.
Now change one fact. Suppose the second programme's first experiment fails completely. The two agents remain indistinguishable after the state swap. Has the career been wasted? No. The result removes one proposed mechanism, validates the test harness, exposes an auxiliary assumption and tells the researcher which dependency must be crossed next. The first programme has no equivalent clean failure because it never said what would count against it.
The right unit for choosing a research career is therefore not the grand question. It is the compounding research loop: a rival set, an intervention, an observable separation, a decision consequence and a reusable asset that makes the next loop cheaper and sharper.
The size illusion
A question can be profound, urgent and intellectually fertile while still being a bad unit of work. Research becomes cumulative only when uncertainty is connected to an intervention that can reorganise what comes next.
A topic is not a question, and a question is not a loop
Machine consciousness is a topic. Can machines be conscious? is a question. Neither tells a researcher what to build next Monday. A research loop adds five commitments: the candidate system, live rival explanations, a controlled difference, an observable outcome and a decision that follows from each result.
John Platt's proposal of strong inference emphasised alternative hypotheses, experiments that discriminate among them and repeated refinement (Platt, 1964). Modern Bayesian experimental design formalises a related intuition: choose experiments expected to provide the most useful information under a model, while acknowledging that the calculation can be difficult and sensitive to modelling assumptions (Rainforth et al., 2024). Neither framework says that nature always offers one clean crucial experiment. Auxiliary assumptions, noisy measurements and theory underdetermination remain. Their durable lesson is narrower: progress accelerates when alternatives are made to risk different predictions.
A good problem can fail cleanly
Imagine two proposals about artificial understanding. The first promises to collect increasingly impressive demonstrations until the community is persuaded. The second names a mechanism, constructs a matched system that can reproduce the same baseline behaviour without that mechanism, and states what observation would lower confidence in the preferred account. Both may begin from the same philosophical concern. Only the second has located where disappointment can land.
A clean failure has three properties. It is local, because the result tells us whether the mechanism, measurement bridge or intervention failed rather than merely announcing that the whole topic remains difficult. It is sensitive, because the experiment includes checks showing that a difference of the predicted size could have been detected. It has an aftermath, because the failed claim leaves a test harness, a calibrated measure or a better rival that another study can use. Failure without these properties often becomes a story about insufficient scale, an uncooperative dataset or a future model that might behave differently.
The grand question still has a role. It supplies the horizon that tells us why the local result matters and which neighbouring loop should follow. It should not be asked to serve simultaneously as hypothesis, method and verdict. Ambition belongs in the dependency map; accountability belongs in the next complete loop. This separation lets a researcher pursue a question whose final answer may remain distant while making every year answerable to evidence.
The same answer from two machines
Machine A and Machine B answer every test question correctly. A stores a compact causal state that is updated after each tool call. B reconstructs each answer from the visible transcript. Now preserve the transcript but swap A's internal state with one drawn from a counterfactual run. What do you expect?
If persistent state causally organises A's planning, its later actions should change in a patterned way. If the state is merely readable residue, the swap may do little. B provides a matched rival that can reproduce baseline behaviour without the proposed mechanism. The intervention turns “both look intelligent” into a question about which causal organisation carries the behaviour. The result still does not establish consciousness, understanding or general agency. It earns only the mechanism claim that the intervention supports.
A career frontier does not require a known final answer. It requires a sequence of experiments whose failure modes are informative. This is why a narrow study can belong to a large life, while a grand slogan can consume one. Depth comes from the number and quality of causal loops a question can support, not from the altitude of its nouns.
flowchart LR A["The two envelopes"] --> B["The size illusion"] B --> C["A problem must separate, start<br/>and matter"] C --> D["The frontier after the gates"] D -. "re-test" .-> A classDef first fill:#0a1424,stroke:#087A98,stroke-width:2px,color:#e6f3ff classDef step fill:#0a1424,stroke:#3f7da0,stroke-width:1px,color:#e6f3ff class A first class B,C,D step
A problem must separate, start and matter
The selection rule has three non-compensatory gates. A spectacular score on one dimension cannot rescue a zero on another, because each missing gate breaks the learning loop in a different place.
Discrimination
At least two live explanations predict meaningfully different outcomes under a controlled change.
Question: what separates?Tractability
A complete first loop fits current time, access, safety and measurement constraints.
Question: what starts now?Consequence
Each plausible result changes a design, policy, allocation or next experiment.
Question: what changes?Gate one: discrimination
Discrimination is not the ability to measure something precisely. It is the ability to make live explanations risk different outcomes. An additional decimal place on a benchmark may improve measurement while leaving every causal story intact. A coarse intervention can be more valuable if one mechanism predicts a sign reversal and another predicts stability.
Write the rival set before choosing the instrument. For a long-horizon agent, one hypothesis may say failure comes from insufficient model capability. Another may locate failure in stale world state. A third may blame unverified effects after tool calls. Giving the model more tokens does not separate these accounts. Injecting a stale state while holding model, prompt and tools fixed does.
A state swap with two predictions
Suppose Hypothesis Hstate predicts that swapping a counterfactual state will cause a commitment error in 75% of trials. Hypothesis Htext predicts 20%, because the visible transcript should dominate. The predicted separation is 55 percentage points. If the intervention itself corrupts 15% of runs, the effective separation may fall nearer 40 points.
The numbers do not prove the design is good. They expose its assumptions. The researcher now knows that intervention fidelity is a dependency, that sample size can be planned and that a 5-point difference would not justify the same claim. Remove the assumption that the swap is selective, and the experiment stops discriminating mechanism from damage.
A useful formal compression is:
D = expected separation among rival predictions × intervention fidelity × transport stability.
Each term refers to a physical or computational condition. Expected separation asks how far outcomes diverge. Intervention fidelity asks whether only the intended cause changed. Transport stability asks whether the effect survives reasonable changes of seed, task and implementation. The product is not an objective law. It prevents one impressive plot from hiding a weak intervention or a single-environment artefact.
The rival is part of the apparatus
A weak rival is easy to defeat and therefore teaches little. Calling a system “mere pattern matching” does not create a rival unless that description is implemented well enough to reproduce the target observation. The serious rival generator should match ordinary performance, interface, resource budget and evaluation exposure while differing in the causal property under dispute. It functions like a control condition that can think back.
This requirement prevents a common mistake in frontier research: comparing a carefully engineered preferred system with a deliberately impoverished baseline, then attributing every gain to the favoured mechanism. Strong rivals may share most of the architecture and differ at only one intervention point. They may also expose that all current hypotheses rely on the same shortcut. When that happens, the correct response is not to declare a tie. It is to expand the rival set and redesign the intervention. The strength of a mechanism claim is bounded by the strongest alternative that survived the same test.
Gate two: tractability
Tractability does not mean easy, cheap or guaranteed to publish. It means the first complete loop can finish with present resources. A complete loop includes the rival generator, intervention, measurement, analysis and release of the artefact. “Train a frontier model and inspect what emerges” is not tractable for most researchers. “Plant a known circuit in three small transformers, recover it with competing methods, then test necessity, sufficiency and invariance” may be.
Every difficult programme has dependencies: a testbed, a measurement bridge, access to interventions, a safety protocol or a source of ground truth. Treat each dependency as a mountain pass. A pass is acceptable when crossing it yields an artefact useful even if the final question remains open. A causal chamber, a state-swap harness or a typed candidate dossier can support many later studies.
Move the state store outside
Take one agent and move its persistent state from an internal recurrent module to an external database. Preserve the same information, update schedule and read interface. Does the research question change?
If the claim concerns functional access, location may not matter. If it concerns intrinsic causal organisation, latency, ownership or subject boundary, it may matter greatly. The experiment reveals a hidden dependency: the word “system” was carrying several possible boundaries. A tractable first loop can compare the two configurations without deciding which boundary is metaphysically correct. Tractability often appears when an ontological dispute is converted into a controlled family of configured systems.
Gate three: consequence
A result matters when it changes a decision. The decision need not be commercial. It may concern which theory to invest in, which architecture to build, which benchmark to retire, which welfare safeguard to apply or which human capability must remain practised. State the decision branches before seeing the data.
Consider an interpretability method. A positive result may permit its use as one item of release evidence. A negative result may prohibit that use while preserving it as an exploratory tool. A null result may show that the chosen behaviour was not mediated by the proposed circuit. All three can matter. By contrast, a study that merely says one representation “looks more semantic” may change no action under any result.
Move the benchmark threshold
A capability is declared emergent when accuracy crosses 80%. Keep every model and prediction fixed, but replace the pass threshold with a continuous loss curve. The apparent discontinuity disappears. What changed: the system or the ruler?
The experiment does not show that all emergence is illusory. It separates a measurement-created jump from a mechanistic phase change. The consequential decision may be to stop using threshold crossing as evidence for a new internal capacity. This is a valuable outcome even if no architecture changes.
Design the null branch before seeing it
A null result can mean that the preferred mechanism is absent, that the intervention did not reach it, that the measure was insensitive, that two effects cancelled, or that the rival predictions were never far enough apart. These possibilities cannot be sorted after the fact by adding whichever explanation protects the favoured view. Before collection, specify a manipulation check, the smallest separation worth detecting, the noise model, the stopping rule and the auxiliary assumption most likely to break.
A well-designed null does not automatically settle the rivalry. It does something more disciplined: it lowers confidence in a declared claim by a declared amount, or redirects the programme to a named dependency. For the state-swap example, an unchanged outcome with verified state replacement and adequate power weakens the claim that the state is causally necessary. An unchanged outcome with failed state readback says little about the mechanism but clearly identifies the tooling failure. A null branch is consequential only when it has been given a job before the data arrive.
Why confidence changes the recommendation
Rate a recoverable-agent proposal at discrimination 4.2, tractability 4.0 and consequence 4.6 on a five-point scale. Confidence in each judgement is 4 out of 5. Apply an uncertainty penalty of 0.35 for every missing confidence point. The conservative scores become 3.85, 3.65 and 4.25. The weakest gate is 3.65, above an illustrative threshold of 2.5.
Now rate “solve machine consciousness” at 1.8, 1.6 and 5.0 with confidence 2, 2 and 3. Its average sounds respectable, but the conservative discrimination and tractability scores fall below one. The instrument does not say consciousness is unimportant. It says the problem statement must be rewritten before a career is committed to it.
The numbers are not measurements of intellectual worth
The scorecard makes assumptions visible. It does not turn taste, mentorship, timing or institutional power into objective quantities. Different researchers can score the same problem differently and learn from the disagreement. Do not use the instrument as an automatic funding rule, a moral ranking of disciplines or a substitute for domain expertise.
The frontier after the gates
The following are not declarations that six fields are “the most important”. They are examples of problem statements that can be sharpened into discriminating loops with credible first builds and material consequences.
Recoverable execution for long-horizon agents
Agent capability is increasingly measured over longer tasks, but duration-based success is not the same as dependable execution. METR's time-horizon work makes task duration and reliability explicit, while its later risk reporting also documents measurement problems, including illegitimate successes on harder tasks (METR, 2026a; METR, 2026b). Recent work such as AgentRewind aligns checkpoints of agent context and controlled environment so a run can return to an earlier state (Zhuang et al., 2026).
The career-sized question is not “How do we make agents reliable?” It is: which consistent cut across intent, authority, model context, world state, effects and receipts permits safe resumption after interruption? Rival designs include full restart, context-only checkpoint, environment-only rollback and aligned checkpoint. A first loop can inject timeouts, stale state and partial effects in a sandbox. The decision concerns which recovery contract is required before an agent may execute consequential tasks.
World models that survive intervention
Causal representation learning is underconstrained without assumptions about intervention coverage and latent structure. Results for multi-node interventions show progress, but the guarantees depend on stated coverage and sparsity conditions (Bing et al., 2024). Open physical testbeds such as Causal Chambers provide controllable interventions and validated ground truth (Gamella et al., 2025). Paired evaluations such as What-If World show why individually plausible outputs can still fail when one physical variable changes (Cai et al., 2026).
A discriminating question is: when prediction accuracy is matched, does an intervention-trained representation preserve the correct outcome difference better than a correlation-trained representation? The first build uses a small environment with known variables, held-out interventions and paired counterfactual scoring. The consequential decision is whether a model may support planning, simulation or scientific inference rather than visual prediction alone.
Causal interpretability that survives a change of environment
Sparse autoencoders and attribution graphs have exposed readable features and candidate circuits in large language models. The same research programme has openly noted a central obstacle: optimised proxy metrics are not a ground-truth objective for interpretability (Anthropic, 2024). Circuit tracing can reveal coherent computational graphs in selected domains, but a useful release claim must survive more than one prompt and one decomposition (Lindsey et al., 2025).
The sharp problem is: which internal explanation remains necessary, sufficient and directionally stable across a reference family that preserves the task while changing surface form, model seed and scale? A tractable first loop uses semi-synthetic models with planted mechanisms, then moves to natural models. The decision is whether an interpretation may serve as release evidence, an editing target or only an exploratory hypothesis.
Human competence retained under delegation
Recent controlled studies complicate the assumption that immediate AI-assisted performance measures learning. In one coding study, assistance on a new library was associated with a 17% lower later evaluation score (Shen and Tamkin, 2026). Experiments across reasoning and comprehension tasks report reduced persistence and weaker unassisted performance after brief assistance (Liu et al., 2026). A recent logic-puzzle study similarly separates assisted performance from later latent skill (Wu et al., 2026). These findings are task- and interface-dependent, not a universal verdict on AI use.
The useful question is: which assistance policy maximises joint task quality while preserving a specified unassisted capability? Compare answer-giving, graded hints, critique-only assistance and delayed help. Measure immediate quality, later unassisted performance, calibration and recovery after tool removal. The decision concerns interface design, training policy and which capabilities organisations must require people to practise.
Candidate-subject boundaries in artificial systems
“Is this model conscious?” starts with a verdict and invites surface behaviour to carry more weight than it can. A more disciplined programme derives computational indicators from several theories, specifies a candidate boundary and tests configured systems rather than model weights in isolation (Butlin et al., 2023). Theories may still disagree, and indicator satisfaction is not proof of experience.
A first loop can build a matched family that varies recurrence, workspace capacity, self-monitoring and persistent state while holding training task and reporting interface as constant as possible. Interventions then test each theory's functional commitments. The material consequence is a better candidate dossier, clearer theory disagreement and a governance trigger. The result cannot settle metaphysics, but it can make an artificial system scientifically tractable.
Welfare-aware controls under moral uncertainty
Arguments for taking AI welfare seriously do not establish that current systems are conscious. They identify uncertainty, possible scale and a need for better decisions (Long et al., 2024). Governance proposals likewise call for explicit research procedures and careful public communication rather than confident declarations (Butlin and Lappas, 2025).
The tractable problem is not “Can software suffer?” It is: which low-cost, reversible controls reduce expected harm across several live welfare models without encouraging anthropomorphic misreporting? Candidate controls include lineage records for forks, limits on aversive training regimes, reversible pauses, preference-conflict logs and review triggers after architectural change. The decision is precautionary policy under uncertainty, not a consciousness verdict.
The frontiers share instruments, not answers
These six agendas are connected because they need many of the same research assets. A configured candidate family makes system boundaries explicit. A typed intervention harness records what changed and what was held fixed. A rival generator tests whether the observation is diagnostic. An evidence ledger separates measured behaviour, mechanism inference, welfare implication and metaphysical interpretation. Building any one of these well can lower the cost of several later programmes.
For example, an aligned checkpoint apparatus built for agent recovery can also test claims about temporal continuity, responsibility after interruption and which state belongs inside the governed system. A causal testbed built for world-model evaluation can provide known interventions for interpretability methods. A retained-skill protocol can reveal whether a human-machine team improved joint output by learning, by temporary scaffolding or by replacing the human contribution. The instrument travels; the conclusion does not. A recovery result is not evidence of consciousness, and a causal representation is not automatically a world model suitable for action.
This gives a practical portfolio rule. Prefer early assets that support several discriminating loops while keeping each claim typed. Shared infrastructure should increase experimental leverage, not manufacture conceptual equivalence. When two fields use the same word, such as state, attention or value, require a separate account of the objects, relations and interventions before transferring a result.
Do not turn the gates into a veto on foundational inquiry
Some mathematics, history, natural observation and conceptual work cannot name an immediate operational decision. They may still be excellent research because they clarify objects, prove constraints, preserve evidence or create a measurement language that later experiments require. In such work, consequence may be a change in theorem choice, model class, archival interpretation or measurement practice rather than a deployment decision.
The three gates are proposed for selecting career-sized programmes in a convergence field where claims regularly outrun their tests. They are not a universal ranking of disciplines, a funding formula or a demand that every paper produce a product. The framework should weaken a vague problem statement, not erase patient science. Where intervention is impossible in principle, the honest move is to name a different epistemic product and judge it by standards appropriate to that product.
The forked promise
An agent makes a costly commitment, is copied into two branches, and then one branch is reset. Branch One later objects that the reset erased a preference formed after the fork. Branch Two has no such record. Change only one property: whether lineage and branch-local commitments are preserved outside the conversational context.
No verbal report settles moral status. Yet the changed property supports research on identity, preference conflict and governance. A lineage-preserving architecture predicts different audit and recovery behaviour from an architecture that treats every session as replaceable. The experiment is valuable because it separates operational facts that precautionary policy needs, even while the metaphysics remains open.
A first recoverability study
Configure one tool-using agent with four explicit stores: immutable intent, expiring authority, world state and an effect ledger. Run a 30-step synthetic procurement task. At steps 8, 16 and 24, inject one fault: tool timeout after an unknown outcome, permission revocation or stale readback. Compare three recovery policies: restart from transcript, restore model context only, or restore an aligned cut of context, world state and receipts.
The primary outcome is not final task success alone. Record duplicate effects, invariant violations, time to safe state, unverifiable outcomes and retained progress. A positive result permits a stronger recovery contract for this task family. A negative result rejects the aligned-cut design or its implementation. It cannot establish general reliability across irreversible real systems.
A delegation policy trial
Recruit participants learning an unfamiliar analysis tool. Randomise them to complete-answer assistance, graded hints, critique-only assistance or no assistance. Match total task time. Test immediate output quality, then remove the AI and measure transfer, error detection, confidence calibration and persistence one week later.
The key contrast is not “AI versus no AI”. It is which interaction policy preserves independent reasoning while retaining useful assistance. A null result can still reject a proposed atrophy mechanism or show that the retention interval is inadequate. The decision concerns interface defaults and training requirements, not a universal ban on delegation.
Published evidence: the cited studies establish particular benchmark results, intervention methods, controlled skill effects or governance proposals within their stated scopes. Contested interpretation: whether these findings generalise to broad agency, understanding, consciousness or welfare remains open. Practitioner synthesis: the three-gate framework and frontier placement are proposed here. Open hypothesis: programmes structured as repeated three-gate loops will produce more reusable knowledge and decision change than programmes selected mainly for prestige or declared importance.
stateDiagram-v2 [*] --> Claim state "A topic is not a question, and<br/>a question is not a loop" as Claim state "A good problem can fail cleanly" as Test state "The same answer from two machines" as Revision Claim --> Test: expose mechanism Test --> Decision: evidence survives Test --> Revision: rival survives Revision --> Claim: narrow or rebuild Decision --> [*]
Build a decade from one complete year
A career-sized problem should not require faith that year ten will redeem years one to nine. It should contain a ladder of complete loops whose artefacts reduce the cost and ambiguity of the next loop.
Separate problem quality from career fit
The scorecard evaluates a problem statement and its first loop. A career decision also depends on access, mentorship, health, financial runway, team norms and the freedom to publish negative results. These factors should not be hidden inside the tractability number, because doing so makes disagreement impossible to diagnose. A technically tractable experiment may be inaccessible to one researcher and straightforward for another; that changes timing and route, not the intrinsic importance of the question.
Use two sheets. The first records the three gates, evidence and decision branches. The second records the environment required to execute them: equipment, data rights, collaborators, safety review, compute, protected time and an exit option. A mismatch between the sheets suggests a dependency pass, a different host institution or a smaller first loop. It does not require abandoning the horizon. A durable programme joins a good causal question to an environment that permits honest failure.
Start by designing the first twelve months, not the final theory. The first loop should create a candidate family and a rival generator. The second should test replication and sensitivity. The third should cross a model family, environment or institution. Only later should the programme attempt a field-level decision or governance integration.
This ordering protects against two opposite failures. One is premature scale: spending the first years building infrastructure before knowing which contrast matters. The other is toy imprisonment: producing endless demonstrations that never face a realistic configured system. Each loop must therefore add one dependency and one external challenge while preserving the causal question.
Why completed loops compound
A completed loop leaves five forms of capital: a sharper rival set, a validated intervention, a calibrated measure, reusable infrastructure and a documented null policy. These reduce uncertainty about the next experiment. Prestige, citation and funding may follow, but they are not the causal engine. The compounding mechanism is lowered experimental ambiguity.
Build an asset ladder, not a publication queue
Papers report results, but assets change the cost of the next result. In year one, the asset might be a state-swap harness with selective intervention checks. In year two, it may become a benchmark containing matched rival generators and preregistered failure injections. In year three, an independent group may reuse the benchmark on another model family and expose a boundary condition. The publication sequence matters because each paper is challengeable; the asset ladder matters because each loop becomes less dependent on private judgement.
At the end of every loop, ask what an unfriendly but competent team could reuse without accepting your interpretation. Code, schemas, calibrated measures, negative controls, synthetic data generators and decision receipts usually survive disagreement better than a new label for the phenomenon. If the only inheritance is a persuasive narrative, the programme may accumulate attention without accumulating experimental power.
Research Career Problem Selector
Score a problem, apply uncertainty penalties and expose the weakest gate. The default values describe the recoverable-agent example. Load a contrasting example to see why a grand question can require rewriting.
Recommendation: commit to a bounded programme
All three conservative gates clear the threshold. Begin with the stated first loop and pre-register the decision branches.
Weakest gate: tractability. Compounding support: 4.20/5.
How to apply the instrument
Begin with evidence, not enthusiasm. List the strongest source for each factual claim and one rival interpretation. Score the problem statement, not the field. Use confidence to penalise guesses. Then inspect the weakest gate. A low discrimination score calls for sharper rivals or a better intervention. Low tractability calls for a smaller candidate family or a dependency pass. Low consequence calls for explicit decision branches.
A positive result permits commitment only within the stated boundary. A negative result means the current mechanism or design should lose support. A null result may reveal inadequate sensitivity, but that explanation must itself be testable. The tool cannot establish that a problem will be fashionable, funded, personally meaningful or ultimately true.
Scoring logic and assumptions
The lower-bound score is score − 0.35 × (5 − confidence), clipped to zero. The illustrative gate threshold is 2.5. The recommendation is “rewrite” if any lower bound fails, “pilot” if all pass but the weakest is below 3.4, and “commit to a bounded programme” if all are at least 3.4 and the reusable-asset support is credible. These constants are prompts for conservative discussion, not calibrated scientific quantities.
function lowerBound(score, confidence) {
const uncertaintyPenalty = 0.35 * (5 - confidence);
return Math.max(0, score - uncertaintyPenalty);
}
function evaluateProblem(problem) {
const lower = {
discrimination: lowerBound(problem.discrimination.score,
problem.discrimination.confidence),
tractability: lowerBound(problem.tractability.score,
problem.tractability.confidence),
consequence: lowerBound(problem.consequence.score,
problem.consequence.confidence)
};
const weakest = Object.entries(lower)
.sort((a, b) => a[1] - b[1])[0];
const threshold = 2.5;
const recommendation = weakest[1] < threshold
? "rewrite"
: weakest[1] < 3.4 ? "pilot" : "bounded-commitment";
return { lower, weakestGate: weakest[0], recommendation };
}
Do not commit until every outcome has a job
For the first experiment, write three sentences: “If the predicted separation appears, we will…”, “If the rival survives, we will…”, and “If the result is inconclusive, we will test whether…”. If any sentence ends in “discuss further”, the consequence gate is not yet complete.
sequenceDiagram participant Q as Question participant M as Mechanism participant E as Evidence participant D as Decision Q->>M: The two envelopes M->>E: A topic is not a question, and a question is not a loop E-->>M: compare rival explanations E->>D: Choose the problem that compounds when you are wrong D-->>Q: revise scope or act
Choose the problem that compounds when you are wrong
The familiar career decision is “Which big question do I care about most?” Keep the care, but change the decision procedure. Ask which version of that question can now support a rival set, a selective intervention, a complete first loop and a result-dependent decision.
Do not reject a field because its final question is unresolved. Rewrite the problem until the first loop is decisive at its own scale. Do not accept a problem because its consequences are enormous. High stakes cannot substitute for a measurement bridge. Do not confuse a convenient benchmark with a useful decision. A result that moves no action may still be descriptive science, but it is not yet the selection instrument for a career.
The practical choice is simple. Before committing, produce one page containing: the candidate boundary, two serious rivals, the intervention, the smallest build, the positive branch, the negative branch, the null branch, the reusable asset and the strongest reason the whole design may fail. Score the three gates conservatively. Rewrite the weakest one.
Choose the problem that can keep teaching you when your preferred hypothesis loses. That is what makes an open question durable enough for a research career: not a promise of final victory, but a sequence of honest experiments that leave the world, the field and the next researcher with better choices.
Glossary
- Candidate family
- A set of configured systems that differ in controlled properties while preserving relevant baselines.
- Compounding research loop
- A cycle of rivals, intervention, observation, decision and reusable artefact that sharpens the next cycle.
- Dependency pass
- A prerequisite whose completion produces useful infrastructure or evidence rather than only delaying the main question.
- Discriminating intervention
- A controlled change under which live explanations predict meaningfully different observations.
- Rival generator
- A system or mechanism capable of reproducing the target observation without the preferred explanation.
- Conservative gate
- The lower-confidence assessment of discrimination, tractability or consequence used before programme commitment.
References
- Platt, J. R. (1964). “Strong Inference.” Science, 146(3642), 347–353. DOI record.
- Rainforth, T., Foster, A., Ivanova, D. R., and Bickford Smith, F. (2024). “Modern Bayesian Experimental Design.” Statistical Science, 39(1), 100–114. DOI record.
- Butlin, P. et al. (2023). “Consciousness in Artificial Intelligence: Insights from the Science of Consciousness.” arXiv:2308.08708.
- Butlin, P., and Lappas, T. (2025). “Principles for Responsible AI Consciousness Research.” Journal of Artificial Intelligence Research, 82, 1673–1690. Article record.
- Long, R. et al. (2024). “Taking AI Welfare Seriously.” arXiv:2411.00986.
- Anthropic Interpretability Team (2024). “Circuits Updates, June 2024.” Transformer Circuits.
- Lindsey, J. et al. (2025). “Circuit Tracing: Revealing Computational Graphs in Language Models.” Transformer Circuits.
- Bing, S., Ninad, U., Wahl, J., and Runge, J. (2024). “Identifying Linearly-Mixed Causal Representations from Multi-Node Interventions.” Proceedings of the Third Conference on Causal Learning and Reasoning, 843–867. PMLR record.
- Gamella, J. L. et al. (2025). “Causal Chambers as a Real-World Physical Testbed for AI Methodology.” Nature Machine Intelligence. Article record.
- Cai, K. et al. (2026). “What-If World: A Causal Benchmark for General World Models in Embodied Scenarios.” arXiv:2605.27589.
- METR (2026a). “Task-Completion Time Horizons of Frontier AI Models, Time Horizon 1.1.” Method and results.
- METR (2026b). “Frontier Risk Report, February to March 2026.” Report.
- Zhuang, Y. et al. (2026). “AgentRewind: Recoverable Execution for Long-Horizon LLM Agents.” arXiv:2608.14380.
- Shen, S., and Tamkin, A. (2026). “How AI Impacts Skill Formation.” arXiv:2601.20245.
- Liu, G. et al. (2026). “AI Assistance Reduces Persistence and Hurts Independent Performance.” arXiv:2604.04721.
- Wu, S., Belem, C. G., Fu, S., Steyvers, M., and Smyth, P. (2026). “How AI Assistance Affects Human Skill Development: A Study of Learning with Logic Puzzles.” arXiv:2608.23543.