DANIEL KLIEWERThe book

Pass 4: The Scientific State Compiler — A Versioned Model of What We Understand

By
4 min read

Yesterday we built Pass 2, the Scientific Question Compiler, which turns a corpus into a map of what humanity does not yet know — the ranked open questions, the contested claims, and the silence where the literature simply does not speak.

Today we ran Pass 4: the Scientific State Compiler. It takes that uncertainty map and promotes it into something stronger — a versioned state of a field: a structured model of what is understood, separating what is accepted from what is uncertain from what is genuinely contested, and preserving the disagreement rather than flattening it into a false consensus.

A summary tells you what the paper said. A state tells you what the field believes, and how sure it is. That distinction is the whole point.

What "state" means here

The roadmap calls Pass 4 the unifying layer: Knowledge + Evidence + Mechanisms + Questions + Uncertainty = Scientific State. The output is a single artifact, scientific-state.json, with five components:

  • Accepted models — claims with broad support, each carrying a confidence score and the basis for it.
  • Uncertain models — plausible but incomplete; the open issue is named.
  • Contested models — genuine disagreement, recorded as position A vs position B, never collapsed into one.
  • Conflict ledger — the specific unresolved disputes, with a resolution status (usually none).
  • Open questions + silence summary + major changes — the residual unknowns and the directional shift in the field.

The model itself (a 35B parameter model, running on hardware we own) described the single most important structural fact about the field:

The field has shifted from a strictly amyloid-centric paradigm to an integrated model incorporating metabolic and vascular dysfunction as early contributors, though the temporal hierarchy and causal primacy between these pathways remain actively contested.

That is the kind of sentence a synthesis should produce and a retrieval search can't. It is the state.

The versioned payoff

The state is committed to a local-first versioning layer (Scientific Git-lite, reused from the Discovery Compiler). Each compile snapshots the artifact with a content hash and a real diff against the previous version. Re-running with new sources — a fresh batch of papers, a new clinical trial — produces a new commit and a diff showing what changed in the field's understanding. Nothing leaves the machine unless you push it.

This is "observability becomes the OS" made concrete: the artifact is not a frozen file but a versioned research substrate. The loop compiles understanding, and the version history is the record of that compilation.

What it took (and what broke)

Same local-first constraint as Pass 2: a reasoning model emits a long chain-of-thought before its answer, so if you cap max_tokens too low the JSON answer gets truncated and the parser finds nothing. The fix is per-pass token budgets that leave the CoT room to breathe. The state pass runs at 9000 tokens and produces clean, parseable output. One call, ~12 minutes, on a 35B model — slow, but sovereign.

What you can look at

The explorer now has a State view alongside the Uncertainty Map and the ranked Questions:

It renders the accepted / uncertain / contested split, the conflict ledger, and the open questions — all generated by the model from a three-document corpus on Alzheimer's & metabolic dysfunction.

Where the program stands

Five compiler directions — Mechanistic Reasoning, Scientific Question, Scientific State, Discovery, and the Unknown Detector — are not competing projects. They are passes in one architecture that compiles the scientific corpus into an executable model of human understanding. We have now shipped:

  • Pass 2 — the map of what we do not know.
  • Pass 4 — the versioned state of what we do.

The next move is to make the loop turn on itself: feed the open questions back as research queries, re-compile, and watch the state versions advance. That is when the compiler stops being a tool and becomes infrastructure.

You are looking at Pass 4 of the Scientific State Compiler, running on hardware we own.

What this makes possible next

With Question (Pass 2) and State (Pass 4) both producing real, versioned artifacts, the feedback loop closes: the open questions in State become the next corpus's research targets. The compiler begins to direct its own next compile. That is the moment the loop — not the model — becomes the product.

Related research

Jul 26, 2026

Does the Compiler Know When It's Wrong? Semantic Rediscovery and the Limits of Falsification-Awareness

