Commit graph

4 commits

Author SHA1 Message Date
aac17e6e34 docs(p28): recast the method document as a route narrative
Renames THE_ENCODER_APPROACH.md -> HOW_THE_SOLUTION_WAS_FOUND.md and rewrites
it to answer the question a reader actually has -- why these moves -- rather
than arguing for novelty.

Removed: all self-assessment of distinctiveness. Replaced with a plain statement
of the relevant standard practice (PSLQ/LLL, Inverse Symbolic Calculator;
canonical numeration systems, base-k recognisable sets, Cobham) so a reader can
place the work without being told what to think of it.

The narrative now explains each move that looks arbitrary in isolation:
  - why the seed data was treated as generated rather than given
  - why a bijective codec was needed first, which is what the Radix framing and
    DFA canonicalisation work is for
  - why the Pascal basis was not a search: the matrix's own second row
    (-u^3, -3u^2, -3u, -1) is a signed Pascal row, visible before any fitting
  - what decoded (A, B, S) and why exact agreement makes it evidence
  - how A, B factor through s2(tau_163) to reduce the problem to one CM value
  - why the encoding is only a lead, with the proof built independently
  - why the deformation r = 1/x exists: without it there is no contour

Adds a 'What did not work' section recording the three closed routes with their
witnesses (t-line intertwiner impossibility, L_U monodromy exclusion, Sym^2 V
set aside), since the indirectness of the final route is explained by them.

Retains the honest limits: 3.54x is not compression, and the claim should be
rejected.

Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WY6SfRYvm8zFKMX9GcjS8u
2026-07-31 04:31:36 -05:00
8d25a7b367 cert(p28): official-object certificate — proof analyses the official matrix, not a surrogate
Reconstructs the Problem 2.8 data directly from the challenge statement
(R, u=2n+3, w, the 4x4 M(n), both integer seed rows) and verifies by exact
rational arithmetic that the manuscript's specialisation reproduces it:

  M_N(x_0) == official M(N), all 16 entries, at N = 0,1,2,3,5,8,17,40
  A_0 = A*C - (5/4)H_0  == official first seed row
  A_1 = S*C             == official second seed row
  (14R-567)/9 == 236337691420383  (the deformed coefficient restores)

18 assertions, three with explicit negative controls. fractions.Fraction
throughout; no floating point, no CAS.

Closes the one gap no existing certificate covered: the other four verify
statements about the deformed family, none verified that the family is the
official object.

Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WY6SfRYvm8zFKMX9GcjS8u
2026-07-31 04:09:39 -05:00
Codex
492c8ab871 feat(p28): harden exact proof equations 2026-07-31 15:33:21 +07:00
Codex
437b439c6c feat(p28): close exact Ramanujan 2.8 limit
Portable proof handoff intended for verified mirror base 1229ab9e61bee936cb1a29c0693ee56922d2d908.
2026-07-31 14:30:10 +09:00