Illustrative · unadmitted · revision 1
Rust exact oracle and HVM symbolic reduction for amplitudes at infinity
This is a proposed definition for criticism. It is not an experiment run, result, evidence claim, canonical admission, inventory record, or procurement request.
- Stable identifier
rust-exact-oracle-hvm-amplitudes-infinity- Kind
- analytical
- Intent
- discrimination
Exact target
- external-reference ·
rust-exact-oracle-hvm-amplitudes-infinity — operator-supplied exact oracle plus HVM symbolic reduction proposal
Minimal decisive protocol
Finite truncation versus symbolic infinity
Enumerate finite amplitude expressions in a Rust exact oracle, reduce the corresponding HVM symbolic terms, and compare normalized limits and failure cases without treating a rewrite trace as a physical result.
- Generate typed finite expressions and truncation bounds.
- Evaluate exact rational/complex oracle outputs.
- Run HVM symbolic reduction with trace retention.
- Compare amplitude limits, nontermination, and truncation error classifications.
Decision rule: The symbolic encoding is adequate only where it agrees with the exact oracle under declared normalization and exposes, rather than hides, divergent or undefined cases.
Controls
- positive: Identity and zero-amplitude terms. (term family; Both systems agree exactly.)
- negative: Known divergent truncation family. (limit family; Both systems expose non-finite or undefined status rather than a finite result.)
Observables and units
Observables| Observable | Units | Measurement | Uncertainty reporting |
|---|
| oracle-symbolic delta | exact expression | normalized symbolic and exact comparison | report truncation bounds, not statistical confidence |
|---|
| symbolic reduction steps | steps | HVM trace length and termination status | report resource bound and timeout |
|---|
Calibration and repetitions
- amplitude normalization convention: golden identity and zero tests — normalization is identical in oracle and symbolic encoder (declared convention)
Replicate unit: generated typed expression; minimum 100, independent 10.
Randomization: seeded expression and reduction order permutations
Stopping rule: complete finite expression corpus and declared resource bound
Uncertainty: truncation, symbolic timeout, normalization convention, parser/encoder mismatch; classify exact disagreement by source rather than averaging; retain source, traces, compiler/tool versions, and all failures
Success and falsifiers
Success
- HVM reductions agree with the exact oracle for all terminating declared terms and classify non-finite terms consistently. (classification mismatch = 0 on the terminating corpus terms)
Falsifiers
- The symbolic system returns a finite amplitude where the exact oracle proves divergence or undefined normalization. (finite-versus-nonfinite mismatch > 0 terms)
Required capability groups
- exact-software · required, any-one, quantity 1: reproducible Rust exact arithmetic toolchain (toolchain) — locked compiler and dependency graph
Related capability types: Reproducible Rust exact-oracle and HVM harness
Confounds and raw artifacts
- encoder silently changes variable binding or normalization: typed round-trip and identity corpus; mitigation: publish encoder and exact AST hashes
- oracle-source-and-reduction-trace · Rust source, HVM source, JSON trace · retain compiler versions and timeout logs
Nonclaims
- Symbolic agreement is not evidence for amplitudes at infinity in nature.
- This fixture does not claim HVM semantics, physical realizability, or a canonical oracle admission.
Provenance boundary
Citations identify tools only; they do not support the proposed amplitude claim.
Agent-readable JSON · History · Provenance · Back to experiments