Limits
The non-claims are the specification.
This page is not a disclaimer. It is docs/LIMITATIONS.md and the separation-of-concerns section of docs/ARCHITECTURE.md, which together define the shape of what the runtime is allowed to say.
Does not establish
MMLC Runtime 1.0 does not establish that:
- a declared provenance or causal graph is the true graph of the external world;
- branch probabilities are learned or objectively calibrated;
- finite observation equivalence is general statistical identifiability;
- fixed-point convergence is a formal proof for arbitrary nonlinear systems;
- deterministic Halton/copula samples provide analytic continuous inference;
- reverse audit weights imply reverse causation;
- hash chains provide blockchain consensus, trusted timestamps, or independent notarization;
- minimum-support repairs identify the unique historical error;
- MMLC is universally faster or more expressive than spreadsheets, DAG engines, databases, symbolic systems, SMT solvers, causal libraries, or probabilistic programming frameworks.
Separation of concerns
Seven rules hold the architecture apart. Each one names a collapse that would otherwise be easy to make.
- Layouttransaction identity
- Display traversalnecessarily execution traversal
- A locally correct computationa trusted one — it can consume an untrusted declared channel
- A repair proposalautomatically the unique real-world root cause
- A reverse query weightreverse causation
- A declared branch probabilitylearned objective probability
- Deterministic continuous samplinganalytic inference — it is a finite approximation
What it is
The runtime is an executable, auditable model. Its conclusions are conditional on the supplied document, operators, constraints, probability model, utilities, costs and observation definitions.
That conditionality is not a weakness being confessed. It is the reason a run is worth anything: every input the conclusion depends on is written down in the document, hashed, and reproducible.
Hash compatibility
One practical limit worth stating on its own. Semantic hashes are reproducible within the same runtime and operator lock in deterministic mode. A runtime upgrade may intentionally change a hash when a defect in semantics, canonicalization or audit output is fixed.
Check compatibility with manifests, runtime versions, operator locks and migration snapshots — not with a hash alone.
Version discipline
The roadmap states the rule that keeps this page short: major semantic expansion should not be placed into Runtime 1.x merely to continue version-number growth. New work should prefer depth over feature accumulation.