Skip to content

v8.9.0 — Real 80-Check Audit: Honest Level-26 Finite Descent + B+C+D Conditional Beal

Choose a tag to compare

View all tags
@DavidFox998 DavidFox998 released this 01 Sep 21:11
· 46 commits to main since this release
v8.9.0
386e35e

v8.9.0 — Real 80-Check Audit

This release archives the immutable v8.9.0 tag at commit 386e35e20ab857559668f6e92949f31fe857d746.

What is real

  • Complete finite grid of eight S-unit representatives against ten quartics: 80 entries.
  • All 80 available local checks pass at p = 2 and p = 13.
  • The audited declarations contain no sorry, admit, sorryAx, or Lean.ofReduceBool.

Honest boundary

All eight S-unit representatives remain. This is not a singleton 2-Selmer computation. SecondDescentHypothesis_26, the Jacobian transport, formal immersion, modularity, and level-lowering suppliers remain explicit conditional boundaries. The B+C+D Beal chain is therefore conditional; this release does not claim an unconditional proof of Beal's Conjecture.

Attached archive

  • File: beal-conjecture-v8.9.0.tar.gz
  • Size: 175208 bytes
  • SHA-256: 61362de15bd0c2ea9f64fea47ce91e958c9eafd2a6aa034147fda68099266672
Assets 3
Loading