103The combination
Verifiable Space: Where the Answer Can Be Checked
Verifiable space is work where a valid check can evaluate a proposed answer within the available budget and time.
Checkable ground
Name the claim before choosing the check
A verifier may establish correctness under formal rules, return a score, or measure a property. Its result supports only the claim it tests. For repeated automated sifting, the check must also be affordable and finish in time. The generation–verification gap asks a separate question: can the system select the good candidate it was capable of generating?
The evaluator in the loop
AlphaEvolve runs programs against task-specific criteria
- Generate a candidate program
- Execute the evaluator and record its results
- Use stored programs and feedback in later generations
The AlphaEvolve white paper describes correctness checks, quantitative metrics and optional model-generated feedback. Those signals have different evidential roles. Evaluation may take seconds or substantial computation.
What the calculation establishes
GNoME screens structures, then calculations test stability predictions
In Merchant et al., Nature (2023), graph networks filter candidates before density functional theory calculations evaluate selected structures. The result concerns predicted thermodynamic stability under the computational method. Synthesis and usefulness require further evidence. Error rates also matter when the desired target is rare: see the base-rate trap.
Find versus check
A proposed solution can make the checking task smaller
Given a proposed route through a graph, check that every step uses an edge and every vertex appears once. Finding such a route is a different task. Cook's formal account defines efficient verification using certificates; P versus NP remains open. A small example does not prove a universal search-time gap.
What the bench decides
AlphaProteo's binding claims meet the laboratory
The 2024 AlphaProteo report combines computational design with experimental binding and affinity assays. Groups at the Francis Crick Institute further validated selected binders. The announcement also reports failure on TNFα. An external measurement is not automatically a cheap, autonomous check.
The evaluator gives search a direction
A valid, affordable evaluator lets a system compare candidates on a stated criterion. Without that check, the proposals can still inform a person or a slower experiment. They remain unresolved on that criterion; missing cheap verification does not settle out-of-distribution judgment.
The edge of the map
Unscored, failed and falsely flagged are different states
A candidate without an applicable check remains unscored. A candidate that fails a valid check has evidence against that claim. A false alarm passes a screening threshold but proves to be a non-target on follow-up. Rarity can make false alarms dominate. Out-of-distribution cases and Knightian uncertainty require their own judgments.
Carry the verifier
A result travels with the check that supports it
Record the claim, evaluator, cost and conditions that would require another check. An opportunity may have a deadline; a formal proof does not expire simply with time. Carry that evidence into sizing a bet, deciding when to abstain, and paying for verification. If the record is incomplete, keep the candidate unresolved.