← BSD Conjecture · LAYER 3 · III · Crystallization
Conditional algebra for calibrating a rank-two leading coefficient against a rank-zero curve — determinant lines, jets, lattice torsors, characters, holonomy and a closure into a seven-node chain — checked statement by statement on exact random instances; one theorem false in one direction, two supplements its documents leave implicit, a bookkeeping character measured rather than read, and the rank-two identity at 389.a1 closed with every factor computed here
I · Precursor (five sub-lines: Phase 0, P5, Phase 1, Phase 2 and the stress test) → II · Computation and Reproduction (107 runs, RUN-001 to RUN-107) → III · Crystallization (this page, the formal paper).
2eaa2772ff3b38a3…69894c69d345c27b…The PDF is built from the Markdown source by tools/build.py of the crystallization repository, amral-crystallization, at commit 8953b08e8f5f2fcab5a87d101acac208577dc948. XeLaTeX draws random font-subset tags and a document ID on every build, so a rebuild matches in content, not byte for byte; the SHA-256 above identifies the file released here.
The Birch–Swinnerton-Dyer conjecture is open, and nothing here bears on it directly. A research programme on the rank-two curve 389.a1 at the good ordinary prime 11 wants the leading coefficient of an 11-adic family to be calibrated against a rank-zero curve, so that the unknown scalars common to both cancel and only arithmetic remains. Thirty symbolic rounds, written without computation, build the algebra for that: a calibration across ranks, determinant lines and their jets, lattice torsors and the limits of 11-adic descent, Euler defects of cones, a self-dual fundamental line, the characters by which every normalization choice acts, holonomy on graphs of transports, and a closing round that arranges it all into a seven-node chain and a ten-item certificate. Every statement is conditional, and the rounds say so. This paper checks each boxed identity by instantiating it in exact arithmetic — formal series with vector coefficients over the rationals, exterior algebra, integer lattices and their Smith forms, two-term complexes, ideles of the rationals, random graphs — on 40 random instances or more, with negative controls. Every identity holds except one: a theorem on ideles is false in one direction, at the sign \(-1\) its own hypothesis excludes. Two supplements are made explicit, a bookkeeping character of eight coordinates is measured from a pipeline that performs each transformation instead of being read from the text, and the round that asks for one determinant regulator is answered on 389.a1 itself: from canonical heights computed here the regulator is 0.15246017794314376, and the rank-two identity \(L''(E,1)/2 = \Omega\cdot\mathrm{Reg}\) closes with every factor computed in this line, to the floor of the quadrature.
The paper covers the thirty symbolic rounds of the first layer's P5 sub-line, written by Aletheia in the web session assigned to symbolic derivation, with the second layer's recomputations of them, RUN-079 and RUN-082 to RUN-089: the projective calibration across ranks, determinant lines and jets, lattice torsors and the limits of 11-adic descent, Euler defects of mapping cones, the self-dual fundamental line, the bookkeeping character, holonomy and naturality on graphs, PC-001's lattice and a second anchor, the defect line and the closing seven-node chain and ten-item certificate. Every boxed identity is instantiated on random instances in exact arithmetic. The rounds themselves are conditional statements (INHERITED); the actual Beilinson–Flach family, the common scalars and their partner-independence, and the adjoint period ratio D_E/D_0 are not computed (UNMEASURED). The Birch–Swinnerton-Dyer conjecture itself is OPEN; the paper claims no new mathematics.
Not claimed anywhere in this paper: the Birch–Swinnerton-Dyer conjecture; that any Beilinson–Flach family, Selmer complex or transport of the actual arithmetic satisfies any hypothesis of the rounds; the seven substantive bridges of the closing round’s chain; that the common scalars \(C\), \(q_f\) or the programme’s scalar \(\mathfrak s_{11}\) take any value, or are independent of the partner curve; and the period ratio the calibration needs, which nothing here computes. An instance of an identity on exact random data tests the identity, not the claim that arithmetic objects satisfy its hypotheses.
| Item | Result | Detail |
|---|---|---|
| 1 · claim vocabulary | PASS | all six labels, and PASS kept apart from PASS by cited theorem |
| 2 · not-claimed list | PASS | present, and it names the open problem itself |
| 3 · object specified | review item (not machine-checked) | review: can a reader recompute every figure from what is stated? |
| 4 · numbers trace to logs | PASS | 37/37 traced — 37 to recomputed evidence, 0 only to a quotation of the programme (9 small integers set aside) |
| 5 · instrument can fail | PASS | 692 defects planted, 687 caught by the check named for each; 179 controls; 218 checks |
| 6 · reproduction | PASS | section present; running it is a review step |
| 7 · contributions | PASS | section present; 3 author(s), listed alphabetically, each named in it |
| 8 · attachments | PASS | 109 gate logs; 18 input manifest(s) with SHA-256; public projection linked |
| rule · 4 nothing local | PASS | nothing machine-local or credential-shaped |
Evidence pinned at agent/bsd-verification-zhuiheng @ 6f9c8cc10139ee05f235bf9a22085479c3d2966a · bsd-verification-zhuiheng/
This paper pins its evidence at research-tree commit 6f9c8cc (RUN-109, 2026-10-24), from which the second layer's pages are regenerated, so every figure in it can be seen there, on the pages of the runs it cites; the corrections this version carries are recorded on the pages of RUN-108 and RUN-109.
The three contributions behind this paper are different in kind, and the paper is worth less if they are blurred. They are given here in alphabetical order, the order the author list keeps as data; on the title page the three sit at a round table, with no first and no last.
Aletheia — model: ChatGPT, GPT series — wrote the thirty symbolic rounds this paper checks, in the web session assigned to symbolic derivation: their hypotheses, every boxed identity, and their lists of what they do not prove.
Neo.K set the arrangement in which a web session derives, a local session attacks with computation and an independent line verifies both and supplies the symbolic side with computation, and set the programme’s target at \((389.\mathrm a1, 11)\).
墜衡 (Zhuì Héng) — the independent verification line; model: Claude, Opus series — instantiated every boxed identity in exact arithmetic, measured the weights by reframing, found the false direction of Round 012’s Theorem 19.1 and the two supplements of Round 001, recovered the bookkeeping character from a working pipeline, computed the regulator of 389.a1 from its own canonical heights and closed the rank-two identity, built and drilled the gates, and wrote this paper. The rounds’ algebra is Aletheia’s; nothing in it is this line’s invention.
Priority, stated plainly. No result here is claimed as new mathematics. What is offered as this line’s own is the instantiation of a conditional architecture statement by statement, one correction to it, and the computation that closes the rank-two identity at 389.a1 with every factor computed independently.
SHA256SUMS lists every file's SHA-256.
2eaa2772ff3b38a3…69894c69d345c27b…