Don’t take the AI’s word for it. Modern models will agree to two easy jobs that cannot both hold, and they will write a formula for a job they do not know. realize is an independent check. The model may propose. It may not grade itself.
Independent checker for value-conditioned operator synthesis. Finite kernel. Four verdicts. Agents cannot grade themselves.
Read NONCLAIMS.md first. This package does not compile arbitrary English, does not beat SemGuS, and does not let an agent grade itself. Public theatre (render-only, in-repo until GitHub Pages is enabled): web/.
pip install git+https://github.com/ZuluYokohama/realize.git
realize demo three_state
realize demo max_formula
realize demo grid_recolor
realize check demos/three_state/spec.json candidate.jsonNot on PyPI yet. pip install realize will 404.
three_state is supposed to be UNSAT: three inputs share one code and their acceptable sets {0,1} ∩ {1,2} ∩ {0,2} are empty. Pairwise intersections are nonempty. That is the point.
| Verdict | Meaning | CLI exit |
|---|---|---|
PASS |
This candidate meets R and K at the declared scope |
0 |
| adapter reject | Bad JSON, digest mismatch, unknown semantics | 1 |
COUNTEREXAMPLE |
This candidate is false | 2 |
UNSAT |
The declared finite class is empty (scoped) | 3 |
UNKNOWN |
Budget, coverage, or evidence is insufficient | 4 |
Stdout is the certificate JSON. realize synthesize emits candidates only and never a verdict.
- Independent checker:
realize.checkerdoes not import the generator. - Three public demos:
max_formula(VCOS Table 2),grid_recolor(IGVF–CTS §7.1),three_state(VCMS Ex. 4.3). - Hidden fixtures that still have to pass: 2,625 coefficient candidates, 192 encoder–input cases, 121 and 31 term series, zero-budget
UNKNOWN. - Agent surfaces: CLI, optional MCP extra,
skills/realize/SKILL.md.
See NONCLAIMS.md. No LLM proposer, no geometry, no sheaves, no dressings, no realize solve. Architecture: papers/architecture.md. Relational certificate pattern (not a DFM solver): papers/relational-section.md.
Four domains, where a domain is a problem_family paired with a grammar:
| Domain | Semantics | Source |
|---|---|---|
formula.bounded_coeff_template |
exact_rational |
VCOS §8.1 / Table 2 |
encoder.finite_case_table |
finite_relation |
VCMS Example 4.3 |
term_series.typed_grid |
finite_integer |
IGVF–CTS §7.1 |
term_series.guarded_integer_sequence |
finite_integer |
VCOS §8.3 |
python3 scripts/vv.py # every domain
python3 scripts/vv.py --lean # add the Lean corroborationEvery domain has to be seen reaching all four verdicts and an adapter reject — a domain that can
only be shown passing is a domain nobody has watched fail. Coverage is read out of
realize.verdicts, so a grammar added to the kernel breaks the run until a domain arrives with it.
vv/lean/ re-states the same finite facts in Lean 4 and proves them with kernel-checked
decide — core Lean, no Mathlib, no native_decide, no sorry. The runner then recomputes all 29
reported quantities from the Python kernel and compares. That is what catches a frozen count edited
to match a drifting kernel. Lean agrees or disagrees. It never mints a verdict.
This is verification. It is not validation: whether a formal R matches anyone's intention stays
open, and no green run closes it. VV.md, then NONCLAIMS.md §10–11.
Load the skill. Propose if you must. Then:
realize check spec.json candidate.jsonPaste the certificate. Do not call another model to grade the answer.
# GitHub Actions
- run: realize check spec.json candidate.jsonNonzero exit fails the job. UNKNOWN (exit 4) is not green unless you explicitly allow it.
MCP:
pip install 'realize[mcp]'
python -m realize.mcp_serverTools: realize_check, realize_synthesize, realize_explain, realize_demo. No realize_solve.
pip install -e ".[dev]"
pytest
ruff check src tests scripts
python3 scripts/vv.pyPython ≥ 3.11. Core extra is stdlib-only.
Citations in papers/README.md. Schema: schema/realize.v0.json.