pith. sign in

arxiv: 2605.00573 · v1 · submitted 2026-05-01 · 🧮 math.NT

Exponent-one blockers and a Mordell-Weil construction of Euler bricks

Pith reviewed 2026-05-09 18:53 UTC · model grok-4.3

classification 🧮 math.NT
keywords Euler bricksperfect cuboidsexponent-one primesMordell-Weilelliptic curvesPythagorean triplesDiophantine equationsspace diagonals
0
0 comments X

The pith

Every Master-Hit parametrization carries a prime of exact exponent one that blocks the space diagonal from being an integer.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines Euler bricks, rectangular boxes with integer edges and face diagonals, and the question of whether any can also have an integer space diagonal. Candidates are parametrized as Master-Hits from two coprime Pythagorean pairs. For each such candidate the expression whose square root would be the space diagonal always factors with a prime appearing to exactly the first power that avoids dividing any of 29 fixed expressions in the parameters. This forces the expression to stay non-square. The authors generate over a million additional candidates by enumerating rational points on associated elliptic curves and lifting those that satisfy the required conditions; every new instance obeys the same obstruction.

Core claim

For every Master-Hit the space-diagonal norm f1 := (W1 U2)^2 + (U1 V2)^2 admits a prime divisor ℓ of exponent exactly one which is coprime to a fixed list of 29 canonical expressions in the parameters. This is verified on all 151575 Master-Hits whose f1 has been fully factorised and on an additional 1222841 instances produced by bounded Mordell-Weil combinations on the elliptic models E_{m,n} over 411 fibres, for a total of 1284670 examples none of which yields a perfect cuboid.

What carries the argument

The exponent-one blocker in the space-diagonal norm f1, identified by complete prime factorization and enforced through the elliptic fibration of the Master-Hit variety together with Mordell-Weil enumeration on each fibre.

Load-bearing premise

The complete factorization of f1 was obtained correctly for every examined Master-Hit and the bounded Mordell-Weil enumeration on each of the 411 fibres produced all admissible points without missing any that could yield a perfect cuboid.

What would settle it

Discovery of one Master-Hit in which f1 factors entirely into even powers after removal of factors dividing the 29 canonical expressions, or equivalently the appearance of a perfect cuboid within this parametrized family.

read the original abstract

A body cuboid is a rectangular parallelepiped with integer edges and integer face diagonals; if its space diagonal is also integer, it is a perfect cuboid, whose existence is a long-standing open problem. We make two contributions to the study of body cuboids parametrised by two coprime Pythagorean pairs $(a,b)$ and $(m,n)$ in Euclid form (Master-Hits). The first is a verified exponent-one blocker phenomenon: for every Master-Hit, the space-diagonal norm $f_1 := (W_1 U_2)^2 + (U_1 V_2)^2$ admits a prime divisor $\ell$ of exponent exactly one which is coprime to a fixed list of $29$ canonical expressions in the parameters. This is strictly stronger than the existence of any odd-exponent prime divisor: a prime of exponent $3, 5, \ldots$ would obstruct $f_1$ from being a square but carry an extra square factor; the observed obstruction is always primitive. The phenomenon is verified on all $151{,}575$ Master-Hits whose $f_1$ has been fully factorised. Two natural strengthenings fail: the largest outside-parameter prime need not be a blocker, and the smallest outside-parameter blocker need not have exponent one. The second contribution uses the elliptic fibration of the Master-Hit variety over the $(m,n)$-plane. For coprime $(m,n)$ the Master-Hit equation defines a genus-one quartic $H_{m,n}$; a quartic-to-Weierstrass normalisation gives an elliptic model $E_{m,n}$ with a rational function $\tau$ returning $t^2$. Our generator enumerates bounded Mordell-Weil combinations on $E_{m,n}(\mathbb{Q})$, lifts the points satisfying $\tau(P) \in \mathbb{Q}_{>0}^{\square}$ to admissible Euclid pairs $(a,b)$, and certifies each via exact integer arithmetic. From $61{,}829$ classical Master-Hits we generate $1{,}222{,}841$ further ones \"uber $411$ fibres. None of the resulting $1{,}284{,}670$ Master-Hits is a perfect cuboid; all fully factored records satisfy the exponent-one blocker phenomenon.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper studies body cuboids (Euler bricks) parametrized by coprime Pythagorean pairs in Euclid form, called Master-Hits. It claims a verified 'exponent-one blocker' phenomenon: for every such Master-Hit the space-diagonal norm f1 = (W1 U2)^2 + (U1 V2)^2 admits a prime divisor ℓ of exact exponent one that is coprime to a fixed list of 29 canonical expressions in the parameters. This is asserted after exhaustive factorization on all 151575 Master-Hits whose f1 was fully factored. The second part constructs an elliptic fibration of the Master-Hit variety, normalizes the genus-one quartic H_{m,n} to a Weierstrass model E_{m,n} with a rational function τ returning t^2, and enumerates bounded Mordell-Weil combinations on 411 fibres to generate 1222841 additional Master-Hits from 61829 classical ones, yielding 1284670 total examples; none is a perfect cuboid and all satisfy the blocker.

Significance. If the computational claims are correct, the exponent-one blocker supplies a uniform, primitive obstruction to the space diagonal being square in this parametrization, which is stronger than a generic odd-exponent prime and therefore more informative for the perfect-cuboid problem. The Mordell-Weil generator over the (m,n)-plane provides a systematic, exact-arithmetic method for producing more than a million certified Euler bricks, a concrete constructive contribution. The use of exact integer arithmetic for certification of the generated examples is a methodological strength that supports reproducibility in principle.

