compiler boundary
Guarded lowering
A9 through A11.3 convert EML advantage evidence into conservative
compiler policy: preserve EML for proof/search shape, lower near-zero
`exp(x)-1` to protected `expm1`, lower softplus/log-sum-exp to
protected forms, require positive-domain guards, and block unstable
deep trees.
Open packet builder symbolic search
PySR reality check
The first real private PySR run did not show a robust EML grammar
advantage on the prime-residual fixture. That is useful evidence: it
narrows the claim to better feature design, sharper targets, and
pre-registered controls instead of treating EML universality as a
performance claim.
Open template search machlib
Small checked witnesses
MachLib has small witnesses for softplus positivity, sigmoid
denominator nonzero, eml(x, 1) = exp(x), and the
Atlas-facing subtraction boundary
eml(log(v), exp(u)) = v - u under 0 < v.
These are scoped footholds, not full EML language semantics.
See status table claim boundary
What is claimed
We claim generated analysis artifacts, simulated traces, replay checks,
and explicit proof-obligation names. We do not yet claim production
optimizer rewrites, broad EML superiority, compiler correctness,
hardware observations, zeta-zero discovery, or fully discharged formal
proofs for the whole stack.