TRANSFER THEOREM LABAdelic Arithmetic Research
Query geometry · 2026

THE QUERY GEOMETRY EDITION

What can this experiment know?

Change the uncertainty. Follow its effect on the answer.

Read the research

49 INTEGER ANSWERS · 8,900 COMPLEX READINGS

A sharper question. A stronger guarantee.

Complete infinite source class
CHECKING BUDGET
Largest certified error bound
integer gates pass
Error components compared with the one-half rounding threshold

Every requested coefficientEach bar is a complete upper bound
All 49 coefficient error bounds, with the one-half threshold
WHY THE NEW BOUND IS SMALLER

Follow the disturbance through the answer decoder before taking its size. Symmetry removes the odd real drift response; shared clock offset enters only at second order.

What this guarantee assumes

The source is an infinite Dirichlet series with independent integers 0 ≤ a(n) ≤ d₁₄(n), with a(1) = 1 known. All higher coefficients remain in the complete tail. This envelope does not assert that every source is a number field.

Drift is B sin(ωtactual/890 + φ), with real B and φ. Complex polynomial nuisance through degree 11 is unrestricted. Clock distortion is shared and affine; arbitrary per-reading jitter is outside this model.

Mismatch has weighted radius 10⁻⁶. Every actual solve needs its own normal residual ≤10⁻³⁰; digital centering contributes 10⁻²⁰. The two weightings define different sensor-noise norms.

The browser uses conservative rational premises and exact integer arithmetic for its gates. Plot positions and displayed decimals are rounded. A failed budget is not an ambiguity proof. Read the spectrum proof ↗