THE DISCOVERY ENGINE← back
scroll
Discovery engine · 01

It builds a world model.
Then it doubts it.

Not a forecaster. It learns a distribution over every history that could connect an initial state to a terminal constraint. The science is in the geometry of that distribution — not in any single path.

ℙθ( τ | s0 , 𝒞T )  endpoint-conditioned path measure
Two rings · 02

An inner ring discovers.
An outer ring certifies.

Generate samples the path measure — from one state, the space of possible histories erupts at once, and the streams that converge are mechanism families.

ExploreGenerateAssimilateRepresentQuantifyRefine
Validation & certification · 03

Samples are
not claims.

A path that breaks a conservation law is rejected. A goal with no sampled path is not impossible — only when competence, coverage, and an independent invariant or numerical oracle all agree.

Z0 ∧ K ∧ G ∧ ( I ∨ O )  certification condition
reachablerare → keep searchinginvariant-violating → impossibleout of competence → abstain
The claim ledger · 04

What survives
is certified.

Each survivor becomes a typed, scoped, falsifiable claim in an append-only, auditable ledger — with evidence, competence, and coverage attached. Belief is updated by rules, never by a learned policy.

✓ certified · logged
The architecture · the nodes

Every node, end to end

Discovery nodes (blue) feed the green claim-certification path — the Claim Compiler types samples, the Competence/Coverage model scores them, and nothing reaches the central Claim Ledger until the Certification Gate admits it. The skepticism engine (teal) attaches calibrated belief; the write-up stage (violet) renders only what the ledger supports. Amber dashed = the planner's next experiment fed back to discovery. Click any node.

Discovery / execution Skepticism / UQ Certification path Write-up Claim ledger (hub)
SELECT A NODE

Explore the architecture

Click any node above for its agents, its role, and how it learns. Start with the amber hub — the Claim Ledger — which everything reads from and writes to.

State · what the engine models

Three world models

It needs three coupled models, not one monolith. Two are learned by gradient descent; the third — belief — is updated only by auditable rules. That is why it is easy to miscount as two.

Physical
A generative model over trajectories — what histories are dynamically plausible.
W_phys = ℙθ · learned
Epistemic
A graph of claims and calibrated opinions — what we believe and why.
W_epi = ledger · rule-updated
Action–outcome
A predictor of what an experiment would reveal — used to plan by expected information gain.
W_act = q_ψ · learned
What learns · and what must not

Trainable modules M1–M12

Each module mapped to the inner-ring process it serves and the world model it belongs to. M1 is the physical world model; M3 realizes the action–outcome model; the ledger (W_epi) is not a trained module — it is the object these write into.

ModuleSymbolProcess / roleWorld model
M1 Path generatorℙθGenerateW_phys
M2 Forward modelf_φAssimilate / Generate criticfeeds W_phys
M3 Latent forward modelh_ψExplore (EIG rollouts)W_act
M4 Assimilation modelp_ηAssimilate—
M5 Mechanism encoder (LCS)e_ξRepresent—
M6 Claim compilerc_χRepresent → ledgerouter ring
M7 Competence modelκ_αQuantify / certifyself-knowledge of W_phys
M8 Coverage modelγ_βAssimilate / Quantify—
M9 Literature retriever + NLIr_ζreview (outer)outer ring
M10 Context policyπ_ctxall agents (read)outer ring
M11 Planner policyπ_νExploreuses W_act
M12 Refiner policyπ_editRefineedits W_phys
The agents · review as evidence

A committee, not a judge

Review is a dynamic panel whose domains change with each claim — grounded in its own retrieved evidence, not personas over one context. A mandatory falsifier tries to break it; a judge adjudicates against the ledger and log, weighting reviewers by their calibration track record. Disagreement is an output, not a forced verdict.

casting agent→ r1 · domainr2 · methodsr3 · intersectionfalsifier →judge — weights by Brier→verdict or high-u → discriminating test

Each agent is stateless except through four shared memory layers — so an agent's design is its read/write contract. Any agent may read any layer; writes are restricted so no learned policy can author belief or rewrite history.

