Try to break the claim.

01 / Define the search

A reproducible finite domain

The engine visits every sorted five-reading multiset from your values. Each target is tested against it. The midpoint claim also checks its exact constructed midpoint, even when that point is not on the chosen target grid.

Ready for an exact finite search.

Sorted values and reduced fractions are written into the certificate. The work stays on this device. No customer data, target interval, or reading is sent to an application server.

02 / Evidence, not hype

What this grid actually says

The fingerprint identifies exact JSON bytes; it does not authenticate the author or observations. Recheck a downloaded record with python3 tools/verify_conjecture_experiment.py experiment.json. No counterexample on a finite grid is not a general proof. The separate established identities argument addresses the midpoint statement for all real inputs.

03 / Your claim

Build a statement. Test its limits.

Use the reading and target grids above. Choose 3 through 7 readings, a precise target condition, and a predicted error ordering. The engine checks exact eligible cases on your grid, then classifies every supported claim using either a general algebraic proof or a constructed, exact endpoint counterexample.

Choose a claim to test.

For even samples, the median is the exact average of the two central sorted readings; for odd samples it is the central reading. The proof covers the two resulting real estimates and target for the selected sample size; the finite grid only supplies examples. The v6 checker independently replays the selected grid, the endpoint construction, and any algebraic argument. An older receipt may have only a finite-grid result. Inputs stay in this browser until you choose to export them.

04 / Research discipline

A mathematical claim has a status.