cert-machine · audit · an AI model’s proposals, stated by claimbox, decided here
The real roots of xˣ = y: every fraction bracket an AI model proposed, decided exactly
xˣ = y, by fractions
It began with one picture, xˣ = 64. The equation has one real root, and no fraction equals it. What a fraction can do is trap it: one fraction on either side, each side one comparison of two whole numbers, decided exactly. An AI model computed the root for every y to a thousand and proposed the traps; claimbox stated them as claims; this page decides every side again with code of its own and reads what the fractions show.
Decided here: every side of every trap the study proposed, the four whole-number roots from both sides, and the eight claims about xˣ = 64, each by one exact comparison of integers (certs/xx-ledger.json, tools/run-xx-ledger.py). claimbox’s words are shown beside ours. Computed and not decided: the roots’ digits, their continued fractions, the closest fractions and every statistic. Read and not decided: the argument that the root is unique and that a fraction bounds it exactly when one integer exceeds another. Cited and not decided: the Gelfond–Schneider theorem.
tl;dr
The finding.210 of 218 claims CERTIFIED and the other 8, the planted wrong brackets, REFUTED: 105 roots of xˣ = y each trapped between two fractions, and at y = 4, 27, 256 and 3,125 the root pinned to a whole number from both sides. The root of 64 is decided to nine decimals. claimbox’s record gives the same word on every claim.
The mechanism. For a fraction p/q above 1, x > p/q exactly when pp < Nq·qp, where N = y is read from the pinned file; both sides are computed as whole numbers and compared. No logarithm is evaluated. 216 mutants, each fraction moved one unit the wrong way or each whole-number bound made strict, must flip to REFUTED, and all do.
Check it.python3 -I tools/run-xx-ledger.py --check (seconds; the Python standard library) re-hashes the copies and re-decides every claim.
roots computed
1,002
one for every y from 2 to 1,000, and three beside 5⁵, by Newton’s method in 160-digit arithmetic
roots trapped
105
each between two fractions, every side one exact comparison of whole numbers
claims certified
210 of 218
the other 8 are the planted wrong brackets, all refuted
roots that are fractions
4
exactly the y of the form kᵏ; every other root is transcendental (a theorem cited)
§1 · the picture
The root of 64, nine decimals decided
x = ln 64 / W(ln 64), where W is Lambert’s function. That form describes the number; it decides nothing. The decimals below are decided by two fractions.
xˣ grows for x above 1, so x is above a fraction p/q exactly when (p/q)p/q is below 64, that is, when pp is below 64q·qp. For the fraction below, each side of that comparison is a whole number of 2,598,236 digits. The recorder computes both exactly and compares them; the step from x to the comparison is read, not decided (§4).
458912458912 < 64135009 · 135009458912
The two fractions are neighbouring convergents of the root’s continued fraction, [3; 2, 1, 1, 44, 1, 14, 4, 1, 6, …]: the closest fractions for their size, on opposite sides of x. Its large fifth quotient is why 775/228, with a denominator below a thousand, is already off by only 1.266965e-06.
the claim about xˣ = 64
origin
each side, digits
decided here
claimbox’s record
x > 33991/10000
proposed
154,026 and 154,026
CERTIFIED
CERTIFIED
x < 4249/1250
proposed
15,417 and 15,417
CERTIFIED
CERTIFIED
x > 4249/1250
planted wrong
15,417 and 15,417
REFUTED
REFUTED
x < 33991/10000
planted wrong
154,026 and 154,026
REFUTED
REFUTED
x > 58815/17303
proposed
280,518 and 280,518
CERTIFIED
CERTIFIED
x < 47207/13888
proposed
220,646 and 220,646
CERTIFIED
CERTIFIED
x > 458912/135009
proposed
2,598,236 and 2,598,236
CERTIFIED
CERTIFIED
x < 400097/117706
proposed
2,241,410 and 2,241,410
CERTIFIED
CERTIFIED
The first two rows are the AI’s four-decimal proposal; the planted rows move it one unit in the last decimal, the wrong way, and are refuted. A refutation here is a comparison of two numbers, so it has no witness point to draw.
decided
exact arithmetic backs it
computed
float, or a number someone printed; nothing decided it
why these numbers stand as they do
computed — computed by the proposer’s Newton iteration in 160-digit arithmetic; nothing decided it
decided — p, the numerator of the decided fraction
decided — N, read from the pinned file
computed — a partial quotient of the computed root, kept where the 120- and 160-digit roots agree; computed, not decided
§2 · every root
A thousand roots on one curve
Each dot is the root of xˣ = y. A solid dot is trapped between fractions decided here; a hollow dashed one is computed only. The large dots are the roots that are whole numbers.
Solid: the 105 decided roots, each drawn as its bracket: a dot where the two fractions are closer than a pixel, a bar from one to the other where they are not (y = 23, from 38/13 to 3; y = 3,124, from 4 to 5; y = 3,126, from 5 to 6). Dashed: the curve y = xˣ, drawn in floating point, and the 897 roots computed only. The guides fall at x = 2, 3, 4, 5.Records: corpus/claimbox-xx/records/xxy-study.json · sha256 bf49436db85d; certs/xx-ledger.json · sha256 e41e472a91d4The build refuses this figure if a decided dot’s bracket is not CERTIFIED on both sides here, or claimbox’s word on it differs.
How tight each trap is
For y up to 100, the bar is the number of decimal places on which the two decided fractions agree: those decimals of the root are decided. The dashed line is how many decimals the closest fraction with a denominator of at most 1,000 shares with the computed root. Where the root is a whole number, the bar reaches the top line, labelled exact.
The bracket’s two fractions are the last two convergents with a denominator of at most one thousand. Where the next partial quotient is large, the closest fraction is far better than its size suggests, and the dashed line rises above the bar.Records: certs/xx-ledger.json · sha256 e41e472a91d4; corpus/claimbox-xx/records/xxy-study.json · sha256 bf49436db85dThe build refuses this figure if a closest fraction shares fewer decimals with the computed root than its decided bracket pins.
Every continued fraction, at a glance
Each column is one root, for y from 2 to 400; each row is a partial quotient, the first at the top. The brighter a cell, the larger the quotient, and a large quotient means the convergent before it is an unusually good fraction. Near 27 and 256 the bright cells pile up at the top: there, the whole number is the fraction.
Every cell is computed: the quotients of the computed roots, kept where the 120- and 160-digit roots agree; a missing cell is a quotient the two did not agree on. A quotient of 1, the commonest, is the ground. The roots at 4, 27 and 256 have a single quotient, the whole number itself, and leave an empty column.Record: corpus/claimbox-xx/records/xxy-study.json · sha256 bf49436db85dThe build refuses this figure if a whole-number root’s column holds a quotient, or a computed root other than kᵏ is whole.
The roots, in detail
y
the root x
closest fraction, q ≤ 1,000
its error
the bracket
both sides: here · claimbox
2
1.559610469462…
641/411
2.361337e-07
471/302 < x < 641/411
CERTIFIEDCERTIFIED
3
1.825455022925…
502/275
-4.774703e-07
502/275 < x < 387/212
CERTIFIEDCERTIFIED
4
2
2/1
0
x ≥ 2 and x ≤ 2
CERTIFIEDCERTIFIED
10
2.506184145589…
203/81
-1.130608e-05
203/81 < x < 198/79
CERTIFIEDCERTIFIED
27
3
3/1
0
x ≥ 3 and x ≤ 3
CERTIFIEDCERTIFIED
64
3.399121540052…
775/228
1.266965e-06
758/223 < x < 775/228
CERTIFIEDCERTIFIED
100
3.597285023540…
795/221
4.433289e-08
259/72 < x < 795/221
CERTIFIEDCERTIFIED
255
3.998359701237…
2439/610
9.545011e-07
2435/609 < x < 2439/610
CERTIFIEDCERTIFIED
256
4
4/1
0
x ≥ 4 and x ≤ 4
CERTIFIEDCERTIFIED
257
4.001633623636…
2449/612
3.632923e-07
4 < x < 2449/612
CERTIFIEDCERTIFIED
The root, the closest fraction and its error are the proposer’s, computed. The bracket is decided here, both sides; the first word is this page’s and the second claimbox’s record, each the same on both sides.
decided
exact arithmetic backs it
computed
float, or a number someone printed; nothing decided it
why these numbers stand as they do
decided — the computed roots less the decided ones
computed — computed by the proposer’s Newton iteration in 160-digit arithmetic; nothing decided it
decided — a whole number, decided from both sides here
decided — zero: the closest fraction is k, and the root is k, decided from both sides
§3 · what the fractions show
Four things the continued fractions say
Read from the computed roots. The brackets are decided; the patterns below are observations on computed numbers, and each is labelled as one. The first is a theorem, cited.
One: only kᵏ has a fraction for a root (a theorem, cited)
The root is a whole number exactly at y = 4, 27, 256 and 3,125, and each is pinned from both sides: x ≥ k and x ≤ k, both certified here. For every other whole y the root is not even algebraic. If it were a fraction p/q in lowest terms with q above 1, then pp = yq·qp, which q cannot divide; if it were an irrational algebraic number, xˣ would be transcendental by the Gelfond–Schneider theorem. That theorem is cited, not decided here. So 4 roots are fractions, and every other one is a number no fraction will ever equal.
Two: near kᵏ, one enormous step (an observation)
Just off kᵏ the root sits just off k, by about 1/(kᵏ(1 + ln k)), the reciprocal of the slope of xˣ at k. Its continued fraction says so with one huge quotient: at y = 255 it is 608, where the slope predicts 610.9; at y = 3,126 it is 8,155, against 8154.5. The closest fraction there is the whole number k.
Bars: the large partial quotient each root shows, computed. Dashed ticks: kᵏ·(1 + ln k), the slope of xˣ at k, computed in floating point. The x axis is logarithmic.Record: corpus/claimbox-xx/records/xxy-study.json · sha256 bf49436db85dThe build refuses this figure if a row of the figure is not a root beside kᵏ.
Three: elsewhere, the roots look like typical numbers (an observation)
Pool the partial quotients of all the irrational roots and they follow the law that almost every real number obeys: a quotient of 1 occurs 0.41162 of the time, against the law’s 0.41504. Their geometric mean is 2.6729, against Khinchin’s constant 2.6855, and (ln qn)/n averages 1.1777, against Lévy’s 1.1866. These are observations on 1,002 computed roots, not a proof.
Bars: how often each partial quotient occurs among the 38,922 pooled from the irrational roots, computed. Dashed ticks: the Gauss–Kuzmin law, log₂(1 + 1/(a(a + 2))), as the study prints it.Record: corpus/claimbox-xx/records/xxy-study.json · sha256 bf49436db85dThe build refuses this figure if a quotient other than 1 is the most frequent.
Four: a few roots have fractions that are almost too good (an observation)
A large partial quotient makes the convergent just before it unusually close. The largest found is 4,651,670, in the root for y = 709. Its convergent sits closer to the root than a fraction of its size usually can. For y = 100, the fraction 795/221 is already off by only 4.433289e-08.
y
position
partial quotient (computed)
the convergent just before it (computed)
709
22
4,651,670
20921543179/4735484816
419
32
35,362
13411503747543/3189935931869
621
26
24,682
433820684589981/99395501124953
101
29
16,855
927575580554664451/257542007895192516
441
28
8,503
216551952620850577/51251230167401757
3,126
1
8,155
5/1
decided
exact arithmetic backs it
computed
float, or a number someone printed; nothing decided it
why these numbers stand as they do
computed — a partial quotient of the computed root, kept where the 120- and 160-digit roots agree; computed, not decided
computed — kᵏ(1 + ln k) in floating point, as the study prints it
computed — a statistic of the computed continued fractions; an observation, nothing decided it
computed — the law’s value as the study prints it, rounded to nearest; a literature value, not decided here
computed — computed by the proposer’s Newton iteration in 160-digit arithmetic; nothing decided it
decided — the position in the continued fraction, counted from the computed quotients
§4 · how it was done
Proposed, stated, decided
An AI model proposes. claude-opus-5-5 computed each root by Newton’s method, its continued fraction, and the two fractions that bracket it (claimbox’s tools/xx_study.py, copied here as evidence and never run). Computed, not trusted.
claimbox states. Each bracket became a claim in its language, xroot(n) > p/q, with y read from a pinned file, and cert-machine’s receiver decided it there (claimbox’s check records, the second decision on this page). Eight planted wrong brackets went in with them.
cert-machine decides, again. tools/run-xx-ledger.py reads the copies of those records that LIFT-claimbox.json made (every file re-hashed against PROVENANCE-claimbox.json, which names the claimbox commit they came from), decides every side with code that shares nothing with claimbox or the receiver, refuses if any word differs from claimbox’s, and requires every planted bracket and every mutant to come out REFUTED: 228 of 228 red controls fired.
What the decisions rest on. Each verdict above is an exact integer comparison. The step from the root to that comparison is an argument, read and not run by any machine here:
assumed
The reduction: x > p/q exactly when pp < Nq·qp, for p/q above 1xˣ ≤ 1 on (0, 1], strictly increasing on [1, ∞), and no negative real root: the argument written into claimbox’s library (claimbox/library/selfpower.py, copied here); read, not decided
assumed
Only kᵏ has a fraction for a root (§3, one)the Gelfond–Schneider theorem, cited, with the two-line divisibility argument for a fraction; not decided here
What is not claimed. That the computed digits are right beyond the decided ones; that the observations of §3 are theorems; anything about a y the study did not decide. The study’s numbers are a proposer’s, and this page draws them dashed.
decided
exact arithmetic backs it
computed
float, or a number someone printed; nothing decided it
Re-run: python3 -I tools/run-xx-ledger.py --check · make drift (the copies against claimbox) · in claimbox: python3 -m claimbox check corpus/xxy/claims.claim --run.