AgentReadsWrites (how)
Plannerledger, episodic, logpre-registration → log
Generatorprobe, W_physensembles → log
Assimilatorensembles, observationsweights / CRPS → log
RepresentationensemblesLCS fields → log
Claim compilerensembles, LCS, κ, γcandidate claims (gated)
Falsifierledger, logcounterexample probes
Retrieverledger, literature graphevidence packets (not the log)
Reviewer / Judgeledger, log, packetsopinion update (rule)
Refinerlog, episodic, metricsmodel edit (gated by V)
N3.5 · N5.5 · N6.5

The claim-certification path

The leap from generator output to belief is where the make-or-break failure lives. Three nodes turn it into a gated pipeline; no claim is admitted without a typed object, scope, falsifier, log reference, and competence/coverage annotation.

N3.5 Claim Compiler
Samples → typed claims from a closed set, each with scope, evidence counts, listed alternatives, and a falsifier.
invariant · threshold · regime · mechanism · failure
N5.5 Competence / Coverage
The two uncertainties the generator can't self-report: is the twin reliable here, and did sampling cover the family? Belief is discounted by both.
κ (out-of-family) · γ (ESS + diversity)
N6.5 Certification Gate
"Impossible" requires ≥2 independent certifiers — including a numerical oracle that breaks the generator-judging-itself circularity.
Z₀ ∧ K ∧ G ∧ (I ∨ O)
not found→within competence→after high-coverage search→inconsistent with invariant→certified impossible under A
Memory · what is records vs. policy

Four memory layers

Memory is evidence; context is policy. A learned agent decides what to retrieve into context — never what the log says or whether evidence existed.

Experiment log append-only
Every probe, the pre-registered prediction, model version, seeds, raw outputs, metrics, timestamp, provenance. Never overwritten.
Claim ledger mutable, gated
The belief graph — opinions, dependencies, contradictions, competence, coverage, calibration. Every update references the log.
Episodic memory append-mostly
Which probes, retrievals, and edits helped, with calibration outcomes — read to warm-start the planner, casting, and refiner.
Working context budgeted
A per-step packet assembled for one agent and task, chosen to maximize relevance under a token budget (submodular greedy).
Write-up · downstream of the ledger

Writing the paper

Writing is not a free-standing rhetorical stage — it is a derived view bound to the ledger, so the output can never exceed the evidence. The three artifacts are kept strictly separate.

Ledger
Current belief — mutable, (b,d,u) per claim, gated by admission.
Experiment log
Append-only history — the single source of numeric truth, with the pre-registered prediction timestamped before execution (the HARKing guard).
Manuscript
A derived view of a ledger subgraph + supporting log slice — numbers locked to the log, hedging driven by (b,d,u).

Manuscript synthesis (N8) is five components, each bound to the ledger:

ComponentJob
Pre-registration / outline agentwrites the prediction & falsification criterion to the log before the experiment
Section synthesizerrenders a ledger subgraph; numbers locked to log entries; hedged vs. assertive language from (b,d,u); explicit "what is unknown"
Figure serviceplots real ledger/log data with a verification loop checking each figure against its log entry
Citation binderverifies a source supports (or contradicts) the claim — warrant, not mere existence
Refinement controller (N9)accepts an edit only if it improves calibrated fit against the log; reverts otherwise
Validation · build order & ladder

A ladder, not a leaderboard

The curriculum runs from physical competence to epistemic action — forward & bridge models, representation, competence/coverage, claim compiler, literature + committee, then planner/memory/refiner policies, and only last the closed loop. Evaluation is a graded ladder.

L0Noiseless trajectoriesrediscover obvious invariants
L1Noisy partial observationsrobustness & assimilation calibration
L2Missing variablesmissing-modality reasoning & abstention
L3Out-of-distribution goalscompetence — refusal to overclaim
L4Impossible goalsfalse-impossibility control
L5Architecture comparisonsinductive-bias discovery
L6Literature-enabled modedoes text help — or contaminate?

Headline metric: the certified-impossible false-positive rate. The decisive first experiment is whether the system can separate reachable · rare · impossible · out-of-competence.

The thesis
Discovery is not a sampled trajectory, and not a polished paragraph. It is a certified ledger entry — support, scope, uncertainty, and a falsifier, all explicit.
← back