major comments (2)
  1. [Abstract] Abstract (verification statement on 151575 Master-Hits): the central blocker claim rests on the assertion that f1 was fully factorized in every case and that a prime ℓ of exact exponent one coprime to the 29 expressions was always found. The manuscript supplies no description of the factorization algorithm, prime-search bounds, multiplicity checks, or independent certification procedure. A single missed prime or incorrect exponent would falsify the 'every Master-Hit' statement.
  2. [Abstract] Abstract (Mordell-Weil enumeration over 411 fibres): the non-existence claim for perfect cuboids and the completeness of the generated set of 1284670 Master-Hits depend on the bounded search on each E_{m,n} having captured every rational point P with τ(P) a positive rational square. No height bound, rank bound, or proof that admissible points lie inside the searched region is supplied; an admissible point outside the bound would produce a counter-example to the obstruction or to the non-existence statement.
minor comments (2)
  1. [Abstract] The phrase 'uber 411 fibres' in the abstract appears to be a typographical error for 'over'.
  2. The 29 canonical expressions to which ℓ is required to be coprime are never listed explicitly; their definitions should appear in the section introducing the blocker phenomenon.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for the careful reading and for pointing out the need for greater transparency regarding our computational methods. We address each major comment in turn.

read point-by-point responses
  1. Referee: [Abstract] Abstract (verification statement on 151575 Master-Hits): the central blocker claim rests on the assertion that f1 was fully factorized in every case and that a prime ℓ of exact exponent one coprime to the 29 expressions was always found. The manuscript supplies no description of the factorization algorithm, prime-search bounds, multiplicity checks, or independent certification procedure. A single missed prime or incorrect exponent would falsify the 'every Master-Hit' statement.

    Authors: We agree that the manuscript would benefit from an explicit description of the factorization procedure to support reproducibility. In the revised version we will add a computational methods subsection that details the algorithm used for full factorization of each f1, the prime-search bounds applied, the verification of exact exponent one, and the independent certification steps performed on the 151575 cases. revision: yes

  2. Referee: [Abstract] Abstract (Mordell-Weil enumeration over 411 fibres): the non-existence claim for perfect cuboids and the completeness of the generated set of 1284670 Master-Hits depend on the bounded search on each E_{m,n} having captured every rational point P with τ(P) a positive rational square. No height bound, rank bound, or proof that admissible points lie inside the searched region is supplied; an admissible point outside the bound would produce a counter-example to the obstruction or to the non-existence statement.

    Authors: The claims in the manuscript apply strictly to the 1,284,670 Master-Hits that were generated and certified from the bounded Mordell-Weil search; we do not claim that this collection comprises all possible Master-Hits. Among the generated examples none is a perfect cuboid and all fully factored records satisfy the exponent-one blocker. We will revise the abstract and main text to state the concrete search bounds employed and to clarify that the non-existence and blocker statements concern only the enumerated set. An admissible point lying outside the bound would simply produce an additional example not included in our list, without falsifying the statements about the examples we do report. revision: partial

standing simulated objections not resolved
  • A rigorous proof that the bounded Mordell-Weil search on each E_{m,n} captures every rational point P for which τ(P) is a positive rational square.

Circularity Check

0 steps flagged

No circularity; claims rest on direct factorization and MW enumeration

full rationale

The paper verifies the exponent-one blocker by explicit prime factorization of f1 across all 151575 fully processed Master-Hits and generates further examples via bounded Mordell-Weil searches on the 411 elliptic curves E_{m,n}. These steps use algebraic normalization to Weierstrass form, rational-function checks for tau(P) being a positive square, and exact integer arithmetic; none reduce by construction to fitted inputs, self-definitions, or load-bearing self-citations. The non-existence statement for perfect cuboids is likewise an exhaustive enumeration result within stated bounds, independent of the target claims.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on the standard axioms of elliptic curve theory over the rationals and the correctness of integer factorization algorithms; no new free parameters, ad-hoc axioms, or invented entities are introduced.

axioms (1)
  • standard math Mordell-Weil theorem for elliptic curves over Q and unique factorization in Z
    Invoked implicitly when enumerating rational points and certifying integer parameters via exact arithmetic.

pith-pipeline@v0.9.0 · 5732 in / 1431 out tokens · 62590 ms · 2026-05-09T18:53:59.537896+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

13 extracted references · 13 canonical work pages · 1 internal anchor

  1. [1]

    Cassels, J. W. S. , title =

  2. [2]

    , title =

    Guy, Richard K. , title =

  3. [3]

    2024 , note =

    Himane, Djamel , title =. 2024 , note =. 2405.13061 , archivePrefix=

  4. [4]

    Leech, John , title =. Amer. Math. Monthly , volume =. 1977 , note =

  5. [5]

    Bosma, Wieb and Cannon, John and Playoust, Catherine , title =. J. Symbolic Comput. , volume =

  6. [6]

    Quartic reductions and elliptic obstructions for perfect Euler bricks

    Peschmann, Ren. Quartic reductions and elliptic obstructions for perfect. 2026 , note =. 2604.09328 , archivePrefix =

  7. [7]

    and Granlund, Torbj

    Rathbun, Randall L. and Granlund, Torbj. The integer cuboid table with body, edge, and face type of solutions , journal =

  8. [8]

    , title =

    Rathbun, Randall L. , title =. 2017 , note =. 1705.05929 , archivePrefix =

  9. [9]

    1740 , pages =

    Saunderson, Nicholas , title =. 1740 , pages =

  10. [10]

    , title =

    Sharipov, Ruslan A. , title =. Ufimsk. Mat. Zh. , volume =

  11. [11]

    van Luijk, Ronald , title =

  12. [12]

    , title =

    Hogan, Edward R. , title =. Historia Mathematica , volume =

  13. [13]

    Piezas, Tito , title =