The Groundtruth Seam · relations under pressure

The Equation That Vanished at the Sixth Digit

Operate a PSLQ relation search, reproduce the published BBP formula for pi, then test apparent equations among 188 named constants against withheld digits and explicit coefficient limits.

A short integer vector can be a theorem, a transcription error, or the shadow cast by rounded inputs. The order matters. Before this page reports an audit number of its own, it must make a published relation return.

First, the published anchor

Make the known equation return

Eight series enter with pi. The browser sums them from their displayed definition, computes pi separately, and sends all nine values through the same PSLQ engine used by the live pair bench below.

BBP anchor benchcomputing

Xj = Σk≥0 16−k/(8k+j)

returned vector
waiting
ordered X1 through X8, then pi
PSLQ iterations
0
64-bit browser pass
direct residual
0
before display rounding

The returned normalized vector must be (4, 0, 0, −2, −1, −1, 0, 0, −1). It is the coefficient vector printed in Ferguson, Bailey, and Arno's published PSLQ analysis, for the Bailey-Borwein-Plouffe formula. The audit remains visually locked if this check fails.

Layer 1 · return the digits

A perfect equation, for exactly five places

Move one control. At five decimal places, the displayed decimal integers satisfy the relation exactly. Admit the next digit and keep the vector frozen.

Pi and e holdoutready

127 − 56πd + 18ed = 0

admitted pi
3.14159
admitted e
2.71828
frozen vector on full values
−1.1569 × 10⁻⁴

At five places, this is an exact integer statement about 314159 and 271828: 12700000 − 56·314159 + 18·271828 = 0. The full-value residual is computed independently of the slider. The sixth digit does not weaken the relation. It rejects it.

Layer 2 · the catalogue audit

Coincidence has a survival curve

The sophisticated dismissal: every finite input is rational, 17,578 pairwise searches invite coincidences, and PSLQ output is not proof. Correct. So the next instrument freezes every returned primitive vector, restores the source digits, and places the real catalogue beside two deterministic null catalogues.

We could not find this published as of 2026-08-01, having searched the PSLQ literature, the Ramanujan Library paper and public LIReC repository, arXiv, OEIS, Simon Plouffe's current index and b000 table, and web queries for catalogue-wide PSLQ audits and b000 relation scans.

This claim is only about the fixed snapshot, grammar, precision grid, coefficient grid, holdout rule, and null comparison below. Automated searches for relations among constants are already published, most broadly in The Ramanujan Library.

188-row survival labanchor gate checking
The selected counts are printed below.

Plouffe cataloguedigit shufflematched random decimals

candidates
0
returned within H
source-rejected
0
frozen vector fails held-out digits
source-alive
0
compatible with last printed digit
definition-confirmed
0
symbolic or independent formulas
digitsHcandidatesrejectedaliveconfirmedshufflerandom

Run one pair, not the table

The full 35-cell census is the offline-certified new number. This smaller bench executes the shipped browser PSLQ directly on the same embedded source rows, so a reader can inspect one frozen vector and its holdout residual.

Live pair benchready
returned [c,a,b]
waiting
primitive max norm
admitted residual
0
PSLQ input
source residual
0
held-out digits

The four small relations

1 − 2φ + √5 = 0

Definition-confirmed and source-alive.

φ − 2 cos(π/5) = 0

Definition-confirmed, but the final printed source digits miss the strict half-unit interval.

1 + √5 − 4 cos(π/5) = 0

Definition-confirmed and source-alive.

Sierpiński − 4 Masser-Gramain = 0

Definition-confirmed from their published formulas and source-alive.

The second row is the warning inside the warning. Independent definitions prove the relation, while the compact table's last printed digits fail the declared rounding interval. A source-level rejection is not a proof of mathematical falsehood.

The check

source recordloading
search universe0 unordered pairs from 188 rows
relation grammarc + ax + by = 0; primitive integers; a and b both nonzero
precision conventionfirst p significant decimal digits, truncated; p ∈ {8,12,16,24,32,40,48}
PSLQ conventionγ = √(4/3); tolerance 10−(p−1); 500 steps; working precision max(60,p+30)
coefficient conventionH = max(|c|,|a|,|b|) after gcd division and first-nonzero-positive sign
holdout conventioncompatible only if the full-source residual lies within half a last-place unit from each row, weighted by |a| and |b|
null conventionsxorshift32 seeded by FNV-1a of mode, row index, and label; shuffle preserves leading digit, exponent, and length; random preserves exponent and length
independent confirmationfour algebraic or named-definition identities; no numerical persistence is promoted to proof
browser anchor32 terms per Xj, IEEE 754 binary64 PSLQ; offline check uses 160 decimal places with guard digits

Run the independent checker with node research/pslq-constants/verify-pslq-constants.mjs. It reads the committed source record, recomputes every grid cell and null catalogue without importing this page engine, executes the shipped page engine separately, reads the publication date from Markdown frontmatter, and deliberately corrupts source digits and the BBP vector to show both assertion families go red.

Layer 3 · the open edge

A survival table cannot prove independence

This page does not test products, powers, logarithms, or larger tuples. It cannot prove transcendence, algebraic independence, or absence beyond its affine two-constant grammar and declared coefficient bounds. A stable numerical residual is not an identity until an independent definition or symbolic derivation closes it.

The next honest computation would repeat a preregistered holdout audit over the Ramanujan Library's richer expression grammar, with its maintainers' current database export and an error model attached to every source value. This page does not take that step.