Popper-ORKG ended with two honest failures: temporal rediscovery was near-zero, and the compiler confidently rebuilt Lamarckian inheritance. v4 exists to ask whether those are fixable weaknesses or fundamental limits — by adding measurement, not by tuning the scorer. The answer turned out to be one of each. Mechanism-level semantic matching shows rediscovery was a measurement artifact all along (0.63 vs 0.005 exact-match, flat across temporal gaps). But a falsification-awareness consensus check could not downgrade Lamarckism or caloric: the ORKG index contains no detectable refutation edges, so the near-miss is a genuine limit of the knowledge substrate. Everything in popper/ and orkg/ stayed byte-for-byte frozen, md5-verified. Run locally on a 35B model.

Jul 25, 2026

Does the Hypothesis Compiler Generalize? Running Popper on a Corpus I Did Not Build

Popper beat its controls on five hand-curated benchmark literatures — but I built those corpora, so the result could be an artifact of clean data. This experiment removes that objection: the identical pipeline, byte-for-byte, run on a corpus I did not build — the Open Research Knowledge Graph, 6.3 million triples across 65,689 papers and seven scientific disciplines. Same schema, same rubric, same four-way controls; the only independent variable is the corpus. The compiler still wins (0.85 composite vs 0.56 keyword vs 0.00 ungrounded), an ablation proves the architecture is load-bearing (remove graph reasoning and it collapses to zero), and the grounding audit finds zero hallucinated citations across 265 evidence items. It also fails honestly: exact temporal rediscovery is near-zero, and it confidently rebuilds Lamarckian inheritance. Run locally on a 35B model.

Jul 24, 2026

Popper: Making the Hypothesis Compiler Falsifiable — Rediscovery Benchmarks, Negative Controls, and the Move From Plausible to Provable

The last experiment proved a knowledge-graph compiler survives scale. This one asks a harder question: are its hypotheses scientifically meaningful, or only linguistically convincing? Popper stops trying to make the compiler smarter and starts making it falsifiable — a strict hypothesis schema, source-level provenance, three negative controls, and a historical rediscovery benchmark where the discovery paper is removed and the system must reconstruct the leap from prior literature alone. Run locally on a 35B model: the compiler scored 0.89–0.97 composite against 0.00 for ungrounded generation, and reconstructed the CTLA-4 checkpoint-blockade and nucleoside-modified-mRNA discoveries from their prior literature — while honestly failing on CRISPR and refusing to confidently rebuild phlogiston.

Jul 23, 2026

Building the Scientific Question Compiler: A Map of What We Do Not Know

We built the second compiler in the Scientific State program: the Scientific Question Compiler, which turns a corpus into a map of what humanity does not yet know. Local-first, running on a 35B model on our own hardware. Here is what we built, what broke, and what it means.

Jul 23, 2026

The Loop Closes Itself: A Compiler That Directs Its Own Next Compile

We closed the loop on the Scientific State Compiler: the open questions from the compiled state are turned into new evidence sources, the field is re-compiled, and Scientific Git records a real version diff. The compiler begins to direct its own next compile — the loop, not the model, becomes the product.

Jul 23, 2026

The Next Experiment: From 'Survives Scale' to 'Correct' — Grounding, Negative Controls, and Quantitative Domains

Today we proved the Scientific Question & State Compiler survives scale — 6.3M ORKG RDF triples distilled into a 300-document corpus, 881 claims, 13 ranked questions, a versioned state of the field, all compiled locally on a 35B model. But surviving scale is not the same as being correct. This post records what we built, what we learned, the four bugs that only appeared at scale (including one that shipped Alzheimer's data into the live ORKG demo), and a fully-specified next experiment: source-level traceability, a grounding audit with a groundedness rate, a negative control, a fixed versioning layer, an explicit distillation method, an external-validity check against survey papers, and a move to quantitative domains (COVID-19 observatory or materials science) where contradictions are measured, not just defined.

More from the archive