Certified answers from imperfect experiments

The source is the complete independent integer envelope 0 ≤ a(n) ≤ d14(n), with a(1)=1 known and all higher coefficients included in the complete tail. This does not assert that every admissible sequence comes from a number field.

Drift is B sin(ω t_actual/890 + φ), with real amplitude B and real phase φ, |B| ≤ 4,000, and |ω| bounded by the selected row's bandwidth. Polynomial nuisance may have arbitrary complex coefficients through degree eleven. An arbitrary complex sinusoidal amplitude requires the earlier complex-modulus bound.

All rows retain sensor radius 4e-5, separate mismatch 1e-6, digital-centering radius 1e-20, and a data-dependent verified normal residual ≤1e-30. The two weighting choices define different noise norms. Shared affine clock distortion is distinct from arbitrary per-reading jitter.

The same six rows 485, 493, 499, 501, 507, and 515 now certify the normalized clock/potential square [-2,2]^2: area 16 instead of 4. Both physical-model radii are 2e-8. The guarantee covers all 21 target labels, every nonzero two-mode source, and every admitted nominal and actual time in [1,2].

At sensor radius 3e-8 times the source norm, relative source error is below 0.000842860553. A tighter charge for the existing complete kernel remainder releases the margin; the sensors did not change. Physical apparatus calibration remains unperformed.

At the original noise, square half-width 2.09 passes the sufficient bound and 2.10 fails its label gate. That failure is not an actual ambiguity witness. The supplied raw decoder accepts half-width 2.

• A query response spectrum measures the change in a decoded answer. In this symmetric arithmetic example, the odd real sine response vanishes; signed cosine moments and a complete remainder bound the declared frequency and phase family.
• Query contact order is the first nonzero change in decoded answer minus true answer. Exact symmetry makes shared arithmetic offset enter quadratically. A proved symmetry-defect allowance quantifies how a linear term returns.
• Nuisance closure asks what an unwanted signal can become under uncertain acquisition. With unbounded amplitudes, a small open clock interval may require a larger removal space. Bounded amplitudes can instead permit quantified leakage.
• Observational completion distinguishes an actual arithmetic object from limiting responses that actual objects approximate. For computably specified finite-symbol quadratic-field queries, complete tails and finite-prefix realization give a decision procedure promised to terminate away from the critical noise radius. The browser illustrates the cost; it does not run the full field-recovery search.
• The certification gap separates a sufficient recovery bound from an actual ambiguity witness. The separate three-reading model closes this gap exactly.

For a displayed source x and unrestricted shared offset u, the readings x+u and 2x+u can remove the nuisance by subtraction, but they do not remove sensor error. The exact answer set retains every source compatible with the observation and declared error. With independent unrestricted offsets, the same subtraction is invalid.

A singleton certifies a discrete answer. A continuous question needs an enclosure narrow enough for its requested accuracy. Processing is sound only when it retains the true explanation; silently dropping an allowed uncertainty can create false certainty.

Sources: [1] [3]

After a valid nuisance operation, let the processed model be y=A_j u+D_j(z)u+e with nonzero source u and relative residual bounded by r_j. The joint parameter z remains shared across all readings in one explanation, while competing explanations may choose different admitted parameters.

A weighted strict Gram inequality separates distinct label tubes. Once the correct label is identified, passing each disturbance direction through the nominal query inverse gives a structured recovery bound that can be sharper than charging every error at the weakest inverse direction.

Sources: [3] [2]

This section records the September 5 v1 calculation under its original assumptions. See the current Query Geometry results above for the stronger September 10 guarantees.

A reflecting 1001 by 1001 grid evolves a nonzero two-mode source whose starting target is one of 21 neighboring rows. Six selected spatial averages identify the target row and recover both source coefficients for every admitted target and every nominal and actual time in [1,2].

The clock and potential tolerances were fixed before testing. Independent consumers verify the complete-time polynomial, target-pair, directional, and raw reconstruction records. The tolerances are expressed in model coordinates and still require physical units and calibration before any apparatus claim.

Sources: [1] [2]

This section records the September 5 v1 calculation under its original assumptions. See the current Query Geometry results above for the stronger September 10 guarantees.

The arithmetic model uses 8,900 complex readings to recover the 49 unknown integers a(2) through a(50), with a(1) known and every coefficient inside the declared d14 envelope. Higher coefficients remain in a complete infinite-tail bound; polynomial drift, oscillatory drift, separate mismatch, sensor noise, digital centering, affine-clock distortion, and actual-matrix residual all consume the same recovery budget.

Complete multiplicative clock blocks group 32 successive powers of two for every odd starting integer and charge every omitted power. The new base clock bound is below 2.987008e-8, more than 53.45 percent smaller than the preceding pairing bound. At degree twelve, both weightings certify 120 times the base clock radii; the preceding outer-window sufficient formula misses the same fixed contract while the new complete bound passes.

Sources: [1] [2] [3]

This section records the September 5 v1 calculation under its original assumptions. See the current Query Geometry results above for the stronger September 10 guarantees.

At oscillatory amplitude 4000, frequency 3, and base clock radii, the verified degree-eleven sufficient bounds exceed 1.09 and 1.14 and only 32 of 49 gates pass. Degree twelve is therefore the least passing degree among the tested set 6, 8, 10, 11, and 12 for that fixed comparison.

The same verified degree-eleven model recovers all 49 integers at amplitude 500 and base clock radii, with complete errors below 0.445865330 and 0.494913819. Failure of the larger-amplitude certificate is not a universal degree lower bound or an impossibility theorem.

Sources: [1] [2]

Experimental preparation, harmonic readings, arithmetic query structure, multiscale arithmetic sensing, and finite-resolution sensing all contribute to the transfer framework. Their source classes, uncertainty sets, norms, and questions remain distinct.

The common language is useful because it produces checked consequences while preserving those differences. Older reports remain records of their original, narrower guarantees.

Sources: [1] [2]

The new Query Geometry lab evaluates arithmetic and spatial gates with exact rational arithmetic on conservative exported premises. Its pixels and displayed decimal budgets are illustrative. The historical v1 lab retains its original exact toy and fixed-contract inheritance.

Scenario v2 files and fragments are bounded to 8,192 bytes and reject unknown fields; v1 fragments are not silently converted. No visitor data are uploaded, no server compute is used, and there is no persistent browser storage.

The Evidence view links the readable report, proofs, offline lab and a reproducibility overlay onto the preserved original research release. The optional WebMCP read/configure adapter shares the visible controls and was tested in a private supporting browser. The proposed TGN edition retains the AO-only live pilot by not loading this adapter.

• 33 focused research tests passed.
• 19 of 19 dependency-free lab tests passed.
• The public release, immutable handoff, and validation run resolve at the cited commit.
• The lab registers no WebMCP tools and exposes no backend or external compute.

Sources: [4] [5] [6]

These results establish conditional guarantees inside declared mathematical models. They do not provide pendulum apparatus calibration, a physical noise distribution, empirical model membership, external peer review, or a historical-priority decision.

Future physical data must satisfy their own calibration, uncertainty, residual, and model-adequacy obligations. A successful numerical solve cannot supply those premises by itself.

Sources: [1] [3]