Links

Agent-Readable Hyperlink Graph

A machine-readable hyperlink graph of the whole AMRAL site: every page is a node, and its relationships to others — parent/child, previous/next, language mirror, related case — are typed edges. For human readers, this is a second way to browse as the site's content keeps growing past what chronological ordering can scale to; for AI/agents, it's a structured site map that needs no HTML scraping.

Currently 2555 nodes (ZH + EN combined). Structured data: index.json · index.md · .well-known/agent-map

about (1)
actm (15)
bsd (230)
ccm (4)
collatz (81)
cpl (17)
csm (11)
data-access (1)
dmsd (11)
glc-framework (5)
goldbach (41)
lebesgue (132)
legendre (13)
licensing (1)
links (1)
methodology (6)
moser (37)
new-methodology (1)
niot (11)
ns (352)
number-theory (1)
p-np-dual (26)
perfect-cuboid (40)
pps (7)
protocols (2)
rchm-hodge (16)
reconstructions (1)
research-modes (1)
riemann (73)
seven-conjectures (1)
skew-field (15)
validation (2)
wsfc (18)

about · 1

[utility-page] About AMRAL
AMRAL is a replayable research lab for human-led, semi-autonomous, autonomous, and multi-agent mathematical research. Different cases may use different methodologies and protocols; the common requirement is that research status, failure, certification, and validation boundaries must be traceable, falsifiable, revisable, hand-offable, and verifiable.

actm · 15

[case-hub] ACTM: Algebraic Combinatorial Transcendence Methodology
AMRAL case: ACTM (Algebraic Combinatorial Transcendence Methodology) — a methodology plus 34 rounds of research notes that, from round 3, take the Four Exponentials Conjecture as their object and study a hypothetical counterexample (BADT₂) along the Dasgupta–Kakde route; the output is structural restatement, conditional structure theory and barrier theorems about proof strategies; no proof of the Four Exponentials Conjecture, Schanuel's conjecture, or the transcendence of any specific constant.
[document] Algebraic Combinatorial Transcendence Methodology (ACTM)
ACTM is a research programme, not a result; it explicitly claims no proof of Schanuel's conjecture or of any new transcendence theorem.
[document] Exact Freedom and Relation Transport of Algebraic Seeds Under Exponentiation
This is a structural corollary of Lindemann–Weierstrass, used for calibration.
[document] Algebraic Scalars, Logarithmic Lifts, and the Exact Escape Boundary
This round restates the classical Gelfond–Schneider and Baker results and marks the exact boundary of scalar escape.
[document] Exponential Matrices, Multiplier Intersections, and the One-Dimensional Gap of Four Exponentials
R03 states the open target of the Four Exponentials Conjecture precisely; it is an equivalent structural rewrite, not a proved new theorem.
[document] Structural Classification of a Hypothetical MID = 2 State: Projective Orbit Avoidance, Rank Splitting, and an Exact Three-Term Power Chain
R04 is a structural classification of a hypothetical counterexample, entirely conditional on its existence.
[document] Difference-Saturation Graphs, Three-Term Progression Certificates, and the Binary-Tower Survivor
Pure combinatorics reaches a dead end here: the binary tower survives.
[document] Defect Synchronization, Waldschmidt–Masser Criticality, and the Common-Anchor Squaring Tower
BADT is a critical family lying exactly on several known transcendence-theoretic boundaries; this is bookkeeping for a hypothetical state.
[document] An All-Rank Proof of BADT Linear Support Visibility
BADT linear support visibility holds for all normal ranks; this closes one proof strategy, not BADT₂ itself, and not the Four Exponentials Conjecture.
[document] Secant Escape, a Roy-Test Variety, and the Sparse-Support Interface for BADT₂
R17 separates the linear methods from the genuine nonlinear problem and marks what is proved and unproved; it says it does not solve BADT₂.
[document] BK-Fewnomial Incompatibility, a CSEP Correction, and the Auxiliary-Existence Bottleneck
In the real BADT₂ case BK-degree and fewnomial complexity are incompatible; this is a barrier for a proof route and an open erratum of R23.
[document] Extremal Interpolation Approximate Jets, Uniform Height, and Algebraic Degree Escape
R28 constructs an approximate one-jet and shows degree escape; it does not close the AOJBP.
[document] Two-Observable Kummer Orbits, Escape from Exceptional Fibers, and Quadratic Joint-Degree Growth
R31 is the second layer's one rigorous arithmetic gain: the joint degree of the two observables grows at least like Q².
[document] Exact Quadratic Log-Defect Asymptotics, the Taylor–Liouville Barrier, and the Pivot to Multivariate Auxiliaries
A scalar truncated-log Liouville comparison is shown to be underpowered; progress needs multivariate auxiliary functions.
[document] Three-Index Extremal Auxiliary Functions, Exact Zero Saturation, and the Cubic One-More-Zero Barrier
R34 is the current endpoint: an explicit auxiliary saturates the zero budget exactly, but cubic dimension matching alone yields no contradiction; the missing step is the 'one more zero' bridge.

bsd · 230

[case-hub] BSD Conjecture
AMRAL Case: Birch and Swinnerton-Dyer Conjecture (one of the Clay Millennium Prize problems). Does not claim to prove BSD—establishes a curve-level certificate ladder (C0-C10), precisely grading exactly which level each curve and each prime has been proven to. All four sub-lines are online: Phase 0 global enclosure framework, P5 deep technical work on strong BSD for the rank-2 curve 389.a1 at prime p=11 (core comparison still OPEN), Phase 1 reproduction of the Banwait-Huang 2026 algorithmized census (COMPLETE), and Phase 2 construction of the explicit twist family for the non-semistable curve 696.e1, 40/40 COMPLETE, status DERIVED THEOREM CANDIDATE.
[branch-hub] P5: 389.a1 at $p=11$
BSD P5: Study of the strong BSD leading term formula for the rank-2 curve 389.a1 at the single prime p=11. Starting from the architectural definition of the Rank-Uniform Zeta-Primitivity Bridge, through precise finite field computations to close Sha[11^∞]=0, it progressively compresses the problem down to the two bits uGPR11 = P5-INT11 ∧ P5-PRIM11, and then approaches from the angle of anomalous prime localization. Current progress has reached the determinant Kurihara semi-local closure—the core complex leading term/regulator comparison (P5-CPLX-GPR) remains OPEN. Does not claim to prove BSD.
[document] Global Compression and High-Rank Irreducible Frontier of BSD: Rank-Uniform Zeta Primitivity Reduction
The architectural starting point for the entire P5 line: splits BSD into three non-interchangeable propositions: BSD-W (rank equality) / BSD-F (Sha finiteness) / BSD-S (leading term formula), establishes the curve-level certificate ladder C0-C10, proves two methodological no-gos (global quantifier compression is not a proof mechanism; lattice/function limits do not preserve zero multiplicity), defines the Rank-Uniform Global Zeta-Primitivity Bridge (RUGZPB), and proves a conditional theorem: if RUGZPB holds, then full BSD holds. Does not claim to have proven or disproven BSD.
[document] BSD RUGZPB P2/P4 Update: Precise 11-primary Sha closure for 389.a1
Exact finite-field computations for 389.a1 at p=11: Manin-symbol module dimension verification, isolating a one-dimensional plus eigenvector in the Hecke eigenspace, finding the Kurihara witness n=397·991 and showing it is non-zero, and deducing Sha(E/Q)[11^∞]=0 from the Chan-Ho Kim theorem chain. Simultaneously completes the P2 audit (RUGZPB cannot be simply equated to ETNC) and partial P1 audit.
[document] P5 Rank-2 Scalar Collapse and Archimedean Comparison Boundary
Uses the newly closed Sha[11^∞]=0 to compress the P5 target into a real quantity B_∞(E)=[L''(E,1)/2]/[Ω_E·Reg(E)], splitting it into two strictly layered gates: P5-RAT (whether this quantity is rational) and P5-VAL11 (whether the 11-adic valuation is zero). Uses LMFDB numerical values to calculate B_∞(E)≈1.0000000000000000000003, but explicitly marks that this is not a proof, and provides an escape route for denominator-bound rational reconstruction.
[document] P5-E1 — ETNC / Determinant-Line Representation Escape Audit
Tests whether Fouquet's Equivariant Tamagawa Number Conjecture (ETNC) framework can be used to place B_∞(E) into a rational lattice without assuming the classical rank-2 BSD leading term formula. Ruling: NO_DIRECT_ETNC_ESCAPE—the ETNC machinery is very strong for non-derived critical values, but for 389.a1 the central value vanishes to order two at the trivial character, making it a derived specialization. Existing ETNC theorems cannot directly deduce rationality in the absence of an additional derived archimedean comparison theorem. Refines P5-RAT into the more explicit P5-DERPER gate.
[document] Cyclotomic IMC Closure and the Rank-2 Generalized Perrin–Riou Bridge
Uses the Burungale-Castella-Skinner theorem to prove the full cyclotomic Iwasawa Main Conjecture closure for 389.a1 at p=11, and precisely verifies its additional image condition using an explicit unipotent element. Combined with the already closed Sha[11^∞]=0, it closes all the Burns-Kurihara-Sano standard hypotheses. The remaining conceptual obstacles are precisely localized to the rank-2 Generalized Perrin-Riou comparison (P5-GPR11 OPEN) and a finite Bockstein non-vanishing computational gate (P5-BOC-NZ11).
[document] Unit-Level Generalized Perrin–Riou Minimal Gate for $389.a1$ at $p=11$
Uses the published Mazur-Stein-Tate 389A 11-adic regulator computation (R_11≡4 mod 11, nonzero) to close the Bockstein nonzeroness side condition. Proves that the full rank-2 Generalized Perrin-Riou is excessively strong for a single-prime target, defines a weaker unit-level GPR gate uGPR_11, and proves P5-LAT11 ⟺ uGPR11 ⟺ P5-INT11 ∧ P5-PRIM11—precisely compressing the remaining obstacles into two bits:
[document] Explicit Local-Unit Cancellation for $389.a1$ at $p=11$
Precisely calculates every explicitly computable local factor for 389.a1 at p=11 (good prime truncation factor 16/11, bad prime 389 truncation factor 388/389, valuation of the 11-adic logarithm), proving that the combination of the three is exactly an 11-adic unit, with a residue of 4 mod 11. Conclusion: there are no hidden 11-local denominators needing explanation; the remaining obstacle is purely the order-reduction/unit property of the normalized complex scalar itself.
[document] Anomalous Norm Localization for $389.a1$ at $p=11$
Discovered that for 389.a1, 397 and 991 (the two auxiliary primes used to construct the Kurihara witness) happen to also be anomalous primes where 11|#E(F_ℓ), meaning classical non-anomalous Mazur-Tate height theory cannot be directly applied. Switched to using the norm quotient theorem for degree-11 tamely totally ramified local extensions, precisely calculating the localization matrix M_loc and determinant 2∈F₁₁×, proving that the two rank-1 norm obstruction planes are transverse, rigorously establishing the isomorphism between E(Q)/11E(Q) and the local norm quotient, while simultaneously calculating the exact index [E(Q):E^S(Q)]=390830.
[document] Norm-Selmer Core-Vertex Certificate for $389.a1$ at $p=11$
Uses the localized determinant from document 07, combined with Sha(E/Q)[11]=0, to precisely prove that the mod-11 Selmer group is isomorphic to F_11^2. The two norm local conditions each cut down one dimension, and jointly cut it down to zero dimensions — the two anomalous primes 391 and 991 together constitute the complete rank-2 annihilator set of the mod-11 Selmer group. The dimension sequence is 121→11→1 (counted by cardinality).
[document] Determinantal Kurihara–Semilocal Closure for $389.a1$ at $p=11$
The current latest progress of P5. Constructs the finite anomalous norm-Bockstein operator, precisely calculates the rank-2 determinant 2X_397X_991, which falls on the same mixed augmentation direction line as the modular form side initial form 6X_397X_991 (differing by a factor of 3, explicitly not upgraded to a canonical invariant). Cites external inputs from Chan-Ho Kim's semi-local theorem and Castella-Sano's 2026 refined non-vanishing theorem to close three finite rank-2 facts, but formally states that this document does not prove the rank-2 complex leading coefficient formula, nor does it prove the local-to-global Bockstein regulator identification.
[document] An instantiated determinantal fundamental line at $(389.\mathrm{a}1,\ p = 11)$
BSD Conjecture · III · Crystallization: An instantiated determinantal fundamental line at (389.a1, p = 11) — Four nodes of the post-normalization DAG, two findings that cost a factor, and an instrument drilled to fail
[branch-hub] III · Crystallization
BSD Conjecture · III · Crystallization: The papers of this line
[document] Eight proof attacks on the Birch–Swinnerton-Dyer formula at (389.a1, 11), checked: the 11-adic and geometric data they compute, and where each stops
BSD Conjecture · III · Crystallization: Eight proof attacks on the Birch–Swinnerton-Dyer formula at (389.a1, 11), checked: the 11-adic and geometric data they compute, and where each stops — A verified table of explicit invariants of the rank-two curve y² + y = x³ + x² − 2x at the prime 11 — a mod-11 p-adic L-function, formal logarithms of the generators, a local multiplier, a genus-three curve on E × E with its chain, norms and pushforwards, twisted L-values tied to a modular-symbol eigenline, and a circular unit — each recomputed independently, each attack's own statement that it is not a proof kept with it
[document] Paper against code: how a strong-BSD twist census's algorithm changed across three commits, and why one of its branches could never fire
BSD Conjecture · III · Crystallization: Paper against code: how a strong-BSD twist census's algorithm changed across three commits, and why one of its branches could never fire — A reproducibility note on a published computational census, read from its archived diffs and tested on its data: three isogeny rules in three commits with one output frozen at the first, a deleted predicate that nothing in the data fails, the corpus's own specifications held against what was actually produced, and a methodology's freeze conditions applied to the corpus that methodology produced
[document] The Banwait–Huang strong-BSD twist census, recomputed: 40749 base curves, 247391 twist pairs
BSD Conjecture · III · Crystallization: The Banwait–Huang strong-BSD twist census, recomputed: 40749 base curves, 247391 twist pairs — An independent recomputation of a published computational census at full scale — discriminants, conductors by Tate's algorithm, the isogeny filter decided in both directions through modular curves, every twist list rebuilt, the census's own accounting measured term by term — with every disagreement explained and the directions its own checks could not see
[document] Grading evidence for the Birch–Swinnerton-Dyer conjecture curve by curve: an eleven-rung ladder, an audited rejection, and a frontier metric faithful only in exact arithmetic
BSD Conjecture · III · Crystallization: Grading evidence for the Birch–Swinnerton-Dyer conjecture curve by curve: an eleven-rung ladder, an audited rejection, and a frontier metric faithful only in exact arithmetic — A research programme's framework documents, checked: the ladder every later claim is placed on and the five rungs every summary drops, the programme's rejection of its author's own route and why that route fails at infinite precision, a global frontier quantity whose faithfulness survives in the rationals and not in floating point, and the programme's maps scored after sixty-four rounds
[document] A determinantal normalization architecture for the Birch–Swinnerton-Dyer leading term at (389.a1, 11): thirty symbolic rounds, every boxed identity instantiated in exact arithmetic
BSD Conjecture · III · Crystallization: A determinantal normalization architecture for the Birch–Swinnerton-Dyer leading term at (389.a1, 11): thirty symbolic rounds, every boxed identity instantiated in exact arithmetic — 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
[document] An explicit quadratic-twist family of the non-semistable curve 696.e1: a density of 1/24 by three routes, an arithmetic certificate, the isogeny and image questions settled, and a derived theorem candidate checked against its own router
BSD Conjecture · III · Crystallization: An explicit quadratic-twist family of the non-semistable curve 696.e1: a density of 1/24 by three routes, an arithmetic certificate, the isogeny and image questions settled, and a derived theorem candidate checked against its own router — A research programme's family for strong Birch–Swinnerton-Dyer beyond the semistable reach of a published method, recomputed: the anchor, the density and why it is not 1/48, a certificate of twenty quantities rebuilt from the curve's a-invariants, all twelve of Mazur's degrees, mod-ℓ images at 38 primes, the odd additive barrier, and the candidate theorem stated against the revised router that every prime is sent through
[document] Compiling the Fouquet–Wan hypotheses for a quadratic-twist family of 696.e1: one witness, a uniform certificate false at one prime, an obstruction that does not stop, and a twisting prime where H2 fails
BSD Conjecture · III · Crystallization: Compiling the Fouquet–Wan hypotheses for a quadratic-twist family of 696.e1: one witness, a uniform certificate false at one prime, an obstruction that does not stop, and a twisting prime where H2 fails — A research programme's plan to prove strong BSD for infinitely many quadratic twists, checked hypothesis by hypothesis: the witness lemmas and the empty set they do not survive, membership conditions that turn out to be load-bearing, a boxed certificate refuted at p = 29 and the same argument true one quantifier over, the ordinary obstruction measured to 6000, the corpus disagreeing with itself about H3, and member 3529, where the provisional design fails at its own twisting prime
[document] The semilocal Kurihara arithmetic of 389.a1 at p = 11, recomputed
BSD Conjecture · III · Crystallization: The semilocal Kurihara arithmetic of 389.a1 at p = 11, recomputed — What is canonical and what is a choice: a localization determinant, a local unit, a Kurihara number and a Bockstein determinant, each computed from the group law or from modular symbols built here
[document] Closing a normalization certificate against actual objects
BSD Conjecture · III · Crystallization: Closing a normalization certificate against actual objects — The ten items of a determinantal comparison at (389.a1, p = 11), judged one by one, and the method that judges them
[document] Calibrating a rank-two curve against a rank-zero one at the prime 11, reproduced: the calibrator 19.a1 rebuilt over the rationals, its plus period aligned to Néron's, and a relative regulator germ recomputed to degree 120
BSD Conjecture · III · Crystallization: Calibrating a rank-two curve against a rank-zero one at the prime 11, reproduced: the calibrator 19.a1 rebuilt over the rationals, its plus period aligned to Néron's, and a relative regulator germ recomputed to degree 120 — A reproduction note on a cross-curve period calibration built by a separate local verification session: every modular symbol, measure, series and cup pairing of it recomputed with independent code, and the archimedean alignment of its plus period, which it left undone, supplied
[branch-hub] Phase 0:Global Enclosure
BSD Global Enclosure Phase 0: Does not claim to prove BSD, nor does it treat LMFDB numerical agreement as proof. Splits weak BSD, Sha finiteness, and the strong BSD leading term formula; establishes the known theorem closure map and curve-level certificate ladder (C0-C10); audits external routes, determining Strong-BSD Twist-Family Reproduction as the top choice; audits and rejects Neo.K's old draft
[document] Global Enclosure Consensus Adjudication: BSD is worth entering Phase 1
BSD Global Enclosure consensus ruling. Ruling GO, entering Phase 1, but not treating
[document] BSD Proposition, Quantifier, and Exception Faithfulness Audit
The BSD proposition is broken down into three claims that cannot be conflated — weak form (rank equality), finiteness (Sha is finite), and leading term formula. Full BSD over ℚ is a universal proposition ∀E/ℚ, and the unit of exception is a concrete curve; any
[document] Known Theorem Closure Map
Answers layer by layer
[document] BSD Certificate Ladder: C0 to C10
Core principle: each curve must not just store a boolean
[document] External Research Route Matrix
A comparison table of the strongest natural outputs, cumulativity, common bottlenecks, and Phase 1 verdicts for ten possible routes. Strong-BSD twist families are the top choice; p-adic Iwasawa, p-converse, and exact computational BSD are green lights; Neo's own old
[document] Audit of Neo.K's Old "Lattice Rank Convergence" Route
Item-by-item deconstruction of the logic chain in Neo.K's old draft: latticizing elliptic curves, taking a→0, and claiming continuity guarantees the equality holds. The audit points out at least two layers of circularity risk — if the proof of the lattice BSD inequality itself already uses classical BSD-type connections, it is circular; rank is an integer-valued global arithmetic invariant and will not automatically converge as a→0; the order of vanishing is discontinuous under infinitesimal perturbations;
[document] Phase 1 Agent Experiment Specifications: Certificate Atlas + Twist-Family Reproduction
Experimental specifications for Certificate Atlas + Strong-BSD Twist-Family Reproduction. The goal is not to compute a BSD ratio for millions of curves, but to generate theorem-applicability, certificate levels, and unclosed items for every isogeny class in the complete finite domain (N_E<500,000). The first rank-2 sample is 389.a1, and the first family reproduction is reproducing the Banwait–Huang 2026 algorithm. The success conditions explicitly do not require a new BSD theorem.
[document] BSD Certificate Globalizer
Establishes a research control metric that will not swallow a single uncertified curve just because
[document] Local Multi-Agent Handoff Prompts
Splits Phase 1 among six roles: Agent A Proposition Auditor (builds theorem dependency DAG), Agent B Banwait–Huang Reproducer (fields that cannot be exactly determined are marked unknown, no guessing allowed), Agent C Certificate Schema Engineer, Agent D Rank-2 Wall Analyst (centered on 389.a1), Agent E Adversarial Referee (can only output PASS/FAIL/OPEN), and Agent F Internal Theory Isolator (audits Neo.K's old lattice drafts, forbidding the introduction of internal axioms into the external main proof).
[branch-hub] Phase 1: Banwait–Huang Reproduction
BSD Phase 1: Reproducing Banwait-Huang 2026 (arXiv:2601.16044) algorithmised rank-0 twist-family census. 25/25 COMPLETE. Ruling PASS (route is engineerable); the first batch of small-scale reproduction perfectly matches the official fixture; v0.3 uses a precise one-commit diff to complete the first-failure closure of 13 removed curves; v0.4 amplifies the effect to a 500K full-scale measurement (4062/40749 curves removed); v0.5 exact census global accounting identity exact PASS; v0.6 uses exact replay to correct an earlier guess—Algorithm 2's expand mechanism was never triggered in the real data domain, and the stable domain is a pure monotonic reduction—formally capping off, declaring Banwait–Huang Reproduction = COMPLETE, and proposing three concrete routes for Phase 2. Does not claim to prove BSD.
[document] Phase 1 Consensus Adjudication: PASS, Banwait–Huang route is engineerable
Adjudication: PASS, the Banwait-Huang route is engineerable. Splits the theorem hypotheses into four layers: base curve eligibility, twist parameter eligibility, independent BSD(E,2) verification, and branch-specific Chebotarev conditions. First minimal reproduction: the CLZ20 and Zha16 branches are completely consistent with the official fixtures within a small range. Explicitly states that this is not a BSD proof, just admissible according to theorem criteria.
[document] Theorem 2.18 Condition Map
Lists point by point the seven eligibility conditions for the base curve (E1-E7: semistable, small prime trace, no rational isogeny, ramification, optimality, analytic rank zero, BSD(E,2)), the respective conditions for the two 2-torsion branches (8a/8b), and the common and branch-specific conditions for twist d. Explicitly states that the output semantics is a one-way implication: admissible ⟹ BSD is deduced from cited theorems; not admissible does not imply BSD is false.
[document] Paper Pseudocode and Current Official Code Audit
Audits the gap between the official GitHub implementation and the paper's pseudocode. Conclusion: the official program does not blindly copy the paper, but incorporates certificate strength corrections to prevent overclaiming—distinguishing the difference between Sha[2] dimension and ord_2(Sha), treating the analytic Sha value only as a descent gate input without masquerading as the actual group order, explicitly marking testing-only flags, and requiring full reproducibility metadata locks such as paper version/repository commit/Sage version/LMFDB release.
[document] Algorithm 2 Independent Reproduction
Establishes a mirror relying only on the Python standard library, replaying squarefree/gcd/a_p/finite-field point count/2-adic valuation/quadratic splitting/cubic 2-division inertness/sign condition. 46a1 gets exactly the same 7 twists as the official, 106d1 gets exactly the same 21 twists as the official, exact list match. Explicitly marks that the inertness determination uses the simplification of cubic reduction mod p; formal certificates should use the Sage number-field backend as the authority.
[document] Algorithm 1's Execution Environment and Missing Items
Honestly records the environment required to completely rerun Algorithm 1 (SageMath, local LMFDB PostgreSQL, PARI 2-descent, mwrank, etc.) and the items explicitly not completed in this round—cannot connect to local LMFDB, did not run Sage, did not run 2-descent, and did not independently prove the official 36,687 curve count. Lists the completed alternative work and provides the minimum environment testing plan for Phase 1 v0.2: first perform a small-sample sanity check on conductor<150, and only allow proceeding to 500K after consistency is achieved.
[document] Global Enclosure and Stop Rules: Even if this route is completely successful, what can it prove?
Even if Banwait-Huang Algorithm 1 is completely successful, it only proves that
[document] Local Agent Handoff
Splits Phase 1 v0.2 among six roles: Agent A Sage environment builder, Agent B Algorithm 1 reproducer (saving row counts filter by filter), Agent C 2-Descent referee (forbidding treating dim Sha[2] as ord_2(Sha)), Agent D Algorithm 2 cross-checker, Agent E paper/code version auditor, Agent F global bounding referee (only answering whether theorem coverage is expanded each round; if only enumeration volume is increased, it stops after three consecutive rounds).
[document] Phase 1 v0.2 Consensus Verdict
Phase 1 small sample upgraded from
[document] Small-Sample Version Regression: 25 → 12
Old fixture (2026-05-22) 25 curves (10 CLZ20 + 15 Zha16), current fixture (2026-06-03) 12 curves (7 CLZ20 + 5 Zha16). exact diff: kept 12, removed 13, added 0. Lists the labels of the 13 removed curves. Explicitly states that one must not over-interpret — before a filter-by-filter replay, they are uniformly tagged VERSION_REGRESSION_REMOVED / reason = OPEN, and mathematical reasons cannot be filled in via intuition, branch distribution, or commit messages.
[document] Official Discrepancy Corpus
The official repository explains the current Algorithm 1 rejection reasons predicate by predicate for four curves (62a1, 66b1, 105a1, 141c1)—all four jointly pass all other gates, but individually fail on four specific predicates: ord_2 L^alg value, 2-torsion structure, rational square condition, and non-emptiness of the S set. Positioned as an adversarial regression corpus for the theorem-router: if a future version suddenly accepts these four, the first label should be REGRESSION?, not NEW BSD BREAKTHROUGH!
[document] Algorithm 1 Soundness Gates
Formally encodes previously scattered disciplines into six soundness gates: S1 analytic Sha must not masquerade as actual Sha; S2 dim Sha[2] must not masquerade as ord_2(#Sha); S3 timeout is UNKNOWN, not a theorem failure; S4 once a testing flag is enabled, the entire run certificate is automatically downgraded; S5 non-emptiness of the S set uses a deterministic criterion, not a bounded search; S6 every PASS must preserve complete provenance (predicate/value/evidence_type/backend/semantic_version/file SHA/timestamp).
[document] 500K Preflight
The five-step checklist before scaling up to the full conductor<500000 rerun: lock Sage/LMFDB/Git SHA/descent backend, exact replay of conductor<150, first-failure replay of the 13 old-version curves, and exact rejection replay of the four discrepancy curves, before the 500K can be run. The 500K run must output seven machine-readable artifacts, and unknown.csv must not be discarded. The success criterion is not
[document] Agent Regression Protocol
Before modifying the theorem router, each Agent must run three layers of tests (current 12 positive fixtures, 13 historical regressions, 4 official discrepancies), defining a unified JSON output format. Four cognitive firewalls: analytic Sha=1 does not equal Sha trivial; rank=0 does not automatically equal rigorous analytic rank 0; 2-descent dimension being numerically equal to the analytic valuation does not automatically equal BSD(E,2) proven; timeout must be UNKNOWN. Pure engineering changes (runtime/cache/batching/formatting) are marked ENGINEERING ONLY and do not count as mathematical progress on BSD.
[document] Semantic Version Changelog
Theorem-producing code must additionally save a
[document] One-Commit Semantic Autopsy
The old fixture commit and the current commit differ by exactly one commit. Dissecting the mathematical semantics of this single commit line by line: Algorithm 1 changed the conditional exclusion set A_old to an unconditional {3,5,7} and added the a3≠±3 condition, which is a substantive tightening of the theorem predicate, not a performance refactoring. Algorithm 2 simultaneously tightened the gcd condition and removed the old twist-side disc_valuation_condition — shrink and expand mechanisms coexist within the same commit, so it cannot be summarized in the single direction of
[document] Removed 13 First-Failure Closure
Directly answers the 25→12 fixture regression problem left by yesterday's Document 08: v0.3 uses an exact one-commit diff, official old/current fixture mapping, LMFDB/Cremona data, and an exact finite-field count to complete the first-failure closure of the 13 removed curves. Histogram: 9× P_ISOGENY_3, 2× P_ISOGENY_5, 1× P_ISOGENY_7, 1× A3_ABS_3. 26b1 has a secondary a_3=-3, but the production pipeline runs the strict isogeny gate first, so the first failure is recorded as P_ISOGENY_7. Conclusion: all 13 curves are explained by the new Algorithm 1 criteria; it is no longer a black-box version drift.
[document] Algorithm 2 Twist Semantic Diff
Document 14 discovered that within the same commit, Algorithm 2 tightened gcd(M,N)=1→gcd(M,3N)=1, yet removed the old twist-side disc-valuation condition. This document proves that the fixture for the existing 12 base curves (old/current twists_of_ec_labels_150.json) is a complete exact match, meaning it only verifies that
[document] Phase 1 Gate v0.3
The v0.3 convergence document: formally divides the Phase 1 <150 regression into four layers—A. The current 12 positive base fixtures must PASS; B. The old 13 historical removed fixtures must explicitly FAIL on the now-converged predicate map, and simply returning not-in-final-output is no longer allowed; C. The official 4 discrepancy corpus curves must continue to be rejected for theorem-level reasons; D. Algorithm 2 semantic unit tests (TWIST_GCD_3N, TWIST_DISC_VAL_GATE_REMOVED) must be tested directly even if the 12 positive twist outputs haven't changed at all. Only if A+B+C+D all pass can the 500K results be labeled REPRODUCTION-QUALIFIED; otherwise, they can at most be labeled OUTPUT-MATCHED, and the two labels must not be mixed.
[document] 500K One-Commit Global Impact
Amplifies the
[document] Delta-Only Algorithm1 Verifier
Engineering efficiency strategy: since old→current is only one commit, and the Algorithm 1 theorem predicate diff has no other loosen/tighten gates, there is no need to rerun all the old filters like L-value merge, 2-descent, E' descent, and S sets—one only needs to check the new strict isogeny gate and a3 gate curve by curve on the old accepted set, making it an incremental proof replay. Defines the success gate: input 40,749 curves, expected PASS=36,687, FAIL=4,062, and output the full failure histogram. Equally important is the failure significance paragraph: if the delta-only verifier cannot reconstruct the official current set, it means one of five possibilities exists, such as a missed semantic difference; at this point, one should stop and not proceed directly into a full replay.
[document] 500K Twist Output Non-Monotonicity
Amplifies the Algorithm 2 semantic split from document 16 to a 500K-scale measurement: the same commit caused twists_of_ec_labels_500k.json to generate a diff of +1899/-53404 lines, far exceeding the scale that could be explained purely by base curves being removed, proving that the Algorithm 2 semantic changes were indeed triggered in the large-scale data domain. However, the document simultaneously points out rigorously: git diff line counts do not equal the proven unique twist count (JSON contains structural lines like keys/brackets/commas); a complete entry-level census requires materialising the old/current JSONs and then parsing the set difference. For the 12 curves currently <150, the small fixture observed 0 output deltas—this is exactly why v0.3 must add synthetic tests, and v0.4 requires a full-file entry census.
[document] Phase 1 Next Lowest-Cost Gate
The concluding document of v0.4, defining a three-stage lowest-cost strategy: Gate A (delta-only base verifier, 40,749→36,687), Gate B (twist JSON parser diff, materializing the old/current full JSON, categorizing into six types: removed base keys/stable keys/gcd-only removed/disc-gate-only added/both-effect), and Gate C (only if both A and B match the official output are all the expensive Sage descents rerun). Core rationale: the official runtime of the full Algorithm 1 itself only takes a dozen minutes and is not expensive; what is truly expensive is the rework caused by research semantic errors—the delta-first strategy confirms that the same theorem version is understood before investing in full proof-engineering.
[document] v0.5 Exact Census Report
The precise report of the complete execution of Gate A + Gate B from the three-stage strategy in document 21. First discovers a provenance detail: the OLD twist JSON is actually older than the OLD base file, with 1355 curves lacking corresponding twist entries. Core results: base curves old=40749/new=36687/removed=4062/added=0; Algorithm 1 failure classification ISOGENY_ONLY=1353, A3_ONLY=2707, BOTH=2, UNEXPLAINED=0; stable-domain Algorithm 2 is a pure reduction of removed=21306/added=0; curve-level UNCHANGED=31250, SHRINK_ONLY=5437, EXPAND_ONLY=0, MIXED=0; global twist accounting identity 46091=46091 exact PASS. All 26 completion gates are true. Conclusion: this is a precise archived output census of theory-generated computation, not an end-to-end re-execution of every OLD curve, nor a proof of the BSD conjecture for all elliptic curves.
[document] Fresh Algorithm2 Semantic Replay
Tracing from the generator commit 7286794 back to OLD (1a0489) and then to CURRENT (31fae2) across three semantic nodes, performing a complete replay on all 39,394 generator curves and 293,482 twist pairs. Key correction: previously, it was inferred from the source diff that Algorithm 2 might simultaneously have both shrink and expand directions; now, exact replay proves that the expand mechanism was not triggered in this actual data domain. The precise 2x2 gate partition table matches cell by cell, and the OLD→CURRENT delta in the stable domain is entirely attributed to the new gcd(d,3N)=1 condition, with 0 mismatch. All observed semantic changes fall into the Zha16 branch, with the CLZ20 branch delta being zero. Recommends capping off Phase 1 reproduction in v0.6.
[document] Phase 1 Closure and Phase 2 Interface
The formal capstone document of Phase 1. It lists eight completed tasks (Theorem 2.18 predicate map, Algorithm 2 independent reproduction, paper/current-code soundness audit, <150 version regression, first-failure closure of 13 removed curves, 500K exact artifact census, closure of removal reasons for 4062 Algorithm 1 curves, stable-domain OLD→CURRENT Algorithm 2 semantic replay), declaring Banwait–Huang Reproduction = COMPLETE. It honestly explains that reconstructing the 1,355 historical curves has low marginal benefit for BSD itself, unless the purpose pivots to a repository history paper or proof-engineering case study. It proposes three concrete routes for Phase 2: Route A high-rank wall atlas, Route B strong-BSD coverage expansion (which may generate new external mathematical results), and Route C 2-primary unsolved frontier—this is the most natural new mathematical interface left by Phase 1.
[branch-hub] Phase 2: Non-Semistable Families
BSD Phase 2: Constructing explicit strong-BSD twist families for non-semistable curves not covered by the Banwait-Huang method. The core tool is compiling Fouquet-Wan's arbitrary-reduction odd-p hypotheses into finite, replayable predicates. 40/40 COMPLETE. The true total is 40 (29 mainline documents + 11 Witness-Network/FW_H2 auxiliary branch documents), corrected from the originally estimated 33. The mainline concludes with
[document] Phase 2 Global Enclosure Consensus
The opening adjudication document for Phase 2. It first cuts three candidate main lines: higher 2-power descent (HOLD/TOOLBOX ONLY, no curves with positive v2(Sha) in the frontier), full rational 2-torsion (HOLD, lacks a general strong-BSD family theorem), and analytic rank 1 (YELLOW, (Im) condition is difficult to determine algorithmically). The one ruled GO is the Fouquet-Wan Hypothesis Compiler: whether FW's odd-p hypotheses can be compiled into finite, replayable base-curve-level predicates, allowing Banwait-Huang's 2-part twist family and the odd-p full-BSD closure to be spliced back together. The largest unclosed quantifier is ∀p>2; one cannot bait-and-switch to full BSD just because most p are good or p≤B are good; a finite exceptional-prime reduction must be found.
[document] Phase 2 Route Matrix
A complete comparison table of eight candidate routes (natural output/global gain/main barrier/verdict): higher 2-power descent, non-semistable + existing odd-p patchwork, Fouquet-Wan arbitrary reduction (PRIMARY GO), BCS ordinary non-semistable, full rational 2-torsion, analytic rank 1, prime conductor, high rank 2+. Main ranking: FW non-semistable compiler > full 2-torsion > rank 1 > higher 2-descent—the document explicitly states that this is a ranking of
[document] Fouquet–Wan Hypothesis Compiler
Formally turns Fouquet-Wan's
[document] Quadratic-Twist Invariance Bridge
The Fouquet-Wan theorem speaks to a single (E_d,p), while Banwait-Huang requires
[document] Finite Exceptional Prime Problem
Directly dismantles the
[document] Non-Semistable Family Theorem Schema
The v0.1 concluding document, explicitly stating
[document] Phase 2 First Agent Experiment
Seven-step experimental design FW-Hypothesis-Compiler/Weight-2 Elliptic Curves. Step 1 only picks 60 curves (20 semistable known to pass + 20 non-semistable rank-0 + 20 deliberate bad/control groups), solely for compiler correctness, not for statistics. Steps 3/4 assign independent Agents to perform symbolic derivation for H2 and H3 respectively; H3 explicitly requires outputting one of three choices: exact equivalence/strict implication/not equivalent, and must not default to being identical to the Banwait criterion. Step 7 finally scans the 895,988 database curves, and UNKNOWN must not be swallowed. The success Gate explicitly states that v0.1 does not need to find new curves, as long as the H2/H3 exact specialisation + twist-invariance lemmas + finite-prime reduction for at least one nontrivial curve class are completed.
[document] Stopping Rules and Claim Ladder
The v0.1 concluding document, defining Phase 2's own seven-level certificate ladder: C0 literature map, C1 hypothesis compiler, C2 fixed (E,p) certificate, C3 twist-uniform fixed p, C4 finite exceptional prime reduction, C5 all odd primes, C6 complete strong-BSD twist family. Prohibited upgrade list: testing p<1000 does not equal C4/C5; 99.9% of primes does not equal C5; residual image
[document] FW Theorem 1.7:Weight-2 Exact Translation
Opening of v0.2, marking the exact moment the
[document] FW-H3 Exact Elliptic-Curve Compiler
Defines W_-(E) as the set of all ℓ∥N where E has nonsplit multiplicative reduction, giving the precise criterion for FW-H3(E,p). The core result is a uniform certificate: if W_-(E) is non-empty and the gcd of all witness valuations g_-(E)=2^a (no odd prime simultaneously divides all witness valuations), then for all p>2, FW-H3(E,p)=PASS—requiring only a finite base certificate to close the quantifier of this hypothesis for all odd primes at once. This is the first concrete case in this series where ∀p>2 is truly compressed into a finite check. It simultaneously reiterates twist-family preservation: if every ℓ∣N splits in the twist field, the same H3 witness is preserved along the entire family.
[document] FW-H2 Compiler and Ordinary Obstruction
Checks FW-H2 by reduction type. Good supersingular: the residual local representation is controlled by niveau-2 fundamental characters, automatically irreducible, FW-H1/H2 automatically PASS, and FW only has H3 left to handle. Good ordinary: derives a cheap exact criterion, where H2 failure is exactly equivalent to a_p(E)²≡1(mod p); however, the document makes a key strategic decision — because there is no clean finite-exception theorem to exclude all primes satisfying this congruence, ordinary primes should not take the FW route, but should continue using the existing ordinary theorem, leaving FW for additive + supersingular. The local semisimplification of potentially multiplicative inherently falls into the FW-H2 forbidden type, so it also does not take FW.
[document] Derived Supersingular FW Bridge
The milestone high point of v0.2, marked as
[document] Hybrid Odd-Prime Router
The integration document for v0.2: a complete strong-BSD family does not require a single theorem to cover all p. It splits the odd primes into six routing categories from P0 (p=2, Theorem 2.14) to P5 (good supersingular, derived FW bridge), assigning the most suitable existing tool to each—P2 good ordinary explicitly does not use FW, while P4 fixed additive and P5 good supersingular do use FW. Result: ∀p>2 is broken down into four pieces: finite bad-prime table + support-prime restrictions + ordinary theorem + supersingular uniform certificate. The document calls this the only viable global quantifier compression.
[document] Candidate Non-Semistable Strong-BSD Family Schema v0.2
The wrap-up document for v0.2, self-stating right at the beginning:
[document] Candidate Sieve: Why did 696.e1 emerge?
Opening of v0.3, curve 696.e1=[0,1,0,8,-16] appears for the first time. Switches to a cheap-then-expensive filtering order, avoiding expensive local Galois analysis on every curve upfront. 696.e1: rank 0, torsion trivial, optimal, Manin 1, conductor 696, Sha_an=1, Tamagawa 1, L^alg(E,1)=1 holds exactly, falling into the Theorem 2.14 branch; odd prime bad reduction at 3 (split mult), 29 (nonsplit mult), W_mult^odd={3,29}, W_-={29}, all relevant gcds are 1; LMFDB records maximal image for all primes, extremely clean. Simultaneously provides a crucial control group: 116.b1 has beautiful conditions across the board, yet because it only has one odd multiplicative reservoir (29) and lacks a second witness, it is eliminated in the fixed multiplicative check—precisely pointing out that the real key to 696.e1 is not
[document] 696.e1 Base Certificate
Complete base data for 696.e1: y²=x³+x²+8x-16, N=696=2³·3·29, Δ_min=-2¹¹·3·29<0, torsion trivial, rank 0, optimal, Manin constant 1. Because conductor 696<5000 and analytic rank 0, it directly inherits the existing results cited by Banwait-Huang—full BSD(E) has been strictly verified for this range, including BSD(E,2), explicitly not using the circular inference that
[document] 696.e1 Chebotarev Support Family
Defines the prime family P={q: q≡1(mod24), (q/29)=1, f_2 mod q irreducible}, proving that this set of congruence conditions precisely makes all conductor primes 2, 3, and 29 split in Q(√q). Uses the fiber-product Galois group to calculate the exact Chebotarev density 2/48=1/24. Proves that curves with q∈P are automatically good ordinary (not supersingular, otherwise contradicting the Hasse bound). Gives the first concretely verified twist parameter d=241, including the direct point count a_241(E)=-7.
[document] 696.e1 All-Prime Router
Concretely applies the abstract routing table of document 12 to E_q (the twist family of 696.e1). All four cases are verified: Case A (p=q, additive, witness ℓ=29 is valid), Case B (good ordinary, p≠3, 29, also using 29 as the witness), Case C (fixed multiplicative p=3 or 29, using each other as mutual witnesses), Case D (good supersingular — the branch where semistability was originally truly stuck, FW-H1/H2/H3 all verified and passed). Honestly handles the period/Manin issue: a good supersingular p is a good-reduction prime, so there is no p-adic Manin contribution. The Exhaustion section at the end proves that odd primes can only fall into these four categories, and the prime router has not missed any branches.
[document] Provisional Derived Family Theorem
The conclusion of v0.3, formally writing out the candidate theorem statement for the first time: for the prime family P (natural density 1/24), ∀q∈P, BSD(E_q) holds, where E_q is the quadratic twist of 696.e1. It lists 11 CLOSED segments (density, splitting conditions, 2-division inertness, each prime branch, exhaustive partition), and 5 NEEDS INDEPENDENT REFEREE AUDIT items (correspondence between FW representation and elliptic curve E[p] conventions, period normalization, isogeny/optimality phrasing, citation chain accuracy, novelty search). It explicitly states that it should currently be called a Provisional Derived Theorem, not an Established New Theorem—the reason is not that obvious mathematical gaps are still seen, but that it has entered the stage requiring independent referees to check citations and conventions line by line.
[document] Independent Referee / Local Agent Handoff
The final document of v0.3, with the goal explicitly written as
[document] Adversarial Referee Verdict
Opening of v0.4, the actual verdicts of the six referees from document 19. The main proof router of v0.3 was not killed, but a citation error was indeed caught: Miller's result is for
[document] Base BSD Anchor Repair
The actual repair of the citation error ruled in document 20. The Miller result cited by Banwait-Huang is
[document] Odd Prime Source Audit
The actual audit results of Referee B, tracing the four branches of document 17 one by one back to named theorem sources. p=q additive: Banwait-Huang Proposition 2.9 Item 1 reduces to BSTW Theorem 9.21(c), which PASSes after item-by-item verification for 696.e1. good ordinary p: directly uses Skinner Theorem C, witness ℓ=29, PASS. multiplicative p=3, p=29: Skinner Theorem C explicitly writes p≥3, taking each other as the witness respectively, PASS. Provides an important simplification: because the mod-ℓ image of the base curve is maximal for all ℓ, and the quadratic twist only tensors a scalar character, irreducibility is automatically preserved, so the ordinary branch no longer needs to be split into reducible/irreducible subcases.
[document] Fouquet–Wan Supersingular Source Audit
The actual audit results from Referee C, re-verifying FW-H1/H2/H3 for any odd good supersingular prime p of E_q, this time directly checking against the normalization in the original FW paper without guessing. The reasons for H1 and H2 PASS are consistent with before. The audit of H3 is the most meticulous: instead of guessing the representation normalization, it finds the explicit definition of Assumption 3 in the original text near FW Theorem 1.1—the local automorphic representation is special Steinberg, and the twist by an unramified character maps ℓ to (-1)ℓ^(k/2-1). When weight k=2, this value is exactly equal to -1, corresponding to a_ℓ=-1 for the elliptic curve newform, i.e., nonsplit multiplicative—this is exactly the actual state of 696.e1 at 29, and the verification passes. The period issue is explicitly left for the next audit.
[document] Manin / Period Audit
The actual audit by Referee D, resolving the period issue left by document 23. Citing modern results: the Manin constant of an optimal parametrization can only be supported by additive reduction primes. For E_q, the additive primes are exactly 2 and the twist prime q, while FW is only used at good supersingular p, so p∉{2,q} and p∤c_{E_q}—the modular period and Néron period are identical in p-adic valuation. Incidentally handles optimality: the mod-ℓ image of the base 696.e1 is maximal for all ℓ, and the twist preserves irreducibility, hence E_q has no rational prime-degree isogeny, its Q-isogeny class has no other non-isomorphic curve, and E_q itself is the optimal representative. The period argument does not rely on arbitrarily picking an isogenous model.
[document] Chebotarev Referee Audit
Referee E's independent recalculation, doing a complete Chebotarev computation from scratch without looking at the original derivation in Document 16. The discriminant of f_2 is -11136=-2^7·3·29, Galois group S3, unique quadratic subfield F0=Q(√-174); K=Q(ζ24,√29), [K:Q]=16; from √-174=√-6·√29 and Q(√-6)⊂Q(ζ24) we get F0⊂K, hence L∩K=F0, [LK:Q]=48; the support condition is
[document] Novelty Search Log
Handles the novelty gate that Documents 18 and 20 have consistently marked as an independent unchecked item. Exact searches (696b1, 696.e1, exact equation, with Fouquet Wan) found no corresponding BSD quadratic-twist family on arXiv. Broad searches (non-semistable full BSD quadratic twist family, etc.) found related but not completely overlapping existing results. The core conclusion is boxed: NO HIT ≠ NOVELTY PROOF—failing to find it does not equal proving originality. Before formally claiming priority/new theorem, it lists four tasks still to be done: citation chain tracking on MathSciNet/zbMATH/Google Scholar, searching papers citing Fouquet-Wan, asking a number theorist referee to check if it is just a direct corollary of some general theorem, and checking the latest 2026 preprints.
[document] Revised Derived Theorem Candidate
The final theorem statement after all audits are completed: for the prime family P of density 1/24, ∀q∈P, BSD(E^(q)) holds. Attached is the complete proof router table: p=2 uses Banwait-Huang Theorem 2.14+Creutz-Miller; p=q uses BSTW Theorem 9.21(c)+witness 29; odd good ordinary, p=3, and p=29 all use Skinner Theorem C, each paired with the corresponding witness; odd good supersingular uses Fouquet-Wan Theorem 1.7+Corollary 1.10, witness 29. All primes are exhaustively covered. The claim label is currently DERIVED THEOREM CANDIDATE; if the novelty/citation referee passes, it can advance to PREPRINT CANDIDATE. Whether to call it a
[document] Submission / Publication Gate
The final concluding document for the main line 00-28, all 29 pieces. Before formally writing the theorem paper, five items must still be passed: independent expert referees reproducing all source mapping, checking the latest versions/publication status of BSTW and Fouquet-Wan, a MathSciNet/zbMATH/Scholar novelty sweep, producing a machine-verifiable arithmetic certificate for 696.e1, and rewriting proofs to not rely on LMFDB prose descriptions when precise sources/computations are available. Suggested paper framing: do not start by writing
[document] An Explicit Non-Semistable Quadratic-Twist Family Satisfying the Strong BSD Conjecture
A complete formal paper draft credited to Neo.K, writing the entire argument accumulated in documents 00-28 into a theorem note with numbered Lemmas/Propositions/full proofs and real literature citations. Theorem 1.1: For the prime family P with density 1/24, ∀q∈P, BSD(E^(q)) holds. Six lemmas individually handle support prime properties, density, 2-part, additive twist primes, good ordinary, fixed multiplicative, and good supersingular. The appendix provides exact finite certificates that can be independently reproduced in SageMath/Magma. Section 8 reports a real numerical check: finding 27,667 support primes within q<10^7, compared to π(10^7)=664,579, yielding an empirical ratio of 0.041631 versus the theoretical density of 1/24≈0.041667 — explicitly stating this is merely a sanity check and not part of the proof. The ending poses a clearly unaddressed algorithmic extension problem.
[document] A Two-Witness Criterion for Strong BSD in Positive-Density Non-Semistable Quadratic-Twist Families
Formally abstracts the proof for the single curve 696.e1 from document 29 into a reusable sufficient criterion. Definition 2.1 provides seven
[document] A Finite-Exception Witness-Network Criterion for Strong BSD in Non-Semistable Quadratic-Twist Families
Completes the two generalization directions pointed out at the end of document 30 all at once. Replaces the valuation-one witness with gcd(g_mult, g_-), proving that odd prime factors will not reject the entire curve, but will only generate a finite exceptional prime table R_mult∪R_-. Explicitly states that this is strictly stronger than the old condition of
[document] GCD Witness Lemmas
A streamlined working draft version of Section 2 from document 31, compressing the algebraic core of the gcd witness into three quick-reference lemmas: generic witness (if an odd prime p does not divide the gcd of the multiplicative witness set, a valid witness exists), fixed multiplicative prime (when p itself is multiplicative, the witness must be a distinct prime, which is a finite leave-one-out check), and nonsplit FW witness (the same gcd lemma holds when restricted to nonsplit multiplicative primes). A single concluding sentence points out the algebraic essence of the entire mechanism: this is exactly the precise algebraic reason why the all-prime witness problem becomes finite.
[document] Odd Additive Period Barrier
A concise explanation of why
[document] Next Compiler Targets
Witness-Network v0.2 concludes, handing the baton directly to the next suite, FW_H2_Local_Isogeny_Compiler. It lists four priorities: 1. Additive FW-H2 compiler (inputs p/Kodaira type/potential reduction/local residual representation, outputs three states PASS/FAIL/UNKNOWN, must be made exact before database expansion); 2. Period compiler (outputs PERIOD_SAFE/UNKNOWN); 3. Ordinary finite exception compiler (for p|g_mult, try BCS Corollary 1.3.1, reducible ordinary theorem, and direct Skinner witness one by one); 4. Only then perform a database census, with an explicit requirement that the UNKNOWN column must remain visible and not be swallowed.
[document] FW-H2 Jordan–Hölder Lemma
Opening of FW_H2_Local_Isogeny_Compiler, formally answering the first step of the
[document] Local p-Isogeny Kernel Criterion
Translates the abstract Jordan-Hölder criteria from document 35 into concrete, computable isogeny kernel conditions. If E[p]|_{G_Qp} is reducible, choosing a stable cyclic subgroup yields a local isogeny φ:E→E'. It proves that λ²=1 if and only if the kernel polynomial of φ has a linear factor in Q_p. The other Jordan-Hölder character corresponds to the kernel of the dual isogeny. Therefore, FW17-H2 FAIL if and only if the kernel polynomial of φ or its dual has a linear factor in Q_p—one only needs to check one isogeny plus its dual, without needing to enumerate all local p-isogenies.
[document] Kodaira Prefilters and No-Go Results
Three precise, directly applicable computation-free shortcuts, plus one formal prohibition. Shortcut one: a potentially multiplicative curve twisted back to a Tate curve falls exactly into the FW forbidden types, so ADDITIVE+POTENTIALLY_MULTIPLICATIVE automatically yields FW17_H2_FAIL, without needing a local backend. Shortcut two: when p=3, F_3^×={±1}, so any 1-dimensional local constituent is automatically quadratic/trivial, hence LOCAL_REDUCIBLE automatically yields FAIL, and LOCAL_IRREDUCIBLE automatically yields PASS. Shortcut three: the existence of rational local p-torsion automatically yields FAIL, but there is an explicit warning that the converse does not hold—no rational p-torsion does not equal H2 PASS. The conclusion formally prohibits any
[document] Witness-Network v0.3 Integration
Assembles the three independent results from documents 35-37 into a complete, executable FW_PROFILE pseudocode: GLOBAL_H1 checks for absolute irreducibility; LOCAL_H2 sequentially checks potentially multiplicative (automatically FAIL), local irreducible (automatically PASS), otherwise constructs φ and dual φ̂ to check if the kernel has a Q_p-linear root; H3 checks for a nonsplit multiplicative witness; PERIOD checks p-adic compatibility; FINAL requires all to PASS for a fixed additive p to be certificated by Fouquet-Wan. It confirms that odd additive primes still only generate a finite table, and ∀p does not re-inflate. The true improvement of v0.3 is summarized in one sentence: A2 H2 UNKNOWN becomes an exact finite local isogeny test.
[document] Local Agent Implementation Spec
The FW_H2 sub-series concludes, which is also the final document of the entire Phase 2 (40/40): it formally specifies the criteria from documents 35-38 into an implementable function certify_fw_h2(E, p, profile), requiring the output of a complete replayable JSON (not just returning a boolean). Four backend rules: prioritize existing certified local isogeny machinery in Sage/Magma, and floating-point approximation must not be used to determine Q_p roots; merely determining
[branch-hub] BSD Conjecture · Independent Recomputation Line
This line independently recomputes AMRAL's BSD research: every finite claim recomputed with its own code, every document read against its own labels,
[document] ATTACK-C1-ACTUAL-OBJECT
evidence package ATTACK-C1-ACTUAL-OBJECT
[document] ATTACK-C4-THETA-AUX
evidence package ATTACK-C4-THETA-AUX
[document] ATTACK-C4-TRANSVERSE-EXTENSION
evidence package ATTACK-C4-TRANSVERSE-EXTENSION
[document] C10-CANONICAL-SECTION
evidence package C10-CANONICAL-SECTION
[document] C5-DEFECT-LEDGER-AND-C8-SATURATION
evidence package C5-DEFECT-LEDGER-AND-C8-SATURATION
[document] C6-PERIOD-DE-RHAM-PAIRING
evidence package C6-PERIOD-DE-RHAM-PAIRING
[document] C7-DETERMINANT-COHERENCE
evidence package C7-DETERMINANT-COHERENCE
[document] C9-RESIDUAL-HOLONOMY
evidence package C9-RESIDUAL-HOLONOMY
[document] DAG-A-BOCKSTEIN-IDENTIFICATION
evidence package DAG-A-BOCKSTEIN-IDENTIFICATION
[document] DAG-A-CHAR0-DETERMINANTAL-KATO
evidence package DAG-A-CHAR0-DETERMINANTAL-KATO
[document] DAG-B-FUNDAMENTAL-LINE
evidence package DAG-B-FUNDAMENTAL-LINE
[document] DAG-C-REGULATOR-BRIDGE
evidence package DAG-C-REGULATOR-BRIDGE
[document] DAG-D-RECIPROCITY
evidence package DAG-D-RECIPROCITY
[document] LR-HYPOTHESES-AND-C4-DIRECTION
evidence package LR-HYPOTHESES-AND-C4-DIRECTION
[document] NORMALIZATION-AUDIT-V2
evidence package NORMALIZATION-AUDIT-V2
[document] PC001_NORMALIZATION_ACTUAL_AUDIT
evidence package PC001_NORMALIZATION_ACTUAL_AUDIT
[document] R0-COMPARISON-ROUTE-REALIZATION
evidence package R0-COMPARISON-ROUTE-REALIZATION
[document] R05-LOCALIZATION-AUDIT
evidence package R05-LOCALIZATION-AUDIT
[document] RUN-001
RUN-001 — the corpus, and the one document the site's own claim does not cover
[document] RUN-002
RUN-002 — the ladder has eleven rungs, and every summary of it has six
[document] RUN-003
RUN-003 — auditing the audit: the rejection holds, and the corpus strengthened it later
[document] RUN-004
RUN-004 — 40,749 discriminants recomputed from scratch, and one check that could not have failed
[document] RUN-005
RUN-005 — every removed curve recounted over F₃, and a bucket that holds two different things
[document] RUN-006
RUN-006 — all 4,062 three-isogeny determinations verified, and a disagreement that was mine
[document] RUN-007
RUN-007 — the 5- and 7-isogeny gap closed, and both directions decided for the first time
[document] RUN-008
RUN-008 — the half with no evidence: 36,687 kept curves, and what the base actually is
[document] RUN-009
RUN-009 — Theorem 1.1(1): the density is 1/24, and the obvious answer is 1/48
[document] RUN-010
RUN-010 — the drills this tree's README had been claiming for nine rounds
[document] RUN-011
RUN-011 — P5's localization matrix, recomputed from scratch
[document] RUN-012
RUN-012 — all 247,391 twists rebuilt, and a docstring that contradicts its own code
[document] RUN-013
RUN-013 — the Certificate Globalizer is faithful in ℚ and not in float64
[document] RUN-014
RUN-014 — the Phase 2 anchor: `r_an = 0` computed, and `L(E,1) = Ω` to the last bit
[document] RUN-015
RUN-015 — Theorem 1.1(2) tested, and one of 𝒫's three conditions is implied by the other two
[document] RUN-016
RUN-016 — 40,749 conductors from scratch, `c₂` closed, and a base with no additive prime in it
[document] RUN-017
RUN-017 — a real period that was wrong for three rounds, and the BSD identity as the thing that found it
[document] RUN-018
RUN-018 — the two-witness criterion's density formula, and where RUN-015's redundancy came from
[document] RUN-019
RUN-019 — does the witness-network generalisation admit anything, and the corpus's own stop rule applied to this arm
[document] RUN-020
RUN-020 — P5's explicit local-unit cancellation recomputed, and the basis-dependence its §6 does not separate
[document] RUN-021
RUN-021 — the P5 chain's status ledger, reconciled, and two gates this arm closes on its own evidence
[document] RUN-022
RUN-022 — P5's norm-Selmer core vertex: the cube reproduced, three boxed statements shown to be one determinant, and how special 397 and 991 are
[document] RUN-023
RUN-023 — the rank-2 BSD identity at 389.a1, and the first external test of RUN-017's period repair
[document] RUN-024
RUN-024 — the last four undrilled gates, and the vacuous check that drilling them found
[document] RUN-025
RUN-025 — the Phase 1 agent experiment against its own freeze conditions, and a scanner that needed three corrections to measure anything
[document] RUN-026
RUN-026 — the rank this arm had never verified, and the extrapolation defect that closing it exposed
[document] RUN-027
RUN-027 — how much of the 85-document sweep has actually been walked, measured
[document] RUN-028
RUN-028 — Phase 1's stated arithmetic against this tree's own, and a scanner that failed in both directions
[document] RUN-029
RUN-029 — §Q9's twist accounting, every term measured, and the 1,355 placed
[document] RUN-030
RUN-030 — the machine-checkable arithmetic certificate for 696.e1, and what building it caught
[document] RUN-031
RUN-031 — Mazur's twelve isogeny degrees, closed for 696.e1 and every twist of it
[document] RUN-032
RUN-032 — Referee A's checklist, run as a program, and the direction it does not ask for
[document] RUN-033
RUN-033 — The GCD witness lemmas, run, and the empty set they do not survive
[document] RUN-034
RUN-034 — The exact no-go has no domain in this family, and `𝒫`'s own gcd condition is why
[document] RUN-035
RUN-035 — The twist-invariance bridge, and the one witness its split condition keeps alive
[document] RUN-036
RUN-036 — "mod-ℓ images maximal for all ℓ", certified for 38 primes and blocked twice at 3
[document] RUN-037
RUN-037 — The FW-H3 certificate is false as stated, at exactly one prime, and the family survives it
[document] RUN-038
RUN-038 — The ordinary obstruction, measured, and the branch FW is actually left
[document] RUN-039
RUN-039 — The derived supersingular bridge, assembled, and the quantifier that saves it
[document] RUN-040
RUN-040 — The odd-additive period barrier, met at one prime per member and cleared structurally
[document] RUN-041
RUN-041 — Phase 2's mother problem, with all three sets computed
[document] RUN-042
RUN-042 — The corpus's own base certificate, compared row by row, and the discriminant that needed care
[document] RUN-043
RUN-043 — Where this line actually sits on the corpus's own claim ladder: C1, and partial
[document] RUN-044
RUN-044 — The Chebotarev audit, every field-theoretic step computed, and the compatibility that could have failed
[document] RUN-045
RUN-045 — The hypothesis compiler, run, and a prohibition that turned out to be contested
[document] RUN-046
RUN-046 — The H2 chain is consistent, and the corpus disagrees with itself about H3
[document] RUN-047
RUN-047 — The derived theorem before and after the referee, compared
[document] RUN-048
RUN-048 — The schema, the sieve, and the control curve that was supposed to fail
[document] RUN-049
RUN-049 — The corpus's own source audits, and two of this arm's conclusions that move
[document] RUN-050
RUN-050 — The novelty rule this arm cannot advance, and the route matrix it does not follow
[document] RUN-051
RUN-051 — Phase 2's own framing: eleven prohibitions in one place, and a success gate at two of four
[document] RUN-052
RUN-052 — v0.3's decision procedure, run until it leaves this tree; and a compiler target with an empty domain
[document] RUN-053
RUN-053 — The criterion RUN-052 said it could not run was in the corpus, cited once; and it has a consequence it does not state
[document] RUN-054
RUN-054 — A schema that refuses to be a theorem, a spec for the test nobody ran, and eleven prohibitions becoming fifteen
[document] RUN-055
RUN-055 — Theorem 2.18's condition map, recomputed on all 40,749 base curves and all 247,391 twist pairs
[document] RUN-056
RUN-056 — Three rules, three commits, one frozen blob: the mechanism behind RUN-055's provenance finding, read from the diffs and tested on the data
[document] RUN-057
RUN-057 — FW-H2 at the twisting prime, by Lemma B: 18 of 19 members pass, member 3529 fails — and every piece had been in this tree since RUN-038
[document] RUN-058
RUN-058 — Cross-round joins: every prime set in every log, intersected with every other, so that 3529-class findings are looked for rather than stumbl
[document] RUN-059
RUN-059 — One commit, four documents: every figure recomputes, the histogram `11` called unknown is known and reversed, and `14`'s Gates A and B are d
[document] RUN-060
RUN-060 — `15`'s exact replay recomputed to the cell, `09`'s two branches exercised, why the expand branch could never fire — and a correction to RUN-
[document] RUN-061
RUN-061 — `08`'s thirteen removed curves, row by row against the 500K census; and `03`'s six soundness gates, against what the package records
[document] RUN-062
RUN-062 — `02`'s four adversarial curves fail this line's 8b instrument, 4 of 4; and the ecdata pin that only reproduces as CRLF
[document] RUN-063
RUN-063 — Phase 1's closure claim scored item by item, the fixtures reproduced from the census, and the other half of RUN-055: completeness
[document] RUN-064
RUN-064 — Phase 1's six protocol documents, each held against what the package contains and what this line did; and Phase 1 closes at 25 of 25
[document] RUN-065
RUN-065 — Phase 0's three maps, read after 64 rounds: four open rows still open, the 首選 route the most worked at 23 to 9, the 紅燈 route with no round a
[document] RUN-066
RUN-066 — `03`'s Algorithm 2 mirror checked by a different computation on 269,696 (curve, p) pairs; `13`'s +1899 / −53404 reproduced with git to the l
[document] RUN-067
RUN-067 — P5 v1.1's every exact figure recomputed from the group law up: `P'` generates both finite groups, `Q' = 244 P'` and `356 P'`, the slopes 2 a
[document] RUN-068
RUN-068 — the RUGZPB P4 certificate's one proof-critical computation, done a third time from scratch: mod-11 modular symbols for Γ₀(389) built here, t
[document] RUN-069
RUN-069 — P5 v1.3: the finite Bockstein determinant computed in the truncated group ring, the ratio "3" shown to take every value in `F₁₁^×` under a c
[document] RUN-070
RUN-070 — GPT-6's Attack 03, "cyclotomic divisibility": every finite identity in it recomputes, its own counterexample holds in the ring, and it says
[document] RUN-071
RUN-071 — GPT-6's Attack 04: its one new computation, the mod-11 p-adic L-function of 389.a1 at conductor 121, reproduced from this tree's own modular
[document] RUN-072
RUN-072 — GPT-6's Attack 05: the 11-adic formal logarithm of P and Q on 389.a1, recomputed exactly — [16]P and [16]Q to the last digit, s ≡ 99 and 66
[document] RUN-073
RUN-073 — GPT-6's Attack 06: the local multiplier 16 recomputed in Q(α), its adjugate identities and Sen matrix checked, and its complex-side Mellin f
[document] RUN-074
RUN-074 — GPT-6's Attack 07: an explicit genus-3 curve on E × E, a tangent function, a Bézout certificate mod 11 and a four-term chain with boundary 4
[document] RUN-075
RUN-075 — GPT-6's Attack 08: the three norms of the tangent function, the addition pushforward 7·((x+2)/y)⁴, its divisor against m_*Z_PQ, and the clos
[document] RUN-076
RUN-076 — Attack 09, rewritten from this side: the auxiliary character of an Eisenstein degeneration for 389.a1 at p = 11 — GPT-6's χ₈ has root number
[document] RUN-077
RUN-077 — GPT-6's Attack 09, the package: the minus eigenline, the forty cusp paths and λ₈(0) = L₁₁(E ⊗ χ₈, x⁻¹) ≡ 5 (mod 11) reproduced coordinate fo
[document] RUN-078
RUN-078 — GPT-6's Attack 10: the circular unit in Z[ζ₈], its 11-adic logarithm to 11¹⁰, the Leopoldt value L₁₁(1, χ₈) ≡ 5, the filtered-Frobenius entr
[document] RUN-079
RUN-079 — BSD Symbolic Round 001 (the web GPT's "General Cross-Rank Projective Calibration"): every boxed identity instantiated with exact formal seri
[document] RUN-080
RUN-080 — PC-001 (the local GPT-6 line's cross-curve calibration): the rank-0 calibrator 19.a1 rebuilt over Q from the Manin relations — the plus and
[document] RUN-081
RUN-081 — PC-002 (the local GPT-6 line's relative regulator germ and Farey cup normalisation): the four 11-adic series of 389.a1 and 19.a1 recomputed
[document] RUN-082
RUN-082 — BSD Symbolic Rounds 002–004 (the web GPT's determinant-line lift, anchored projective jet, higher projective jets): every boxed identity ins
[document] RUN-083
RUN-083 — BSD Symbolic Rounds 005–007 (the web GPT's determinant-lattice torsor, rational descent and support control, derived determinant complex): e
[document] RUN-084
RUN-084 — BSD Symbolic Rounds 010–012 (the web GPT's proof-obligation architecture, reciprocity-kernel dichotomy, adelic descent): the architecture re
[document] RUN-085
RUN-085 — BSD Symbolic Rounds 008–009 (the web GPT's self-dual fundamental line and correct regulator exponent; the analytic leading-term line and ord
[document] RUN-086
RUN-086 — BSD Symbolic Rounds 013–016 (the web GPT's line-by-line descent audit, observable normalisation character, direct fundamental-line compariso
[document] RUN-087
RUN-087 — BSD Symbolic Rounds 017–020 (the web GPT's flatness from naturality with H¹ and H² obstructions; the normalisation fibration for cross-rank
[document] RUN-088
RUN-088 — BSD Symbolic Rounds 021–025 (the web GPT's PC-001 character lattice and the late versus pre-leading routes; the second anchor versus a direc
[document] RUN-089
RUN-089 — BSD Symbolic Rounds 026–030 (the web GPT's comparison-defect line; period–de Rham cancellation; the exact determinant comparison and its K1
[document] RUN-090
RUN-090 — The web GPT's handoff after Symbolic Round 035, answered: Round 030's certificate C1–C10 actualised against the PC-001 objects that exist —
[document] RUN-091
RUN-091 — Attack C1, the actual-object construction: the auxiliary side built in full — the Eisenstein family in the weight direction, its pseudochara
[document] RUN-092
RUN-092 — Attack C4, the arrow `ε = 1+√2 ⟶ Θ_aux`: the target turns out to be a **line** — `χ₈` is the character of `Q(√2)`, whose unit rank is 1 and
[document] RUN-093
RUN-093 — Attack C4, step 2: the transverse extension made into a dictionary (group, cocycle, frame, which entry) and its Selmer line's local conditio
[document] RUN-094
RUN-094 — The Loeffler–Rivero paper read, its hypotheses computed on our actual forms: **C4's direction closes**, and certificate item C1's partner-in
[document] RUN-095
RUN-095 — Round 030's certificate re-judged with the theorem closures fed back in: **C1, C2 and C4 turn PASS** because RUN-090 applied one rule to ten
[document] RUN-096
RUN-096 — The frontier {C5, C8} attacked: the defect ledger delivered with the `b_f⁺` gauge derived rather than fixed — **`C_π` is gauge-invariant, `c
[document] RUN-097
RUN-097 — R0, the comparison route realized as an actual chain of line maps: **R0 PASS** over `ℋ_Γ`-lines — C1.13 is line-level *because Prop C1.1 lif
[document] RUN-098
RUN-098 — R0.5, the localization audit: the symbolic line's objection — a nonzero divisor is not a unit — was right — `Ψ₁` is injective but **not** su
[document] RUN-099
RUN-099 — C6, the period–de Rham pairing audited as objects, not weights: the auxiliary pairing is LR C1.10's unique `ω_f`, the arithmetic pairing is
[document] RUN-100
RUN-100 — C7, determinant coherence: the category fixed first (RUN-098's `R_S`, nothing more inverted, both ends in it), every object on the route a r
[document] RUN-101
RUN-101 — C9, the residual holonomy audit: the complete transport graph built before any quotient (RUN-097's five lines, PC-001's `B̂` vertex, four ac
[document] RUN-102
RUN-102 — C10, the canonical-section audit: fifteen choices listed with what each depends on, its tag, how it was quotiented and whether it survives —
[document] RUN-103
RUN-103 — DAG-A through RUN-069's determinantal Bockstein: `B_N` typed as the canonical localization map dressed with chosen augmentation generators —
[document] RUN-104
RUN-104 — DAG-A in characteristic zero: Castella–Sano's determinantal Kato main conjecture read object by object and instantiated at `(389.a1, 11)` —
[document] RUN-105
RUN-105 — DAG-B: the line that carries RUN-104's element is the BSD-shaped arithmetic fundamental line at `(389.a1, 11)` — `det⁻¹RΓ(Z_S,T) = D_MW ⊗ 𝓗_
[document] RUN-106
RUN-106 — DAG-C, cut in two as instructed: **C_NT PASS** — `P, Q` are proved here to be a *global primitive* basis (`m = 1`: Hermite's cap, one cited
[document] RUN-107
RUN-107 — DAG-D, explicit reciprocity and nonannihilation: **DAG-D PASS**. All three layers land — the first nonzero projective class in `Q = H/L` is
[document] RUN-108
RUN-108 — four corrections from review: the **projective order** two gates and one drill check read off with order 10's condition in order 5's place (
[document] RUN-109
RUN-109 — the drill scored a crash inside a check as that check's catch; it now counts crashes apart. And the calibrator 19.a1 is named by its a-invar
[document] RUN-110
RUN-110 — no machine-local location and no account name written in this tree: src04 names its table inside the census package, the deny-lists read pri

ccm · 4

[case-hub] Computational Composite Methodology
AMRAL case: Computational Composite Methodology (CCM). This isn't an attack on any one conjecture, but a methodological theory about how mathematical research itself should be organized — formally separating four concepts that are often conflated (truth, method coverage, search success, verification), with a core firewall theorem: heuristic search can be as unrigorous as it likes, but the final verdict must be gated by a sound verifier. Uses a calibration-benchmark framework of 13 rounds spanning extremal graph theory, number-theoretic semigroups, SAT, matrix algebra, linear-programming duality, convexity, and polynomial nonnegativity, plus an 18-round deep-application series on Hilbert's third problem (scissors congruence). Under construction, going live round by round.
[document] Computational Composite Methodology
CCM's complete foundational paper, 38 sections. Its core claim is methodological, not ontological: the mathematical research process can be represented as an evolving state, in which multiple representations, search operators, certificate languages, obstructions, and cost models interact. Formally separates truth, method coverage, search success, and verification. Core structural results: certificate-library coverage monotonicity, unresolved-region anti-monotonicity, coverage failure does not entail falsity (witnessed concretely by the Motzkin nonnegative-non-SOS polynomial), the three-state distinction NOT_FOUND≠METHOD_BLOCKED≠DISPROVED, and the verification firewall theorem for certificate-gated routing. The document explicitly lists nine 'claims supported by theory and benchmarks' and ten 'claims not yet established,' with nine genuine literature citations (Cook–Reckhow, CEGAR, SATzilla, Parrilo SOS, and others).
[document] CCM Formal Core
The minimal formal core extracted from the 38-section long paper: 20 numbered definitions (target, certificate language, positive/negative coverage, unresolved region, method obstruction, representation morphism, final-routing semantics, research state, cost vector, routing regret, etc.) plus 6 numbered theorems/propositions/corollaries (coverage monotonicity, unresolved-region anti-monotonicity, method failure ≠ falsity, representation-morphism composition closure, verification firewall, nonnegative-defect decomposition). Closes with two boxed mottos: truth ≠ coverage ≠ search success ≠ verification ≠ cost; heuristic search may propose, only verified certificates may close.
[document] Benchmarks 01-13 Theory Extraction Map
Records, one by one, what each of the 13 benchmarks contributes to the foundational theory; the document opens by stating that ‘benchmarks are evidence and calibration artifacts, not CCM's definitions.’ Includes a complete cross-reference table (each benchmark's mathematical ecosystem + main methodological contribution). Two phases: Phase I (01-09) calibrates the certificate ecosystem, with the recurring structure ‘controlled representation → compression/coupling/separation/decomposition → proof-bearing certificate → generalization lift’; Phase II (10-13) shifts the research focus from individual certificate languages to the policy for choosing a certificate language itself. Lists theoretical elements jointly observed across more than one benchmark (defect decomposition, positive nonexistence certificates, representation routing, obstruction preservation, cost-aware overlap). Explicitly draws the benchmark claim boundary: they only support the existence and reproducibility of the CCM workflow skeleton, not universal superiority, completeness, or convergence of the unresolved region to zero.

collatz · 81

[case-hub] Collatz Conjecture
AMRAL case: the Collatz Conjecture (the 3x+1 problem). The Collatz Operation Translation Series by Neo.K and Aletheia — nine core papers building an exact finite-parity-word affine atlas (Local Affine Atlas), placing Collatz inside the larger Residue-Class Operation Translation (RCOT) class, plus a follow-on Hard-Zeta global-quantifier-compression research program. Does not claim to prove or disprove the Collatz conjecture.
[document] Reclassification and Calibration of Prior Collatz Research
From Bidirectional Trees and Decimal Reduction to Local Affine Atlases — an accounting of the author's own 2025-2026 Collatz research. Systematically reclassifies a set of prior work (bidirectional in
[document] Collatz Local Affine Atlas: Exact Affine Linearization of Finite Parity Words
Finite-Word Affine Closure, Count/Order Decomposition, and a Word-Order Correction. Establishes the series' first core mathematical layer: proves that every finite parity word w of length k correspond
[document] Parity Words, Residue Cylinders, and Local Identity Trivialization
The exact domain of validity, 2-adic splitting, and local trivialization of the Collatz Local Affine Atlas. Building on Paper 02's affine closure, establishes the exact correspondence between parity w
[document] Bidirectional Residue-Class Translation: 2ᵏ Cylinders and 3ᵘ Progressions
From the Collatz Local Affine Atlas to exact inverse fibers, the odd skeleton, and bidirectional-tree reconstruction. Proves that every admissible parity word w of length k corresponds to a unique sou
[document] Finite-Word Contraction Boundaries and the Binomial Cylinder Law
From exact affine drift and a word-order correction to a purely combinatorial account of the 89.4943% figure. Builds a binomial explanation for finite-word contraction boundaries on top of the first f
[document] Valuation Language and the Accelerated Collatz Map
From run-length encoding of parity words and exact v₂ drift to a valuation-order correction. Restates the old heuristic that
[document] Generalized (mx+r) Systems and Residue-Class Operation Translation
From the Collatz special case to commutative scalar affine dynamics, a phase boundary, and a generalized local atlas. Strips out Collatz's specific coefficients (3, 1) and studies the parity-preservin
[document] Algebraic Domains of Validity and Structural Breakage Theorems
The domain of applicability of Residue-Class Operation Translation, from commutative integral domains to non-commutative and nonlinear dynamics. Answers one of the series' most important domain-of-val
[document] Finite Certificate Frontiers for the Collatz Map
From the Local Affine Atlas and a descent sieve to an integer-anchored hard branch — the capstone of the series. Draws the first eight papers' finite local-dynamics decomposition (finite parity word ↔
[document] Faithful Global Quantifier Compression: A Proof Research Program from Conjecture-Difficulty Analysis to the Collatz Hard-Zeta Frontier
Local solvability, global quantifiers, exception-faithfulness, and a six-track parallel proof plan. Synthesizes the Mathematical Conjecture Difficulty Matrix (MCDM) v0.2, prior work on global quantifi
[branch-hub] III · Crystallization
Collatz Conjecture · III · Crystallization: The papers of this line
[document] The local affine atlas of the Collatz map
Collatz Conjecture · III · Crystallization: The local affine atlas of the Collatz map — Every finite parity word is one exact affine map, with its exact domain and a two-way residue transport — checked against a referee that assumes no theorem, and formalized for all words
[document] What an occupation measure cannot see: three no-go theorems of a Collatz programme, and the datum they discard, measured
Collatz Conjecture · III · Crystallization: What an occupation measure cannot see: three no-go theorems of a Collatz programme, and the datum they discard, measured — Countermodels for the critical invariant limit, a lift cocycle that separates every integer by step 11, and source tails that freeze to zero for every positive integer
[document] The finite certificate frontier of the Collatz map: what a finite verification proves, and the quantifier it cannot cross
Collatz Conjecture · III · Crystallization: The finite certificate frontier of the Collatz map: what a finite verification proves, and the quantifier it cannot cross — The integers a parity prefix has not yet brought down form one residue class cut by one height; a finite verification is exactly the extinction of a finite frontier; K(2^40) = 550 is one value of the frontier function; and a uniform depth is refuted outright by an explicit family
[document] Contraction boundaries and the valuation language of the Collatz map
Collatz Conjecture · III · Crystallization: Contraction boundaries and the valuation language of the Collatz map — The drift sign of a finite parity word is decided by 3^u against 2^k alone; a benchmark's 89.49% is a binomial count, reconciled to the integer; and the accelerated map's valuation words are the same theory in run-length coordinates, checked on real orbits
[document] First crossings of the Collatz map: one correction inequality, a dichotomy that is a partition, and a sparsity argument that fails at log 3 / log 2
Collatz Conjecture · III · Crystallization: First crossings of the Collatz map: one correction inequality, a dichotomy that is a partition, and a sparsity argument that fails at log 3 / log 2 — Five rounds of a Collatz programme on resets, survival and Diophantine renewal, separated into what real orbits test and what only a counterexample could
[document] The exceptional weight of the Collatz stopping time
Collatz Conjecture · III · Crystallization: The exceptional weight of the Collatz stopping time — An exact bridge, its first measurement, an exact refinement algebra, and the end of the uniform decay route at L = 1
[document] Return loops and the defect calculus of near-critical Collatz bridges, and a frontier re-derived without its uncertified constant
Collatz Conjecture · III · Crystallization: Return loops and the defect calculus of near-critical Collatz bridges, and a frontier re-derived without its uncertified constant — Ten rounds of a Collatz programme, checked in exact arithmetic: an integer slack profile, a carry with no multiplier, a certificate on every return loop, a defect that composes, zero-defect returns that trade binary for ternary divisibility at a fixed rate, and a disputed Diophantine input replaced by a certified continued fraction
[document] Where the local theory of the Collatz map holds: the odd (m, r) family, a phase boundary at m = 4, and a ladder of algebraic breakage
Collatz Conjecture · III · Crystallization: Where the local theory of the Collatz map holds: the odd (m, r) family, a phase boundary at m = 4, and a ladder of algebraic breakage — Every statement of the local affine atlas holds verbatim for n/2 and (mn+r)/2 with m and r odd; the binomial law turns over at m = 4; and each algebraic property the theory leans on is removed in turn, with a witness for what breaks and a check of what survives
[document] Packing deficits by congruence, and an exact certificate for a transport exponent
Collatz Conjecture · III · Crystallization: Packing deficits by congruence, and an exact certificate for a transport exponent — Four rounds of a Collatz programme, each step decided in integers or rationals: 1/6 \to 1/9 \to 4/45 \to 1373/25856
[document] Sparse lifts cannot keep up: the packing barrier for subcritical Collatz orbits, and where it stops
Collatz Conjecture · III · Crystallization: Sparse lifts cannot keep up: the packing barrier for subcritical Collatz orbits, and where it stops — Four rounds of a Collatz programme — an entropy constant below 3, a sharp packing constant, a second-order term from Stirling's prefactor, and a counting error that two implementations agreed on
[document] Compressing the coefficient frontier of the Collatz map to one anchor, one path per source, and a closure that claims exactly what it has
Collatz Conjecture · III · Crystallization: Compressing the coefficient frontier of the Collatz map to one anchor, one path per source, and a closure that claims exactly what it has — Six documents of a Collatz programme's A line, checked: the frontier reduced to a minimum anchor measured 23 times, a unique zero-lift edge, a Sturmian deficit ledger, and a finite-local no-go priced
[document] Renewal sparsity in the slack of the Collatz map: laminar crossings, a transport hierarchy, a dense branch closed and records pinned by slack — on a Diophantine input read from the review of the paper it cites
Collatz Conjecture · III · Crystallization: Renewal sparsity in the slack of the Collatz map: laminar crossings, a transport hierarchy, a dense branch closed and records pinned by slack — on a Diophantine input read from the review of the paper it cites — Seven rounds of a Collatz programme checked in exact arithmetic on real orbits where their objects occur, and as algebra where they do not; the one external exponent the rounds share, withdrawn by the programme, restored at the value its source's published review supports, with every exponent derived from it re-evaluated there
[document] The rotation envelope of a Collatz first crossing, and the integers underneath it
Collatz Conjecture · III · Crystallization: The rotation envelope of a Collatz first crossing, and the integers underneath it — An exact cap and when it is attained, exponent codes and their residue classes, a rational Catalan count, and a slope that moves by whole numbers — five rounds of a Collatz programme, decided without a logarithm
[branch-hub] Collatz Conjecture · Independent Recomputation Line
This line independently recomputes Neo.K's Collatz series and separately runs a bounded exhaustive verification. The two are kept apart: the exhaustiv
[document] RUN-001
Run 001 — exhaustive descent verification of `[3, 2^40]`
[document] RUN-002
Run 002 — independent recheck of the Operation Translation Series
[document] RUN-003
RUN-003 — The draft chain, and what the repair repaired
[document] RUN-004
RUN-004 — The Hard-Zeta origin: `Z_k(s)` measured, and `L = 1` refuted
[document] RUN-005
RUN-005 — Hard-Zeta Phase I / Round 01: the chart algebra, checked
[document] RUN-006
RUN-006 — Hard-Zeta Round 02: the two compartments, and Terras by word
[document] RUN-007
RUN-007 — Round 03-A: the coefficient frontier, and the minimum anchor measured
[document] RUN-008
RUN-008 — Round 03-A.1: the accelerated code, and one anchor sequence in two coordinates
[document] RUN-009
RUN-009 — Round 03-A.2: the 2–3 bridge, and what §24's route actually costs
[document] RUN-010
RUN-010 — Round 03-A.3: the zero-lift spine, and a tree that collapses to paths
[document] RUN-011
RUN-011 — Round 03-A.4: the deficit ledger, and what CF tools can actually reach
[document] RUN-012
RUN-012 — the B-line handoff, and whether the A-line closure closes what it says
[document] RUN-013
RUN-013 — Round A-U.1: the no-go holds, and the datum it says is missing is measurable
[document] RUN-014
RUN-014 — Round A-U.2a: the algebra holds, and it already reaches A-U.1's countermodel
[document] RUN-015
RUN-015 — Round A-U.2b: a real elimination, and how far its own constant can go
[document] RUN-016
RUN-016 — Round A-U.2b.1: the constant reproduces to 80 digits, by a different method
[document] RUN-017
RUN-017 — Round A-U.2b.2: the lever bought nothing at first order, and the shipped JSON is not the shipped script's output
[document] RUN-018
RUN-018 — Round A-U.2b.3: the subject corrected a defect this arm reproduced faithfully and did not notice
[document] RUN-019
RUN-019 — Round A-U.2e: every exact identity holds, and both inequalities turn out to be the same line, on the vacuous side of which every computable
[document] RUN-022
RUN-022 — Hard-Zeta A-U.2e.1: the round holds, and the two things worth saying are about what a check is allowed to count as evidence
[document] RUN-023
RUN-023 — Hard-Zeta A-U.2e.2: the round holds, its two headline inequalities turn out to be one inequality, and its Diophantine gate is a partition ra
[document] RUN-024
RUN-024 — Hard-Zeta A-U.2e.3: the round holds, its own corrigendum turns out to be measurable, and one of its sections cannot be tested on any orbit t
[document] RUN-025
RUN-025 — Hard-Zeta A-U.2e.4: the arithmetic holds, and one inference in §5 does not follow from its own premise
[document] RUN-026
RUN-026 — Hard-Zeta A-U.2d: everything checks, the bi-exact regime is not one any real start is in when it crosses, and one cited reference has been w
[document] RUN-027
RUN-027 — Hard-Zeta A-U.2d.1: the rotation cap holds and is attained, and it is exactly rational — plus three defects in the shipped artifacts and non
[document] RUN-028
RUN-028 — Hard-Zeta A-U.2d.2: the saturation equivalence is an exact iff and holds both ways, the gap prediction survives contact with real orbits, an
[document] RUN-029
RUN-029 — Hard-Zeta A-U.2d.3: both second-order coefficients survive a test that would reject a neighbour, the continued fraction is certified without
[document] RUN-030
RUN-030 — the New-Chat Handoff: 132 documents reshipped 27 times without a byte of drift, and one lemma compressed into a stronger one than the round
[document] RUN-031
RUN-031 — the consolidated archive: 964 files open at nine levels, 47 entries are byte-identical to what the sweep verified, and a checksum manifest c
[document] RUN-032
RUN-032 — Hard-Zeta A-U.2d.4: the first round in this line whose core holds on orbits that exist, verified in exact integers, and the identity its own
[document] RUN-033
RUN-033 — Hard-Zeta A-U.2d.5: the exact-code separation holds in both directions, every B-source really is 3 mod 4, and one section mixes an unconditi
[document] RUN-034
RUN-034 — Hard-Zeta A-U.2d.6: a closed-form count checked against brute-force enumeration, the extra bit of section 6 is really there, and a continued
[document] RUN-035
RUN-035 — Hard-Zeta A-U.2d.7: the crossing slope really does move by whole numbers, the caps above it rest on a premise almost no real chain meets, an
[document] RUN-036
RUN-036 — Hard-Zeta A-U.2d.8: a Gamma identity that needs no Gamma, a depth cap no real orbit can be tested against, and two rational constants publis
[document] RUN-037
RUN-037 — Hard-Zeta A-U.2d.9: one line of arithmetic closes the previous round's open problem, a theorem whose premise real orbits actually meet, and
[document] RUN-038
RUN-038 — Hard-Zeta A-U.2d.10: the bridge the previous round refused to build, a countermodel that checks out against its own closed forms, and a ledg
[document] RUN-039
RUN-039 — Hard-Zeta A-U.2d.11: an exact rational certificate, which is the first headline number in this sweep that could be checked with no reference
[document] RUN-040
RUN-040 — Hard-Zeta A-U.2d.12: a hierarchy that reaches exponent zero, and constants that outrun it
[document] RUN-041
RUN-041 — Hard-Zeta A-U.2d.13: a collision assembled from five finite links, and a constants family with one parameter
[document] RUN-042
RUN-042 — Hard-Zeta A-U.2d.14: the round whose central theorem a real orbit can actually be asked about
[document] RUN-043
RUN-043 — Hard-Zeta A-U.2d.15: an inequality that needs no premise, and a checker report that publishes both its honest zeros and their vacuous twins
[document] RUN-044
RUN-044 — Hard-Zeta A-U.2d.16: the round where the central coordinate turns out to be an integer identity
[document] RUN-045
RUN-045 — Hard-Zeta A-U.2d.17: the round whose central identity is a definition, and whose content is one line below it
[document] RUN-046
RUN-046 — Hard-Zeta A-U.2d.18: the round that makes the slack profile an integer, and the branch that has no finite instance
[document] RUN-047
RUN-047 — Hard-Zeta A-U.2d.19: the conjugacy that makes the real cocycle trivial, and the first constant the bundle contradicts itself on
[document] RUN-048
RUN-048 — Hard-Zeta A-U.2d.20: the round whose central object is a loop, and the two things "loop" turns out to mean
[document] RUN-049
RUN-049 — Hard-Zeta A-U.2d.21: the round that names yesterday's finding, and a law that self-composition cannot see
[document] RUN-050
RUN-050 — Hard-Zeta A-U.2d.22: the strongest checker of the sweep, and the one claim it leaves out
[document] RUN-051
RUN-051 — Hard-Zeta A-U.2d.23: a sharpening confirmed on last round's own data, and a theorem with no counter
[document] RUN-052
RUN-052 — Hard-Zeta A-U.2d.24: every counter reproduced, two theorems with none, and two bounds carrying the same spare three
[document] RUN-053
RUN-053 — Hard-Zeta A-U.2d.25: a bound that is finally sharp, and three synthetic blocks that restate their own setup
[document] RUN-054
RUN-054 — Hard-Zeta A-U.2d.26: a withdrawn constant, a certificate rebuilt from exact rationals, and a PASS for a file that isn't there
[document] RUN-055
RUN-055 — The programme's Diophantine input, read from the review of the paper it cites: the general result covers β, the withdrawal's reason does not
[document] RUN-056
RUN-056 — corrections from review: the **Legendre gate** tested δ < 1/2 instead of δ < 1/(2m); the drill tally that counted a **crash and a time-out a
[document] RUN-057
RUN-057 — no machine-local location left in this tree: the private source folder leaves every default, fourteen gates log their bundle by name, and FE

cpl · 17

[case-hub] Critical-Line Proportion Ladder
AMRAL case: Critical-Line Proportion Ladder (CPL). Built on a real, published Anthropic paper — Claude, "More Than Two Thirds of the Zeros of the Riemann Zeta Function Lie on the Critical Line" (2026-08-10) — which unconditionally pushes the proportion of critical-line zeros from 41.6% to 67.25%, explicitly without affecting the Riemann Hypothesis itself. Neo.K's follow-on research: reconstructing the 68.185% ceiling constant the paper itself leaves unaddressed, and rigorously auditing whether existing literature can reach the 70% threshold.
[document] Critical-Line Proportion Ladder: Starting from Claude's 67.25%
Critical-Line Proportion Ladder overview. Starting from Claude's unconditional 67.25% result of 2026-08-10, this project studies what it would take to reach 70/80/90/99%. Semantic lock: the percentage is not a measure of how much of the Riemann Hypothesis is proved. Proof structure: Weil explicit formula → finite Gabor compression → zero-side inertia → prime-side traces → rank-trace certificate. 67.25% and 68.185% are two ceilings that must not be confused; the latter has not yet been independently reconstructed (OPEN-RECONSTRUCTION-01).
[document] Modular Reconstruction of the Proof Chain: The Z / L / P Modules
Breaks the proof of Claude's 67.25% paper into three independently trackable modules — Z (Zero Side), L (Linear Algebra), and P (Prime Side) — which together give the baseline 2/3 at λ=1 and 67.25% after window optimisation. Given fourth moments, under the conditional HL*(4,λ) hypothesis this could reach 13/18≈72.22%. The page closes with 5 Proof Obligations that each require independent re-verification.
[document] The 70%/80%/90%/99% Target Ladder
A target table: P_2/3 and P_67.25 are unconditionally proved; P_68.185 is only a certificate ceiling statement, not an achieved proportion. P_70/80/90 have rough support-requirement estimates; the paper gives no finite support threshold for P_99, and linear extrapolation is explicitly ruled out — no guessing σ99. The real research plane is the two-dimensional coordinate (σ,k), split into three axes: Support/Moment/Certificate enrichment.
[document] 67.25% and 68.185%: The Scope of Two Ceilings
It's not valid to argue that just because 67.25%<68.185%, “optimising a bit more would get you to 68.185%.” 67.25% is the extremal value of the §7.1 window-optimisation subframework; 68.185% is the broader bandwidth-one-class upper bound given by Remark 1.1, but the main paper's text never expands it into a recomputable closed-form formula, so it is flagged OPEN-RECONSTRUCTION-01. P_70 can only be reached by violating at least one of these assumptions.
[document] Reconstructing the Bandwidth-One 68.185% Ceiling
Reads the exact-rational simple-point fraction p0=0.681828687463832... (68.182868746383%) directly out of Zeta23/PairCeiling/ in Anthropic's official Lean companion repo, and reconstructs the stability identity, the near-CUE law, and the signed ceiling formula, defining the Bandwidth-One Escape Problem (BOEP) and five escape classes toward 70%. The official external JSON certificate cert_N256_blk_b128m.json is not currently included in the public repo.
[document] Small-$N$ Primal Toy LP and Boundary-Spike Escape
The first independent reproduction of the bandwidth-one adversarial-law mechanism, explicitly flagged as not a reproduction of Anthropic's N=256 exact-rational LP. An explicit mixture with N=4, M=24 gives a simple fraction of 70.18%, and also reveals a huge spike in the boundary row (S(256)≈211.43) relative to the open band, leading to the definition of the Boundary-Spike Obstruction (BSO): adding just one boundary observable can significantly raise the adversarial simple-fraction floor.
[document] Column Generation, Continuous Pricing, and Primal/Dual Duality with PairCeiling
Formally connects the small-N toy LP back to Anthropic's certificate language: the toy primal/dual and PairCeiling's configuration-wise certificate inequality are discretizations of the same convex-duality structure — not an analogy. Column generation's pricing problem is equivalent to automatically searching for certificate counterexamples. Numerical candidate floors for N=4..7 (69.82%→68.71%) converge toward the official 68.18%, and the one-double defect pattern is found to dominate late-stage pricing.
[document] The Exact-Rational Bernstein Certificate for the N=4 Continuous Toy PairCeiling
The first rigorously proved small-N PairCeiling analogue: for the N=4 toy configuration class (mark∈{1,2}, continuous positions, observing only j=1,2,3), an exact-rational dual certificate combined with exact Bernstein subdivision over three multiplicity patterns rigorously proves p_min ≥ 0.6982110925 = 69.82110925%. This is not a lower bound produced by a numerical optimiser.
[document] The Toy $P_{70}$ Minimal Boundary-Escape Frontier
Adding one minimal piece of extra information, E[S(4)]≤B, to the N=4 toy model: numerical column-generation brackets the B needed to break 70% between 3.65 and 3.67, with an interpolated candidate B*≈3.66941 (explicitly flagged as not a theorem). Core finding: the information needed to break 70% is far less than fully knowing the boundary row.
[document] Exact $P_{70}$ Boundary-Escape Certificate
The N=4 continuous toy model's first rigorous proof that E[p]≥70%: taking the exact dual (c0, y1, y2, y3, μ), it shows that for B≤B_cert=11254781/3068556≈3.667777612662112, all three multiplicity patterns ((2,2)/(2,1,1)/(1,1,1,1)) hold configuration-wise, yielding an exact-rational certificate for the P70 escape via weak duality. Explicitly flagged as a toy marked-configuration theorem defined by this research, not a new theorem about the zeros of the Riemann zeta function.
[document] Refined Exact $B_{70}$ Certificate: Still Exact-Certifiable After Compressing the Safety Margin to $8.0\times10^{-8}$
Even after compressing the rationalization safety margin down to 8.00777312e-8, the result still exact-certifies, giving B_70^cert=35186790600709/9589237500000=3.669404433950979 — only about 5.6e-6 away from the numerical crossing at approximately 3.66941. The document records a genuine QCI case: taking numerical decimals directly as the exact dual produces tiny violations on the collision patterns, so a sufficient margin must be retained for the exact Bernstein proof to go through.
[document] Reconstructing Claude's $1.04/1.26/1.70$ Support Ladder
Reconstructs Claude's Remark 1.1 support thresholds 1.04/1.26/1.70 as arising from the generalized one-delta extremal operator q(σ)=1-1/⟨1,A_σ^{-1}1⟩; the numerical reconstruction matches the paper's rough values almost exactly (σ70≈1.04263, σ80≈1.25785, σ90≈1.70146), and extends to σ95≈2.26 and σ99≈4.19, which the paper does not list — explicitly flagged as a numerical reconstruction, not a new theorem stated in Claude's paper.
[document] Arithmetic Realizability Bridge: From the Unconditional Prime Side at σ=1 to the Arithmetic Requirements of P70-P99
Derives, from the exact off-diagonal formula in Claude's Proposition 5.6, the prime-pair shift scale H_σ≍X^(1-1/σ) corresponding to support σ, and defines a three-tier set of Arithmetic Bridge Hypotheses (ABH-1/2/3). Finds that the σ values for P70/P80/P90 still fall within the α<2 range handled by the classical Montgomery strong Hardy-Littlewood framework, but P95 (σ≈2.26) already falls outside that range — a more substantive arithmetic regime change than a simple proportion threshold.
[document] Test-Specific Weighted Pair-Correlation Hypothesis: $P_{70}$ Does Not Need the Full Hardy–Littlewood Conjecture
P70 does not need the full Hardy-Littlewood conjecture — only one high-leverage weighted moment. Defines WSPC (a one-test weighted SPC) and WPPH (for the specific weighted double sum Claude actually uses); numerically finds that the P70 optimal test uses only about 0.114% of its Fourier mass on the unknown strip, but this share rises rapidly as the proportion target increases (about 51% for P99).
[document] The Exact $O_1$ Kernel of Claude's Proposition 5.6: The Near-Diagonal Wedge, the Selberg-Integral Barrier, and an Audit of Unconditional Results
Performs an exact algebraic reorganization of the off-diagonal O1 in Claude's Proposition 5.6, deriving the near-diagonal universal kernel κ(u)=(sin2u-sinu)/u, and shows that what P70 actually needs is a wedge (1≲h≲T^(σ-1)), not a single shift. Personally audits Zaccagnini's unconditional Selberg integral and the 2024 Matomäki-Radziwiłł-Shao-Tao-Teräväinen higher-uniformity result; neither one's range nor its required statistic lines up with what's needed. Conclusion: the existing literature is not yet sufficient to prove P70 unconditionally.
[document] Matrix Majorant–Inertia Problem (MMIP): Seeking an Unconditional Improvement via CGdL's Tail-Sign SDP and Claude's Off-Axis Signature
Re-examines the tail-sign technique by which CGdL improve the Montgomery-Taylor constant from 1.3275 to 1.3208 under RH (67.25%→67.92%), and pairs it with a newly available 2024 unconditional prime-side non-negativity result to define the Matrix Majorant-Inertia Problem (MMIP): whether tail-sign prime control can be combined with Claude's off-axis block signature to improve on 67.25% unconditionally, without relying on RH. Explicitly states that this document does not prove a new proportion for zeta zeros — it only locates a research direction. The CPL v1-v11 series pauses here for now.

csm · 11

[case-hub] Closure-Space Mathematics
AMRAL case: Closure-Space Mathematics (CSM). A methodological theory about how to organize a long-horizon mathematics research state into a verifiable, replayable relative-global closure space — distinguishing Observed Proof Space, Admissible Proof Space, and Mathematical Reality, separating Route Closure from Theorem Proof, and arguing for the Globality Typing Principle. Ten papers running from formal foundations, globality typing, typed closure graphs, frontier geometry, closure dynamics, projection, cross-domain transfer, an executable calculus, and runtime semantics, all the way to the NS_GSM bridge paper that instantiates the whole theory onto the Navier–Stokes research corpus.
[document] The Formal Foundations of Closure-Space Mathematics
CSM's first-version formal foundations. The core question: after a long-horizon mathematics research program has accumulated a large body of propositions, hypotheses, proof attempts, counterexamples,
[document] Globality Typing and Domain Stratification of Propositions
A direct extension of Paper 00. Argues that “global” is often used as if it were a single scalar of strength, when in fact it quantifies over entirely different axes (time, space, data class, boundary
[document] Typed Closure Graphs, Obstruction Propagation, Reopening, and Frontier Contraction
CSM’s first graph-operations core. Argues that an ordinary directed graph cannot carry a mature proof-space closure state, and that a typed directed hypergraph is needed instead (multiple premises, mu
[document] Frontier Geometry, Cut Sets, Obstruction Cover, and Relative Exhaustion
Addresses the question most often misjudged in long-horizon research: once many routes have been proved, refuted, blocked, or quotiented away, what exactly is the “genuinely still-open remainder,” and
[document] Closure Dynamics, Reopening, Hysteresis, and Fixed-Point Evolution
Advances CSM from a static graph to a time-indexed dynamical system, evolving through event-driven updates. Core claim: evidence accumulation can be monotonic, but the closure state usually is not — o
[document] Closure Invariants, Projection, Attention Views, and Static/Dynamic Compilation
Addresses what happens when a closure-space object is compressed, summarized, or rendered into a visualization, an AI attention window, a database, or a human-readable interface. Distinguishes the Nat
[document] Closure Conservation, Transfer Laws, and Cross-Domain Invariance
Addresses what happens when a closure conclusion is carried from one mathematical domain/representation/proof system to another. Defines cross-domain transfer as a partial mapping governed by a “closu
[document] Closure Calculus, Composition Rules, and Proof-Carrying Operators
Converges Papers 00–06 into the first executable calculus. Every closure operator is given an explicit type signature, preconditions, transformation, postconditions, certificate, debt, and version, pa
[document] Runtime Semantics, State Machines, Recorders, and an Executable Reference Model
Converts the theory of Papers 00–07 into a first-version, implementable runtime specification. Defines the machine state (native graph, state map, certificate recorder, debt recorder, frontier, cut se
[document] NS_GSM: A Canonical Domain Model and Data-Ingestion Specification for the Navier–Stokes Relative-Global Closure Space
The bridge paper where the CSM series stops expanding its abstract theory and, for the first time, fully instantiates it onto the Navier–Stokes long-horizon research corpus, establishing “NS_GSM v0.1.

data-access · 1

[utility-page] Data Access
AMRAL offers two different paths, corresponding to the same underlying research, for human readers and AI/agent readers. Humans: this website — paginated HTML, with each document's original .md/.zip downloadable. AI/agents: the GitHub data area behind it (amral-research-trees, amral-math-archive) is currently private and the remote MCP was switched off on 2026-10-13, so there is no direct AI-facing data path at present; AI use needs a licence first. Honestly lists the current state of each path and where the mirror lags.

dmsd · 11

[case-hub] DMSD: Decimal Multiscale Serializable Domain
AMRAL case: DMSD (Decimal Multiscale Serializable Domain) — a software and representation architecture that layers an unbounded integer domain by decimal scale and expands it lazily, plus finite-range experiments with primes as a stress test (n < 10⁷); no theorem is stated or proved, the prime phases end in null results, and no claim is made about infinitely many primes or about any conjecture.
[document] Decimal Multiscale Serializable Domain — Foundational Methodology
DMSD proposes an architecture that layers an unbounded integer domain by decimal scale and expands it lazily; it is an engineering and representation design, not a mathematical result.
[document] DMSD Phase 2B — Residue Layers
Exact block summaries of residue layers are conserved under refinement; mod 5/10 are tied to the decimal grammar, mod 7 is the control.
[document] DMSD Phase 2C — Square Layer
The square layer has a mergeable O(1) exact block summary that agrees with brute force.
[document] DMSD Phase 3A — Prime Layer Baseline
3A makes UNKNOWN a formal mathematical state and gives an exact table of decade prime counts below 10⁷.
[document] DMSD Phase 3C — Cross-Base Prime Projection Audit
3C shows that the sign of the bias persists across bases; it is not an invariant theorem.
[document] DMSD Phase 3D — Scale-Normalized Density Model
Most of the bias seen in 3B/3C is a consequence of the density baseline, not new prime geometry.
[document] DMSD Phase 3G — Structured Null Escalation: Source-Depth Transition and Baseline–Source Compatibility
3G demotes the candidate residual features: none survives as a new prime invariant; 'closure' here is just classical trial division up to √n.
[document] DMSD Generalized Formal Core v1 — Multiscale Serializable Mathematical Domain, Property-Independent Formalization
Phase 4 is the specification of DMSD as a whole: a property-independent core with ten axioms, in which primes are only one stress test.
[document] DMSD × M6 Prime Fixed-Point Carrier — Closing Experiment v0.1: 'Are the primes a bending fixed-point trajectory that does not break at scale switches?'
On the finite range n ≤ 10⁶ the primes are exactly the zeros of e₆ and increase strictly in log₁₀; this is a definitional observation, not a prime theorem.
[document] DMSD Horizon Edition v0.2 — Recursive Scale Map: Human → Frontier → Future → Symbolic Beyond-Human
Horizon v0.2 is the only page of the Horizon line with mathematical content: the scale index can itself be serialized recursively, so navigation far exceeds computation.

glc-framework · 5

[case-hub] P/NP Dynamic Four-Layer Closure Framework
AMRAL case: P/NP Dynamic Four-Layer Closure Framework. Re-projects P vs. NP onto four layers: Global Computational Complexity (GCC), Universal State-Rate Transformation (USRT), Universal Sufficient-Sequence Generation (USEG), and Global Lossless Closure (GLC). A heuristic re-description, not a proof. Presents two handoff plans side by side: the traditional order with GCC first, and GLC-first (define what closure means before discussing how to close).
[document] Research Handoff and Follow-on Implementation Recommendations: GCC → USRT → USEG → GLC
Research handoff document for the P/NP Dynamic Four-Layer Closure Framework, Plan A: keeps the traditional order GCC→USRT→USEG→GLC. Proposes eight parallel research lines (axiomatization, equivalence arrows, non-circularity, formal proof, algorithmic implementation, counterexample testing, model invariance, complexity-obstruction mapping), a four-phase research plan, and seven research red lines, for the next AI to pick up and carry forward.
[document] GLC-First Research Handoff and Implementation Recommendations: GLC → {GCC, USRT, USEG}
Research handoff document for the P/NP Dynamic Four-Layer Closure Framework, Plan B: reorders it to GLC-first — defining ‘what genuine completion means’ before the GCC/USRT/USEG layers are built on top of GLC. GLC is split into five core axioms (semantic correctness, eventual completion, semantic losslessness, final-ledger validity, admissible execution closure); the first version requires resource-neutrality, forbidding an early smuggled-in polynomial-time requirement.
[document] P/NP Dynamic Four-Layer Closure Framework: A Heuristic Re-description from Global Complexity, State Rate, and Sufficient Sequences to Lossless Closure
Main paper of the P/NP Dynamic Four-Layer Closure Framework. Proposes the three-phase equivalence program GCC (Global Computational Complexity) ⟺ USRT (Universal State-Rate Transformation) ⟺ USEG (Universal Sufficient-Sequence Generation), plus GLC (Global Lossless Closure)'s standard and robust versions as the capping acceptance condition. Core statement: the process is free, the final ledger is not free. A concept paper, not a proof of P vs. NP.
[document] Engineering Verification Trail: Seven-Role Adversarial Verification, v0.2 → v0.2.6
Adversarial verification trail for an engineering candidate related to the P/NP Dynamic Four-Layer Closure Framework: 7 AI roles (coordination, red team, formal/Lean, engineering, independent replay, and two independent scholars) divided the work; v0.2 through v0.2.6, 7 versions, at least 12 distinct blockers found and fixed. As of v0.2.6: status is CANDIDATE_UNPROMOTED / FAIL — AI-1 (coordination) and AI-5 (independent replay) still judge FAIL; AI-2's PASS is strictly scoped and does not constitute overall acceptance. The independent scholars' judgment: engineering closure cannot be promoted to mathematical closure, and there is currently no evidence supporting either P=NP or P≠NP.

goldbach · 41

[case-hub] Goldbach Reverse-Structure Closure Program
AMRAL case: the Goldbach reverse-structure closure program of Neo.K and Aletheia (GPT-5.6 Sol) — three sub-series RG-SCP, SRBRD and TCDC, 77 documents: Goldbach rewritten as structural constraints on a counterexample, an exact finite re-encoding, the sieve–parity boundary and a step-by-step audit of external theorems; no document claims to prove Goldbach's conjecture, and every series ends with 'GOLDBACH STILL OPEN'.
[branch-hub] RG-SCP: The Counterexample Universe, Obstruction Covers and Self-Audits
AMRAL case: the RG-SCP sub-series of the Goldbach reverse-structure closure program — papers 01–08 rewrite Goldbach as a counterexample universe, obstruction covers and demand–capacity inequalities, V0 is the authors' self-audit of them, and V1 consists of Lean-oriented specifications not yet machine-checked; no document claims to prove Goldbach's conjecture, and no computation is reported.
[document] Goldbach World-Information Fixed-Point No-Hole Conjecture
This is a conjecture program with status 'UNPROVEN'; in the integer model 'π⁻¹(E) is non-empty' is Goldbach itself.
[document] Reverse Goldbach Structural Closure Program 01 — Counterexample Universe and Minimal Failure State
RG-SCP 01 is a reformulation and bookkeeping framework (well-ordering plus a filtration), not a proof; it says 'not a proof of the Goldbach conjecture'.
[document] Goldbach Failure Obstruction Cover: From Prime-Complement Failure to Least-Prime-Factor Partition
Failure is equivalent to an exact obstruction cover; this is an elementary equivalence, not a proof.
[document] M6/Wheel Obstruction Geometry and Counterexample Coverage Cost
A failing even number would have to pay a structural covering cost; whether that cost can exceed capacity is open.
[document] Fixed-Point Fibers, Shadow Gaps, and Goldbach Counterexample Exclusion
RG-SCP 04 gives a two-channel decomposition of failure and an explicit no-go; it proves no global statement.
[document] Counterexample Demand–Obstruction Capacity Inequalities
Demand–capacity is a proof template; the crossing L > U is not proved and the parity barrier is explicitly not broken.
[document] Minimal Counterexamples, Shift Transport, and Demand–Capacity Closure
RG-SCP 07 turns 'all smaller even numbers succeed' into new demand lower bounds; the capacity upper bound needed for a contradiction is still unproved.
[document] Three Research Notes: Parity Base-Space and the Second Division Operator, the Root-Bounded Division Domain, Symmetric Finite Relation Closure
All three notes are exact reformulations and each states that it is not a proof; they are the starting point of the SRBRD series.
[document] RG-SCP 01 Claim / Source Audit
This is the authors' own self-audit; it finds and repairs one real defect of RG-SCP 01.
[document] RG-SCP 04 Claim / Source Audit
The audit finds one over-loose statement of RG-SCP 04 (the fibre) and strengthens two numbers.
[document] RG-SCP 05 Claim / Source Audit: Truth-Leakage Correction, Heuristic Reclassification and Escape-Observable Audit
A reusable method: use data roles to stop target-equivalent quantities from being used as probes.
[document] RG-SCP 06 Claim / Source Audit: Canonical Capacity Reconstruction, Incidence Demotion and Suppression Sharpening
The audit redefines 'capacity' as C^can, making demand–capacity an exact identity.
[document] Phase-I Canonical Synthesis: RG-SCP 01–07 Total Audit, Canonical Core Reconstruction, Formalization Priority and the E0–E8 Protocol
The most conservative document of the series: the V0 audit is complete, Phase II is not yet open, and the formal core and E0–E8 are still to be executed.
[branch-hub] SRBRD: The Symmetric Root-Bounded Relation Domain and the Sieve–Parity Boundary
AMRAL case: the SRBRD sub-series of the Goldbach reverse-structure closure program — Goldbach is first re-encoded exactly as a finite root-bounded relation domain, finite moment certificates are checked one m at a time, a uniformization barrier is met at paper 10, and the series turns to sieves and parity and finally aligns external large-modulus theorems with the residual gap scale by scale; no document claims to prove Goldbach's conjecture.
[document] The Exact Representation Kernel: Finiteness, Two-Way Equivalence and a Count-Level Bijection for the Symmetric Root-Bounded Relation Domain
A re-encoding, not a result about truth: a counterexample becomes a finite complete cover. The paper states 'not a Goldbach proof' and 'not yet Lean-verified'.
[document] Structural Compression Audit: Exact Cell Cardinalities, Center-Divisor Collapse, CRT Overlap, Tree-Overlap Upper Bound and a First-Order No-Go
Finds a non-trivial exact compression, but the verdict is 'GLOBAL NONCOVER GATE NOT PASSED': there is no non-cover theorem uniform in m.
[document] Center–Frontier Occupancy: The Exact Bonferroni Remainder and a Cap-Corrected Non-Cover Certificate
A certificate per fixed m. The paper says the reason is 'not that Goldbach is proved'; verdict: UNIFORM GOLDBACH CLOSURE STILL OPEN.
[document] Lattice Sparsity and the Moment-Polytope Dual: Finite Occupancy Caps, Polynomial Majorants, Even-Degree Certificates and Layered Moment LP Duality
A finite-moment certificate family strictly stronger than Bonferroni; still finite certificates per m. Verdict: UNIFORM GOLDBACH CLOSURE STILL OPEN.
[document] Uniform Moment Envelopes and Dual Polynomials: Phase-Free Envelopes Fail and the Bottleneck Is the CRT Phase Discrepancy
A negative result: the authors' own verdict is 'PHASE-FREE UNIFORM CLOSURE FAILS; UNIFORM GOLDBACH CLOSURE STILL OPEN'.
[document] Square-Root Completion and the Sieve–Parity Interface: Fixed Cutoffs, Root-Complete Prime Certification, Bulk–Frontier Geometry and a Parity-Barrier Audit
Verdict 'SIEVE-PARITY BOUNDARY IDENTIFIED'; the paper says outright 'this round is not an SRBRD-11 PROOF PASS'; Chen's theorem is 'not a theorem of this document but an external benchmark'; whether SRBRD's extra structure escapes the parity barrier is answered 'currently unknown'.
[document] Aggregate Semiprime-Cell Coupling: Diagonal / Off-Diagonal Transport Matrix, the Prime-Majority Criterion, a Recursive Diagonal Lower Bound and the Parity-Correlation Identity
A per-m criterion, not a uniform theorem; the paper writes 'UNIFORM PRIME-MAJORITY NOT PROVED; GOLDBACH STILL OPEN'.
[document] Buchstab-Row Mass and the Upper-Bound Mixed Flow: The Pair-Buchstab Identity, Cube-Root Semiprime Rows and the Dimension-2 Row Sieve
Combines the rough-pair mass of the P₂ boundary, the Buchstab loss, the semiprime rows and a transport correction into one exact identity; the paper: 'this document does not reproduce Chen's theorem and obtains no Goldbach proof'.
[document] The Pair-Buchstab Shell and the Row-Sieve Quantitative Gate: Exact Euler-Factor Switching and the Dimension-2 Constant Barrier
A constant-level no-go for naive dimension-2 row bounds, and an exact switch of the semiprime rows to 'prime cofactor × one-residue sieve'.
[document] The BV-Switched Row and the Weighted Buchstab Constant Ledger: Distribution Level Alone Is Not the Missing Ingredient
A ledger of necessary conditions, not sufficient ones; verdict: UNIFORM CONSTANT CROSSING STILL OPEN; GOLDBACH STILL OPEN.
[document] Goldbach-Shift Uniform Convolution: The Low/High Row Split, Maynard-II Fixed-Residue Dependency, Maynard-III Uniform Type-II Coverage and the Minimal Missing Lemma
Narrows and localises the external analytic gap to the low row and corrects the 'missing intersection' headline of SRBRD-19. Verdict: GSHIFT-TII NOT YET PROVED; CONSTANT CROSSING NOT YET PROVED; GOLDBACH STILL OPEN.
[document] Fixed-a Spectral Dependency and the Goldbach-Shift Uniformization Audit: Bezout Small-Phase Breakdown, Spectral-Frequency Inflation and the Naive Residue-Reduction Barrier
A dependency audit of other people's proofs: tracking the fixed-a implied constant is not enough to uniformize; it withdraws an optimistic statement of SRBRD-20.
[document] The Structured-Prime Provider and Shift-Free Dispersion Hybrid: the Complement-Exponent Map, a Maynard-III Range Audit, the 3/8 Type-II Optimum, the 5/8 ↔ 3/8 Weight-Class Duality and the Residual Dispersion Region
The end of the series: external large-modulus technology is aligned scale by scale with the complement-switched low-row geometry, leaving an explicit 'residual dispersion region'. It ends with GOLDBACH STILL OPEN; RSFLD NOT YET PROVED; CONSTANT CROSSING NOT YET PROVED.
[branch-hub] TCDC: Target–Condition Dual Closure and Chen-Type Pressure
AMRAL case: the TCDC sub-series of the Goldbach reverse-structure closure program — 'reverse-solve the conditions under which a target holds' is written down as a method, Goldbach failure is reduced to a finite integer transport feasibility problem, and the missing inputs are priced along Chen-type weighting, two-sink capacity, parity defect and aggregate convolution levels; all 23 documents end with 'GOLDBACH STILL OPEN'.
[document] The Target–Condition Dual Closure Methodology: First Reverse-Solve the Conditions Under Which a Target Holds, Then Separately Establish Existence, Branches, Basins and Structural Closure
A formalization of a method; the status line says no open mathematical problem is claimed proved by it, and the verdict says no claim is made that Goldbach, prime distribution or any other open conjecture has been proved.
[document] The Prime-Square Target and the Failure Fixed-Surface Construction: the Root-Bounded Prime Terminal Domain, the Goldbach Failure Transport Polytope, Capacity Deficits and Cut Certificates
The exact reduction that all later papers cite. The paper: 'what this round establishes is not a Goldbach proof'; it ends with NO UNIFORM POSITIVE DEFICIT YET; GOLDBACH STILL OPEN.
[document] High-Suffix P₂ Pressure and Chen-Type Weighting: the Pressure Scale Corrected to m/log³ m, the Exact Prime/Semiprime Split and the Cube-Root Linear-Sieve Barrier
Corrects the scale of TCDC-03 (m/log² m → m/log³ m) and shows that a direct cube-root lower linear sieve needs level > 2/3. HSP and MRC remain NOT YET PROVED; GOLDBACH STILL OPEN.
[document] Quarter-Root Weighted Pressure and an Adaptation of Chen's Lemma: Half-Weights for Strict Semiprimes, Medium-Divisor Multiplicity, the Extra Prime-Branch Cost and a Constant Gate
The one genuine sieve-style lemma in TCDC: a pointwise half-weight inequality proved by finite case analysis; 0.0841 is a thin margin before the prime-branch and other costs are paid. Verdict: HSP STILL NOT PROVED.
[document] The Strict-Pressure Extra-Cost Ledger and Branch-Neutral Two-Sink Closure: Generalized Half-Weights, Coarse-Cutoff Optimization, the Prime Strictness Tax and the Separate-Upper No-Go
A conditional theorem (T14): if L_{P₂}(λ) > C_P^fail(λ) + C_mir^fail(λ), Goldbach failure is impossible. The hypothesis is never established; verdict: NO POSITIVE TWO-SINK DEFICIT YET; GOLDBACH STILL OPEN.
[document] Bulk Mixed Deficiency and the Coarse-Balance Constant: the Cube-Root Buchstab Branch Constants, the Prime–Semiprime Bias and the Parity Barrier of Joint Transfer
The one-variable 1 : log 2 ratio is a classical asymptotic; the paper says plainly that transferring it to the joint survivor (H01) 'is itself an asymptotic theorem of Goldbach strength and cannot be treated as an ordinary sieve technicality'.
[document] Joint Buchstab Transfer and Parity-Defect Decomposition: the First-Order Liouville Defect, Second-Order Pair Correlation, Capacity as a Correlation Lower Bound and the Counterexample Parity-Reversal Budget
An exact parametrization: mixed-capacity upper bounds are equivalent to second-order correlation lower bounds, and no audited external result is a direct provider. Verdict: NO UNIFORM PARITY-DEFECT BOUND YET; GOLDBACH STILL OPEN.
[document] The Bad-Mass Simplex and the Semiprime-Marginal Upper Constant: Even at the Best Distribution Level the Standard Fixed-Row Linear Upper Has a Semiprime Marginal Multiplier of About 2.0439
Clean geometry (the bad-mass simplex) plus a no-go conditional on the heuristic rank-one benchmark; a finite exact audit for 3 ≤ m ≤ 5000 matches the tables of the paper row by row. Verdict: NO UNIFORM SIMPLEX GAP YET; GOLDBACH STILL OPEN.
[document] Aggregate Semiprime-Marginal Convolution and Level Lift: the Harmonic Distribution Level, the 0.641107 Critical Exponent, the 3/5 and 5/8 Benchmark Deficits, the Shell Portfolio Law and a Convolution-Provider Audit
The single-layer 3/5, 66/107 and 5/8 linear-upper benchmarks are all insufficient without coupling, and no portfolio consisting only of shell levels ≤ 5/8 can cross without coupling. Verdict: NO UNIFORM LEVEL-LIFT CLOSURE YET; GOLDBACH STILL OPEN.
[document] The Yang-v2 Port Audit and the Special-Convolution Hypothesis Match: the Prime-Variable Blocker, the Growing-Residue Blocker, Special-Class Certification, the Repair Stack and a Legal-Coverage Compiler
A twelve-gate type check of an external preprint; legal 5/8 coverage is zero at the current proof state; label: REPAIRABLE-BUT-NOT-LEGAL. GOLDBACH STILL OPEN.
[document] The Prime-Variable Lift and the Two-Prime Convolution Adapter: Exact Prime-Coefficient Routing, the von Mangoldt Majorant, the Positive-Sieve-Lift No-Go, Pascadi/Maynard Type-II Adapters and the PVL Status Correction
The end of the series: PVL is 'routable' in general, but the full TCDC P ∩ R ∩ L provider is 'NOT YET'; GOLDBACH STILL OPEN.

lebesgue · 132

[case-hub] Lebesgue Universal Covering Problem
AMRAL case: the Lebesgue Universal Covering Problem — the classical, still-unsolved 1914 question of the minimum-area convex set that covers every diameter-1 planar set. A four-stage closure methodology (RCHM/LUC-FC), 37 main-line rounds, plus four independent verification/search methodologies Neo.K designed for this line (DLMVC, BCODR, LESR, UESFCM). Currently 10/77 necessity cells reach a replayable exact certificate; the global lower bound of 0.835 remains unproven; no round anywhere claims the problem solved.
[branch-hub] BCODR-LUC: the bidirectional circular-overlap method applied to root 6217
AMRAL's Lebesgue case: BCODR-LUC 01–07 — seven applications of Neo.K's bidirectional circular-overlap method (BCODR) to the root-6217 local minimum. Layer two (懸衡) has recomputed six of them: the numbers nearly all reproduce, and several readings fall. The global bound a_Leb ≥ 0.835 remains NOT CERTIFIED.
[document] Bidirectional Kernel Closure of the Root-6217 Shape Space: the First Arrival-Time Information Field from the Analytic Critical Ray and the A_ref Certificate Boundary
The arrival-time field is BCODR's first operational realisation on the root-6217 parameter space; the paper says it does not claim this is the final or unique metric, that root 131 contains the exact barrier minimizer, or that BCODR has proved positive-rotation closure.
[document] Atomic Cut and Structural Recomposition: the First Cut, Separation and Recomposition of the Root-6217 Bidirectional Information Field — From Coarse Arrival Cells to a Seven-Class Bidirectional Interaction Spine
On the 9 selected frontier parents, 288 children are strictly recomposed into 17 classes, 7 of them bidirectional interaction classes; the paper says plainly that this is not "the whole 195-root space reduced to 7 responsibilities".
[document] True Common-Point Overlap and Provenance Resolution: the True Intersection Time of the Root-6217 Bidirectional Kernel Fields, the Container-Separation Gap, and the Low-Dimensional Overlap Germ of Root 127
"BOTH by arrival" is not "balanced true overlap": on the selected frontier only 127 and 131 are balanced common-point germs, and 127's five-dimensional problem reduces analytically (numerical equality is taken within 2×10⁻⁹).
[document] True Overlap Germ Tangent Decomposition: Normal–Tangent Separation and Second-Order Isolation of Root 127's Earliest Common Overlap Point — From a Three-Dimensional Critical Tangent Space to a Zero-Dimensional Birth Germ
Under the paper's own definition of combined stiffness, root 127's earliest common overlap point is isolated at second order (birth dimension 0); the interval certificates CERT-04A to 04C needed for formalization have not been done.
[document] Balanced Overlap Germ Taxonomy: a Unified Classification of Face-Constrained and Interior-Midpoint First Contacts — Root 127 vs Root 131: Different Tangent Dimensions, the Same Second-Order Isolation Mechanism
Under the paper's definition of combined stiffness both germs are isolated at second order (birth dimension 0); the paper presents this as the start of a reusable germ taxonomy, not a conclusion about a single root.
[document] Root 131 Candidate/Germ Alignment and Mirror-Covariance Reduction: from the Non-Identity of the IMBG Midpoint to Planar Mirror Orbits — Separating the Candidate Shape, the Certificate Germ and the Chirality Obligation
The paper lists as proved that an IMBG is not automatically the minimizer, that single-axis symmetry rules out ordinary two-dimensional chirality, and that feasibility and area are mirror-covariant; it explicitly lists alignment of the candidate with the germ, marked chirality, the global extremal shape, attainment and uniqueness as still open.
[branch-hub] LESR · Root 6217 local analysis (Paper 09C–09U)
AMRAL's Lebesgue case: LESR Papers 09C to 09U, the 2026-09-24 Root-6217 handoff, a 20-question open-questions list and the recovered BCODR-LUC-06 — an analysis of positive rotation near the root-6217 local minimum; the local range [0, 0.003] is closed at the author-defined research-interval authority, the tail and the global problem stay open, and the global bound a_Leb ≥ 0.835 remains NOT CERTIFIED.
[document] Secondary Sliver Asymptotics and the Explicit Second Epi-Derivative
Paper 09C reduces the second-order coefficient to a convex piecewise-linear function with nominal minimum about 0.2256, above the target 0.1; this is a high-precision replay, not an interval proof.
[document] Paired-Sliver Domination and a Robust Scalar Certificate: From the Analytic Elimination of the Secondary LP to a Finite-Radius Acceptance Box
Conditional on an assumed remainder bound, A(ρ) ≥ A0 + 0.1ρ² holds on the local radius [0, 0.003]. This is a conditional result.
[document] Six-Wall First-Epi Closure and the Vertical-Pair Correction
Given the zero-wall structure, the first-order term satisfies Φ₁ ≥ 0 with a unique zero; two statements of 09C and 09D are corrected here.
[document] Canonical Scalar Generation and the Micro-to-Finite Bridge: From the Exact-Envelope Observable to c⋆ and the Eleven-Cell Finite Bridge from 10⁻⁴ to 0.003
Paper 09F is a proof architecture and budget, not a proof: bridge cells are '0/11 certified'.
[document] Outward Observable Enclosures and Bridge-Leaf Preconditions: Rebuilding A, T, C_crit, γ_w, c⋆ from the Canonical Support Formulas with Interval Jets, and Locating the Real Blocking Condition of the First Bridge Leaves
Paper 09H separates a 'research-interval pass' from an audited kernel, and declines to declare any bridge leaf passed because of the radial-cover gap.
[document] Radial-Cover Integration and the First Genuine Bridge Subleaf: the Hausdorff–Steiner Continuity Guard, a Global Local-Secant Cover of B01, and a Positive-Volume Near-Minimizer Leaf
The radial freedom on the B01 local velocity box is covered and one positive-volume subleaf is certified; the B01 parent is still only partial.
[document] Eight-Chart Quadratic Floor on B01: From the 4-D Boundary Cover to Eight Polyhedral Sign Charts, a Second-Order Lower Bound on the Whole B01 Local Box
The second-order lower bound on the whole B01 local box is about 0.106, above 0.1; the higher-order remainder is still to be handled.
[document] Uniform Cubic Bound and Research Closure of B01: Eight Cubic Charts, a Fourth-Order Interval Taylor Remainder, and the Research Closure of the First Full Bridge Parent
B01 is considered closed under the author's own research arithmetic; it is the first full bridge parent, not a Lebesgue result.
[document] B04 Split Closure and Removal of the First High-Order Frontier: From Remainder Over-Enclosure to Full-Parent Research Closure — Root-Neighbourhood Sharpening and a Chartwise Radial Interval Lift
B04's obstacle came from interval over-enclosure, not geometry; after sharpening the root neighbourhoods B04 closes under research arithmetic.
[document] Explicit Quartic–Quintic Repair and Research Closure of B06: From the Positive-ρ Re-Centering Idea to Explicit Higher-Order Coefficients — Ψ₄, Ψ₅ and a Sixth-Order Interval Remainder
Paper 09O repairs B06 with explicit higher-order coefficients, and the repair closes B06 under research arithmetic.
[document] B11 Final Bridge Closure and the Local Positive-Rotation Bridge Seal: the Last Cell, Finite-Chart Migration, a 64-QP Atlas-Agnostic Boundary Certificate, and Research Closure of [10⁻⁴, 0.003]
All 11 bridge parents close under research arithmetic; along the way a finite-chart migration problem is repaired with 64 atlas-agnostic QPs.
[document] Micro-Gate Monotone Inheritance and the Local Positive-Rotation Seal: Dominating [0, 10⁻⁴] from the Atlas-Agnostic Lower Bound at ρ = 0.003, and Completing Research Closure of [0, 0.003]
The local range [0, 0.003] is closed under research arithmetic; the tail and the root-6217 gate itself remain open.
[document] Tail A_ref Campaign: Exact Eroded Core, Adaptive Frontier and Parent Ledger
Nine closures have snapshot sources; the tenth is reported only in later text. Full trees were not replayed in this round.
[document] Frontier Spine Closure Against the A_ref Tail: Permanent NOT-F3 Correction, Five New Tight-Reference Certificates, and the 9→1 Collapse of the Selected Spine
At the authors' own research authority the ledger of active tail parent responsibilities is corrected from Paper 08's 195 to 182 (a parent-level accounting statement that does not prove the tail closed); root 131 is a candidate that A_ref cannot prune, and the global shape of root 6217 stays open.
[document] AMRAL Lebesgue Final Closure: A Question List of Suspected Possibilities
This list records what cannot yet be excluded; it is not a result.
[document] LESR Root-6217 Positive-Rotation Line: Local Verification, Tail-Campaign Takeover and Series-Integration Handoff
This handoff is the state-of-play ledger of the batch: the local range is closed at research-interval authority, the tail only in part, everything else is open.
[branch-hub] MCC-OE: Measured-Construct Closure and Observable Exhaustion
AMRAL's Lebesgue case: MCC-OE (Measured-Construct Closure and Observable Exhaustion) — 28 papers that write the local B01 certification near root 6217 as an interval-certificate pipeline of observables and threats. The author-defined 'research-interval' closures hold only locally; the global bound a_Leb ≥ 0.835 remains NOT CERTIFIED.
[document] Measured-Construct Closure and Observable Exhaustion: Numerical Probes, Reverse Constraint Probes, and Threat-Signature Closure for the AMRAL Lebesgue Final Stage
Paper 00 proposes a strategy: replace geometric exhaustion by observable exhaustion and task sufficiency. It is a methodological framework with no numerical conclusion.
[document] AMRAL Lebesgue Final Closure Ledger: Re-ordering Q10–Q20 into Observables, Threat Modes, Numerical Probes and the First Attack Order
The ledger states plainly which questions remain open and where they sit on the ladder; it claims no question closed.
[document] Task-Sufficiency Collision Protocol and Transition-Threat Compiler: Red-Teaming the Observable Basis with Numerical Probes and Compiling Unclassified Transition States into Measurable Threat Boundaries
Paper 02 gives a protocol for testing whether a probe basis is sufficient; it is not a result, and task sufficiency itself stays open.
[document] Exact-Root Monotonicity Probe and Certificate-Relative Task Sufficiency: Canonical 18-Piece Continuum Root Ordering, the B01 Chart Collision, and the First Real Coupling with the Chart-Free HSL Certificate
For this one certificate route, a structural difference (spanning four chart regimes) did not produce a task difference (the certificate still passes).
[document] B01 Chart-Free Boundary Threat Cover: The Hausdorff–Steiner Leaf Certificate, a Prototype HSL Cover of Over Half the Volume, and Adaptive Multi-Route Certificate Closure
Paper 06 certifies 53.06% of the B01 boundary parameter volume; that is not a closure of B01.
[document] AREF / Direct Certificate Materialization and the Erosion-Lower-Bound Barrier: From Zero Coverage by Old AREF Parent Reuse to a Real box_lower Replay, and Why the B01 Hard Core Needs a Dependency-Preserving Direct-Area Compiler
The old AREF reuse route covers none of the B01 hard core; the direct-area route needs a new, dependency-preserving compiler.
[document] Dependency-Preserving Direct-Area Compiler and First-Order Renormalized Residual: From a 10⁻⁹ Raw Margin to R₂^fin ≈ 0.106, Rewriting the B01 Hard Core as a Conditionable Finite-Radius Residual Problem
Paper 11 rewrites a margin of order 10⁻⁹ as a residual problem of order 0.1; the rewrite is an identity, the search result is not a proof.
[document] Sliver-Quotient Soundness Correction and Eight-Chamber Arithmetic Closure: From 'Continuous Dimension Compression' to 'Invertible Sliver Coordinates plus a Discrete Topology Quotient'
Paper 15's 'continuous dimension compression' is corrected to invertible coordinates plus a discrete topology quotient; the principal arithmetic layer of the eight chambers is closed at research-interval authority.
[document] Six-Sliver Structural Exhaustion, Vertical-Pair Supersession, and Precision-Stable One-Sided Remainder Audit: From Five-Sliver to the Six-Wall / Three-Pair Secondary Atlas
Paper 17 openly supersedes its own earlier structure (five slivers → six) and uncovers a precision artefact.
[document] Kink-Safe ρ Bridge, Normalized Slope Gate, and Component Taylor Remainder: Rejecting the Raw Hausdorff Bridge, Correcting the C² Curvature Assumption, and Reducing the Remaining Tube Closure to an Envelope/Topology Remainder
Paper 19 withdraws the bridge of paper 18 and replaces it by a new normalized slope gate; it is a withdrawal, not a new closure.
[document] Higher-Order Root-Jet Majorant, Eight-Template Dini Closure, and the Full S100 Continuum Tube: J6–J13 Whole-Box Interval Tail, Real-Axis Transversality Majorant, Finite-Kink Template Exhaustion, and CR-11 Research-Interval PASS
Under the author's own research-interval authority the S100 continuum tube is considered closed (total budget C_total ≤ 718.573 < 728.571); an independent publication audit remains OPEN.
[document] Primary Eight-Chart Quadratic Closure and Finite Wall-Layer Reduction: from the Global Minimum 0.106083 of Ψ2 to the Regular-Chart Finite Lower Bound 0.105758, Reducing the Remaining B01 Boundary Responsibility to Single and Double First-Order Wall Layers
At the authors' own research-interval authority, R2fin > 0.105758417246 > 0.1 on the regular primary charts of B01, and the triple critical tube (MCC-OE-23) is closed; the finite O(ρ) single-wall and double-wall layers, the full B01 boundary, the B01 parent and global Lebesgue are all explicitly not claimed.
[document] Finite First-Order Wall-Layer Bridge and B01 Boundary Closure: Exact Finite-Width Sign Transfer, Relaxed Eight-Template QP, and Elimination of WL-1/WL-2
At research-interval authority the full route cover of the B01 boundary is considered closed; the radial integration to the parent is still OPEN in this paper.
[document] B01 Boundary-to-Parent Radial Composition and Parent Closure Audit: From BOUNDARY_SAFE to PARENT_SAFE — the Fail-Closed Composition of the 09I Global Radial Lock with the MCC-OE-25 Boundary Closure
At research-interval authority the B01 parent is considered closed; an independent publication audit remains OPEN.
[document] Root-6217 Residual Ledger Reconciliation and Hybrid Certificate Atlas: From Cycle 17's '61 Current Cells' to the 9/24 '19 Tail Hard Parents' — Target-Qualified Closure, Local/Tail Responsibility Separation, and the Canonical Research Frontier
Paper 27 is the series' state-of-play ledger: the local range is closed at research-interval authority, the tail only in part, and everything else is open.
[document] Root-6217 Replay Contract, Publication Debt Ledger and AMRAL LinkBack
Distinguishes the 9/29 snapshot from the 10/29 text ledger; the final parent-0 certificate and global Lebesgue remain open.
[document] BCODR Bidirectional Circular Overlap Decomposition and Recomposition v0.1: A General Methodology That Simultaneously Overlaps Outward-Expanding and Inward-Contracting Circular-Kernel Fields, Cuts Them Apart, and Traceably Recomposes the Candidate Space — Not Specific to the Lebesgue Problem
BCODR (Bidirectional Circular Overlap Decomposition and Recomposition, v0.1) is a general candidate-space search and bookkeeping method designed by Neo.K, not specific to the Lebesgue problem: it simultaneously grows outward-expanding and inward-contracting circular-kernel fields, cuts their overlaps into atomic cells, and recomposes them into a surviving structural spine; the methodology itself acknowledges it has not yet been proven to converge for arbitrary problems, find the global optimum, or yield a unique recomposition.
[document] DLMVC v0.1: A Deep-Lag Multi-Pass Verification—Closure Methodology Deliberately Desynchronized from the Frontier Line — Its First Field Audit Already Supplies Lebesgue Universal Covering Round 01 with a Missing Lemma and Falsifies One Active-Direction Classification
DLMVC v0.1 is a general deep-lag verification methodology designed by Neo.K and compiled and formalized by Aletheia / GPT-5.6 Sol: it governs a deliberately desynchronized second AI research line using three-dimensional lag (round / time / structure) and a formal blindness-provenance state machine; its first field audit has already supplied Lebesgue LUC-FC Round 01 with Lemma JPA-01 and corrected an active-direction classification error.
[document] LESR Paper 00: From Skew Fields to Variational Shape Closure — Reusing the Existing Support-Skew-Field and Shape-Update Formula to Establish a Shape-Closure Research Line for the Lebesgue Universal Covering Problem, Independent of Area-Value Closure
LESR/SFVC Series Paper 00 establishes Shape Closure as a new research line for the Lebesgue Universal Covering Problem: convergence of the area upper/lower bounds does not imply convergence of support-function shape uncertainty, so the line separately tracks three additional uncertainties — the support-function corridor, contact topology, and the symmetry group. This paper reuses the existing skew-field technique (the support skew field K_{C,γ}, the conceptual shape-update formula) to handle this new problem, without making any revision to the existing skew-field/Moser bridge results.
[document] Lebesgue Universal Covering Finite-Closure Methodology, Round 00 v0.2: Freezing the LUC-FC Existence→Descent→Saturation→Global Closure Four-Stage Closure Chain and the "Finite Closure = Finite Saturated Certifiable Branch Types" Working Definition; This Round Makes No New Mathematical Claim About the Lebesgue Problem
AMRAL's Lebesgue universal covering finite-closure attack line (LUC-FC), Round 00 methodology-freeze document: it recasts the problem as an RCHM-tractable relational handoff problem, fixes the Existence→Descent→Saturation→Global Closure four-stage closure chain, and formally defines finite closure as finite, saturated, certifiable branch types rather than finitely many points. This round claims no new Lebesgue bound or proof; the global problem remains OPEN.
[document] Support-Handoff and Constant-Width Reduction Both Ruled CLOSED: Establishing the Curvature-Density Domain 𝓡 and a Three-Direction Active Certificate
Round 01 records the starting point of the Descent stage of the AMRAL LUC-FC research line: every planar set of diameter at most one is exactly reduced, via closed convexification and constant-width completion, to a unit constant-width body (handling the three cases d=1, 0<d<1, and d=0 separately); it proves that support-function containment is the exact handoff on this reduction chain, with no approximation loss; it introduces a new canonical curvature-density domain 𝓡 and proves it corresponds bijectively to the translation-equivalence classes of unit constant-width bodies; it proves the centered target family is compact under the Hausdorff topology, upgrades the outer worst case from sup to max, and obtains an abstract, non-constructive finite ε-net existence result; it proves that, under a fixed orientation, the optimal translation is witnessed by at most three active support directions. This round does not give a constructive finite shape dictionary, and the global Lebesgue bound remains unsolved.
[document] Curvature-Density Compiler Gains an Explicit Error Bound, Finite Legal Dictionary Theorem Established: The Constant-Width Target Space Is Compressed, for the First Time, into an Enumerable Finite Dictionary
Round 02 records progress in the AMRAL LUC-FC research line: it proves that circularly convolving the support function of a centered unit constant-width body against a non-negative normalized kernel preserves convexity, constant width, and the Steiner gauge exactly, and derives an explicit Hausdorff error bound E_N=π²(4N+1)/[2(2N²+4N+3)(N+1)]=O(N⁻²) using the squared-Fejér/Jackson-type kernel J_N. Adding a safety interiorization and Fourier-coefficient grid quantization, it then constructs a genuinely finite dictionary D_{N,δ,q} of legal constant-width bodies (Theorem 20.1) that is a Hausdorff ε-net for any accuracy ε>0, upgrading Round 01's abstract finite net into a constructive legal one. The round's core theorems are analytic and do not depend on large-scale computation; three census/benchmark follow-on tasks are explicitly marked COMPUTE-DEFERRED. This round produces no new numerical bound on a_Leb, and the global bound a_Leb≥0.835 remains unproven.
[document] The LUC-FC Research Line Completes Its First Self-Correction While Global Candidate-Cover Optimization Remains Unsolved: Signed Placement Margin and the Fixed-Cover Finite Placement Certificate
Round 03 (AMRAL-LUC-FC-R03, 2026-09-18) establishes, for a fixed candidate cover U, a complete fixed-orientation translation LP-duality theorem (a zero-barycenter probability-measure dual), and proves the exact witness structure of the optimal placement: exactly 2 antipodal active directions, or 3 active directions whose convex hull contains the origin. This round simultaneously records the first self-correction of the LUC-FC research line, formally registered as R01-CORRECTION-001: Round 01 had loosely listed one/two/three active branches, and this round proves that one-active is impossible, correcting the classification to 2-active antipodal or 3-active and origin-enclosing — this correction only refines the sub-classification and does not affect Round 01's main theorem of at most three active directions. It further establishes a finite support-direction grid and a finite orientation grid (each with an explicit error bound), which, merged with Round 02's finite shape dictionary, yields a complete two-sided numerical bracket for any fixed candidate cover; the global optimization problem of the candidate cover itself is left to Round 04.
[document] a_Leb Obtains a Finite Two-Sided Bracket for the First Time, While Exact Saturation Remains Unresolved: Candidate-Cover Boundary Compiler and Global Polygon Dictionary
Round 04 (AMRAL-LUC-FC-R04, 2026-09-19) records the final round of the Descent phase of the AMRAL LUC-FC research line: it establishes an anchor lemma that every universal cover must contain a radius-1/2 disk, compresses the candidate cover into a Hausdorff-precompact compact class, and constructs a monotone-safe (never-undercounts) finite outer-approximation polygon compiler, with explicit Hausdorff error ε and area-inflation error β, both of which converge to zero as the resolution (M,q)→(∞,0). The core theorem establishes, for the first time, a genuine finite two-sided bracket on a_Leb itself: A_poly−β ≤ a_Leb ≤ A_poly. This round explicitly states that 'finite-resolution global convergence' holds while 'exact finite saturation' remains OPEN, makes no claim of superiority to or comparability with the Zeng 2026 hierarchy, and does not improve on the existing published upper and lower bounds.
[document] Finite-Witness Completeness Proved, the Saturation Gate Formally Established: Finite Witness Attainment Remains an Open Conjecture
Round 05 records the opening of the Saturation phase of the AMRAL LUC-FC research line: establishing the finite-witness lower-bound functional Λ(F) and proving that it attains its minimum, proving the Finite-Witness Completeness theorem that a_Leb = sup over finite F of Λ(F), establishing the cardinality ladder λ_m↑a_Leb in which every level attains its maximum, and proving the No False Permanent Saturation theorem together with safe candidate-cell pruning rules. The core safety mechanism is a rigorous proof that finite-resolution convergence does not imply finite exact closure; Finite Witness Attainment remains an open conjecture proposed by this round itself, and the global Lebesgue bound is unchanged.
[document] The Witness-Exchange Eventual-Success Theorem Is Established: A Non-Saturated Family Is Guaranteed to Find a Separating Witness Batch in Finitely Many Steps, but This Round Adds No New Numerical Lower Bound
Round 06 records progress in the AMRAL LUC-FC research line: it compiles Round 05's existence claim — that a non-saturated witness family always has some larger family that raises the lower bound — into a formal Witness Exchange Compiler, proving that finite-family configuration domains are compact (matching Mishra 2026's external five-dimensional certificate Λ(D,B_3,B_5)≥0.8344 at m=3), the Uniform Minimizer Violation Theorem (δ_F=min_{U∈𝔐(F)}W(U)>0), the Witness-Exchange Eventual-Success Theorem (a non-saturated family must find a separating witness batch at some finite level), and the Witness Dominance Theorem. This round adds no new numerical lower bound; Mishra certificate ingestion, minimizer-cell reconstruction, and the search for the next hard witness are all marked COMPUTE-DEFERRED, handed to Round 07. The exact value of the global bound a_Leb remains undetermined, known only to lie between the proven 0.8344 and the proven 0.8440935944.
[document] Independently Reproducing Mishra's Official 0.8344 Certificate, the B7 Candidate Remains Only a Search Prior: Threshold-Conditioned Minimizer Atlas and the Witness-Switching Lower Bound
Round 07 records an external data audit for the AMRAL LUC-FC research line: directly checking the Mishra 2026 paper (arXiv:2608.30538) against the official source repository Ujjwal238/universal-cover-problem, independently reproducing its published lower bound 0.8344, the 486,799,600-node search-tree certificate, the 1.72×10⁻⁹ floating-point error bound, and the official best-exhibited seed coordinates. This round proves three theorems — Threshold-Conditioned Witness Lifting, the Witness-Switching lower bound, and Robust Cell-Lift Transfer — and proposes the next milestone T1=0.8350, while using its own data to show that the regular Reuleaux heptagon B7, provisionally ranked first in a small-scale fixed-seed numerical probe (about 0.83713), is only a SEARCH-PRIOR heuristic-ranking signal and not a lower-bound certificate; the global bound a_Leb≥0.8344 is unchanged, and 0.835 is still not certified.
[document] Reuleaux Erosion Generalizes to a Generic Convex Common-Core Theorem, Nested Base/Lift Certificate Soundness Closed: B7's Root Domain at the 0.8350 Threshold Is Fixed, the Global Lower Bound Remains COMPUTE-DEFERRED
Round 08 records progress in the AMRAL LUC-FC research line: it abstracts Mishra's erosion lemma into a general convex common-core theorem (Theorem 2.1), proves that the official Reuleaux erosion is exactly its special case, and establishes the nested base/lift certificate soundness theorem (Theorem 12.1), unifying the base atlas, cell-local witness lift, and independent verifier into one complete certificate grammar; it also fixes witness B7's local lift root at the T1=0.835 milestone as R7≈0.512858431636, |t7|≤0.196935046771. This round closes two architectural results — the CONDITIONAL-LIFT CERTIFICATE COMPILER and the GENERIC CONVEX COMMON-CORE INTERFACE — but a_Leb≥0.8350 itself remains COMPUTE-DEFERRED, and the global bound a_Leb≥0.835 remains unproven.
[document] Exact Split Scheduler Proved, Core-Dominance Reuse Established: The Adaptive Certificate-Cost Layer Closes This Round While the Heavy 0.8350 Certificate Remains Compute-Deferred
Round 09 records progress in the AMRAL LUC-FC research line: building on the nested certificate grammar established in Round 08, it adds no new proof domain, and instead proves a fully soundness-preserving layer of adaptive certificate-cost strategies — an exact Hausdorff-radius one-step split scheduler (on the T=0.8350 root cell, the first cut is the φ5 axis, taking τ from 0.6047 down to 0.4442), a tightening of Round 07's area-transfer error bound from 4πTτ+πτ² to 4Tτ+πτ², explicit margin-to-resolution and margin-to-depth formulas, and two cross-cell certificate-reuse theorems (Core-Dominance Reuse and Single-Lift Witness Dominance). The global bound a_Leb≥0.835 remains unproven, and this round says plainly that the heavy 0.8350 certificate is still compute-deferred.
[document] Reference Atlas Emitter End-to-End Dry Run: An 11372-Node, 5688-Leaf Nested Witness Certificate Actually Runs to Completion for the First Time, Fully Cross-Checked by a Second, Independently Rewritten Verifier; Round 10 Is the First Round in the Whole Series to Adopt the Formal Claim-Status Vocabulary Verbatim, and Pre-Emptively Excludes, Under Its Own REJECTED Category, the Misreading of "Treating the Local Dry Run as the Global 0.835 Theorem"
Round 10 (AMRAL-LUC-FC-R10, 2026-09-18) takes the officially published D+B₃+B₅ near-minimizer placement and cuts a local five-dimensional neighborhood of halfwidth 4×10⁻⁵ to 4×10⁻⁴ into 4 base leaves; every leaf expands the complete B7 three-dimensional relevant root, and the emitter produces an 11372-node, 5688-leaf nested DFS witness certificate, which is fully cross-checked — hashes, manifest, and stream exhaustion — by an independent verifier that uses a handwritten monotone chain + shoelace routine instead of the emitter's scipy ConvexHull, reaching a final status of REFERENCE-VERIFIED. This round is also the first in the whole series to adopt the formal claim-status vocabulary verbatim, and explicitly excludes, under its own REJECTED category, the reading that treats this local dry run as a global a_Leb≥0.835 theorem.
[document] Global Exhaustive Proof Rewritten as an Independently Verifiable Sharded Architecture: A Reference Case Splits Into Three Shards and Re-Verifies Successfully, but the Real Global 0.8350 Run Remains Compute-Deferred
Round 11 records progress in the AMRAL LUC-FC research line: it rewrites the global exhaustive proof from one monolithic job into a shardable, independently verifiable architecture, proving the Complete-Frontier Coverage Theorem, the Frontier Replacement Invariant, and the Shard Partition Theorem, and establishing a content-addressed shard manifest with Merkle-root binding. This round actually splits Round 10's 4-leaf reference certificate into 3 shards and re-verifies them independently (S=4, N=11372, L=5688, all 2L-S=N audits pass), logged as REFERENCE-SHARDED-VERIFIED — but the document formally logs SHARDED CERTIFICATE ARCHITECTURE: CLOSED alongside GLOBAL 0.8350 HEAVY RUN: COMPUTE-DEFERRED, since the full global 0.835 base domain has not actually been run yet. The global bound a_Leb≥0.835 remains unproven.
[document] Distributed Proof State Becomes a Persistent Checkpoint Crystal, Stale-Safety and Sufficiency Theorems Proved: the V1–V5 Reference Handoff Test Passes in Full
Round 12 (AMRAL-LUC-FC-R12, 2026-09-19) defines the distributed proof state itself as a persistent, auditable, invalidatable, correctable Checkpoint Crystal (CP=(R,T,D,P,C,A,G)), splitting its dependencies into a proof-critical part (folded into a fingerprint H_dep) and a performance-only part (excluded from H_dep). It proves the Stale-Safety Theorem (Theorem 5.1): once a proof-critical dependency changes, any old claim is classified STALE by the validator and excluded from the final proof; and the Checkpoint Sufficiency Theorem (Theorem 17.1): a checkpoint that preserves the root, frontier, and claim/certificate hashes needs no scheduler history to continue verification. It formalizes a six-state claim ledger and a four-level A0-A3 audit hierarchy, and states plainly that multi-AI audit is not majority vote. Using Round 11's existing 4-seed frontier, it actually runs all five V1-V5 state transitions, producing theorem_ready results of true/true/false/false/true exactly as predicted. This round is protocol and infrastructure work; the global bound a_Leb≥0.8350 remains COMPUTE-DEFERRED and this round produces no new numerical result.
[document] Certified Ancestor Contraction Theorem Proved: A Late Strong Certificate Can Absorb an Already-Split Subtree, Closing the Autonomous Scheduler/Merger ABI and Passing a Live Concurrency-Race Test
Round 13 records progress in the AMRAL LUC-FC research line: it formally specifies an autonomous worker-scheduling and Canonical Merger protocol — Job Contracts and Worker Proposals are both immutable, workers may only produce proposals, and only the Canonical Merger may write to canonical proof state — and proves the Certified Ancestor Contraction Theorem (Theorem 10.1): whenever a still-current, valid certificate directly proving the whole ancestor box B(p) exists, an already-split descendant frontier can be contracted back to a single ancestor claim, so a late strong certificate is never wasted. It also proves the Atomic Merge Theorem (Theorem 20.1): any finite sequence of accepted transitions keeps the frontier prefix-free and complete, with every seed carrying a valid active claim whenever theorem-ready. The round runs a real EXPAND/CERTIFY concurrency-race dry run on an existing Round 12 checkpoint, with all three decision steps verified PASS. The global bound a_Leb≥0.835 remains unproven; this round is an architectural result for the scheduling/merger protocol, and the work needed to wire in real heavy compute (C13-1 through C13-5) is explicitly listed as COMPUTE-DEFERRED.
[document] Semantic Implication Joins Exact-Hash Matching as a Legal Path, Hot/Cold Compaction Proved to Leave Theorem-Readiness Unchanged: The Semantic Rebase Layer and the Hot-Core Compaction Theorem Both Close
Round 14 records proof-state engineering in the AMRAL LUC-FC research line: it defines semantic compatibility and claim capacity (Cap_e'(c)=T_c+s_c+e_c-e'), and proves Claim Dominance and the Hot-Core Compaction Theorem — compacting history never changes theorem_ready as long as scope, policy, frontier, active claims, and theorem-critical evidence stay the same. This round actually compacts the Round 13 reference checkpoint into a hot core of three active claims, moving the rest into a content-hash-bound cold archive, with machine tests confirming rehydration and the semantic-rebase boundary (T'=0.8350001 passes, T''=0.8350004 fails). This is an architectural result with no new numerical lower bound; the global bound a_Leb≥0.835 remains unproven.
[document] Proof Capacity Algebra and Automatic Threshold Ladder Both Ruled Closed: the Global Capacity Theorem and Free Promotion Theorem Are Established, but the Global 0.835 Heavy Certificate Remains COMPUTE-DEFERRED
Round 15 records progress in the AMRAL LUC-FC research line: it upgrades Round 14's PASS/FAIL shard verdict into a quantitative proof-capacity algebra, defining Root-Domain Capacity and the recursive Evidence Capacity C(p)=max(D(p),min(C(p0),C(p1))), and proving the Global Capacity Theorem (C_global=min(C_root,C_evidence)), the Free Promotion Theorem, and a Minimum-Cost Repair DP, using a Deficit Frontier to pinpoint the smallest workload actually needed once capacity is exceeded. This round validates the entire mechanism end to end on Round 14's local reference example (C_ref=0.8350003545377508, freely promotable with no new certificate to 0.83500035), and proposes a T_M=0.8365 phase-master-root engineering design example (a PHASE-DESIGN-CHOICE, not a theorem, growing the enclosing-box volume by about 11.66%). The global 0.8350 heavy certificate remains COMPUTE-DEFERRED, and the global bound a_Leb≥0.835 gains no new proof this round.
[document] First Full Pilot Run on the Global Master Root: Raw HARD Vastly Outnumbers the True Near-Minimizer Frontier, B7 Lift Deferred, Base-First Policy Adopted
Round 16 records the AMRAL LUC-FC research line's first finite-depth pilot on the complete five-dimensional global master root (D+B₃+B₅, phase master target T_M=0.8365): a depth-16 A/B test shows the official scheduler has about 18.48% fewer nodes and 21.71% fewer HARD leaves than Round 09's exact-τ scheduler; a full depth-18 profile finds only 8 of 10,448 raw HARD cells with centers within +0.002 of the threshold, showing the raw HARD frontier is far larger than the true near-minimizer frontier; a B7 shallow-lift probe finds B7 should not yet be activated, and the round sets a Base-First / Lift-Later production policy. This round obtains no new lower bound; the global bound a_Leb≥0.835 remains unproven.
[document] Residual Six-Fold Symmetry Yields an Exact Search-Domain Reduction, Measured Nodes Cut Nearly in Half: the D₃ Canonical-Wedge Theorem and a Certified-Prune-Gain Scheduling Pilot
Round 17 (AMRAL-LUC-FC-R17, 2026-09-19/20) proves Theorem 3.1 (the Canonical-Wedge Theorem): the normalized D+B₃+B₅ placement space has a residual D₃ symmetry group (|G|=6, the Reuleaux triangle's own three-fold rotation plus reflection), so the search domain can be exactly restricted to the single 60° wedge 0≤arg t₃≤π/3, implemented via a SYM half-space prune rule that plugs directly into the existing axis-aligned verifier — an exact domain-reduction theorem, not a heuristic speedup. Measured at depth 16: relative to the full root, node count drops by about 47.32% and HARD cells drop by about 32.73%. This round also pilots an independent Certified-Prune-Gain scheduling layer, explicitly separating theorem-critical items (D₃ symmetry, the wedge theorem, SYM prune) from performance-only items (CPG score, the γ parameter, override encoding). The global bound a_Leb≥0.8350 is unaffected by this round and remains COMPUTE-DEFERRED.
[document] Production Shard Checkpoints Pass Independent Replay, and Rice-Coded Sparse Overrides Shrink Both the Raw Stream and the Packaged Artifact: A Lifetime Cost Model Shows Scheduler Choice Depends on Replay Count and Continuation Cost
Round 18 records progress in the AMRAL LUC-FC research line: it turns Round 17's D₃ canonical wedge and Official/Tail-Window CPG scheduling into a production-grade shard checkpoint format built for independent replay (1-bit topology, 2-bit leaf tags, Rice-coded sparse override events). Both the Official (N=12350, PENDING 2766) and Tail-Window (N=10086, PENDING 2048) checkpoints pass replay by a verifier that never reconstructs the CPG scheduling logic; the round also builds a first lifetime cost model (C = E + RV + κP + μB), showing Official is cheaper for a single replay (R*≈31.79) while Tail-Window pays off long-run once each avoided pending leaf would otherwise cost more than about 14.4 ms of continuation work. The global bound a_Leb≥0.835 remains unproven and COMPUTE-DEFERRED.
[document] Lazy Proof Cascade Gains an Equivalence Proof, Necessity-Marker Theorem Established: This Round Uncovers and Corrects a Two-Round Sampling-Heuristic Misjudgment
Round 19 records progress in the AMRAL LUC-FC research line: it proves that the Lazy Proof Cascade and the eager strategy yield exactly the same CERT/HARD classification under a fixed split tree (in the depth 16→18 A/B test, REP calls fell 16.87% and wall time fell 5.78%), and proves the Necessity-Marker Theorem — once a cell contains a verified point whose area is below the threshold, no base-only descendant that still contains that point can ever close. This round also formally logs a self-correction, CORRECTION-R19-001: the sampling-estimated inner-center areas used in Round 16 and 18 had been misread as 12 sub-threshold candidates; recomputing with the exact kernel confirms 0/12 are truly below the threshold, and the semantics have now been explicitly corrected to state they can serve only as a search signal. The global bound a_Leb≥0.835 remains unproven.
[document] The First Concrete Counterexample Appears While the Global Bound Remains Unshaken: B23's Single-Cell Disqualification and the Witness Counterexample Theorem
Round 20 records the only counterexample the AMRAL LUC-FC research line has so far actually found and fully proved: under the mixed base/lift shard grammar, per this round's Witness Counterexample Theorem, an explicit placement (φ≈0.22598188) of the regular 23-gon witness B₂₃ at reference cell-00 gives a 20k support outer bound of 0.83494439<0.835, and is therefore judged unable to be the sole closing witness for that single marked cell — the scope is limited to that one cell's witness eligibility, and does not concern the Lebesgue conjecture itself. This round also discovers a shallow-vs-deep ranking reversal for the B₇ witness, and formally establishes the evidence-driven witness escalation mechanism Necessity→Negative Filter→Shallow Probe→Tail Estimate→Pareto Choice. The global bound a_Leb≥0.835 remains compute-deferred, unaffected by this round.
[document] B7's Deep Tail Becomes a Two-Lobe Phase-Locked Atlas, and the Regular Heptagon Still Wins Out Under a Counterexample-Guided Cutting-Plane Loop: The Finite-Tail Optimism Theorem Proves Why Tail-Fitting Is Always Overoptimistic
Round 21 records how the AMRAL LUC-FC research line turns B7's deep-lift tail (pending volume 2.494×10⁻⁴, 8.327×10⁻⁵, and 3.193×10⁻⁵ at lift depths 22, 24, and 26) into a structured, two-lobe, phase-locked adversarial atlas: measurements of δ_lock=wrap(arg t₇−7φ₇) show arg t₇≈7φ₇ becoming more pronounced as the tail deepens, and witness design is formalized as a cutting-plane minimax loop, proving the Finite-Tail Optimism Theorem (v_(m+1)≤v_m) that explains the tail-fitting overfitting effect. Four tested candidate witness families — a smooth 7-fold wave, a tail-targeted fit, 30 nearby irregular Reuleaux7 candidates, and an early k=3 symmetry-breaking pilot — all fail to robustly beat the regular-B7 baseline of 0.83712806 under a fresh placement oracle. The status ledger closes both the B7 lift-tail atlas and the synthesis loop, but records a new superior witness as not found; B7 remains the primary deep-tail witness. The global bound a_Leb≥0.835 remains unproven and COMPUTE-DEFERRED, unchanged by this round.
[document] Multi-Mode Fourier Legality Compiler and Full-Orientation Oracle Rule Both Close, Yet No New Witness Beats B7: This Round Pivots to a Proof-Cost Pareto Map and a Witness Portfolio
Round 22 records progress in the AMRAL LUC-FC research line: a systematic search for symmetry-breaking Fourier witnesses (a combined family K⊆{3,5,7,9,11} and a separate Pure Harmonic Family k=11,13,17,19) that closes two pieces of infrastructure, the Multi-Mode Fourier Legality Compiler and the Full-Orientation Oracle Rule — proving that any candidate with an active mode k≢0 (mod 7) must be searched over the full φ∈[0,2π) rather than reusing B7's reduced domain [0,2π/7) (concrete case: a restricted-domain optimistic value of 0.83742146 versus a true full-domain value of 0.83583910). The round establishes a Proof-Cost Pareto Vector and a witness-portfolio framework, but finds no new witness that robustly beats regular B7: H11/H13 form a BALANCED AUXILIARY with 6–7×10⁻⁴ forcing margin, H17/H19 a CHEAP/RAZOR-THIN AUXILIARY with only a few ×10⁻⁵ of margin, and all results remain SEARCH-ONLY. The global bound a_Leb≥0.8350 remains compute-deferred.
[document] Strict Incidence Formally Defined, the Witness Portfolio Closure Theorem Proved, yet the 12-Cell Pilot Scores Zero at Depth 16: A Deep Crossover Shows B₇ Overtaking H₁₉, Proof and Scheduling Layers Formally Separated
Round 23 records progress in the AMRAL LUC-FC research line: it upgrades witness selection from ranking 'which witness is strongest on average' to a theorem-level, per-cell judgment, formally defining Strict Incidence and proving the Portfolio Closure Theorem (once a necessity cell has one witness reaching strict closure, the portfolio's lower bound holds on that cell). Constrained by a single round's compute budget, this round tests only the 12 hardest necessity cells × 5 witnesses (60 edges) at lift depth 16 and finds 0 edges COMPLETE — strict weighted set cover is judged INFEASIBLE at this budget (the document states this is the correct result under an insufficient budget, not an algorithm failure, and hands the full 77-cell scan to local runtime via an attached LONG_RUN_SPEC). Pushing the four hardest of those cells to depth 22 shows B₇ overtaking the shallow-metric leader H₁₉ in 3 of the 4 cells, establishing that witness routing must be horizon-aware; the round also formally separates the strict-proof layer from the quantitative-scheduler layer as a production invariant. The global bound a_Leb≥0.835 remains unproven and compute-deferred.
[document] Facing Round 23's 0/60, Verify Before Escalating: Deep Single-Witness B₇ Refutes the Premature Inference That Joint Witnesses Are Needed, Three of the Four Hardest Cells Close on the Spot
Round 24 (AMRAL-LUC-FC-R24, 2026-09-19) records a methodological self-check within the AMRAL LUC-FC research line: Round 23, under 12 necessity-marked cells × 5 witnesses at lift depth 16, produced 60 pilot edges that all scored zero — a result easily over-read as 'escalation to a joint multi-witness search is needed.' This round first deepens, using the single witness B₇ alone, the four hardest reference cells flagged by Round 23, and finds that 3 of them (cell 0 at depth 30, cells 1 and 2 at depth 32) have already reached strict COMPLETE closure, with only cell 3 still PARTIAL (unresolved volume contracted to 1.49×10⁻⁷, with no plateau evidence) — showing that inference was premature. This round formally proves the Joint Dominance Theorem and the Pointwise Joint-Necessity Theorem, and points out that opening a joint search tree prematurely could worsen the cost from L₁+L₂ to L₁×L₂. The atlas beyond these four hardest cells has not yet been systematically rerun, and the global bound a_Leb≥0.835 remains compute-deferred.
[document] Round 23's Shallow 0/60 Was Not Single-Witness Infeasibility: B₇ Alone, Deepened to Depth 30–36, Fully Closes All 12 Reference Cells and Collapses the Joint Residual to Empty
Round 25 (AMRAL-LUC-FC-R25, 2026-09-20) records the AMRAL LUC-FC research line extending the single-witness B₇ deepening strategy — validated by Round 24 on only the four hardest cells — to the complete 12-cell reference subset: all 12 necessity cells reach strict COMPLETE closure at closure depths between 30 and 36 (mean 32.5, deepest 36), across 340,540 total nodes in 12 independent lift trees, with the budget-coverage curve reaching F(36)=12/12=100% and the joint-admissible residual collapsing to empty as Round 24's four-state joint-admission classification converges entirely to JOINT-REDUNDANT. This round also proves the Unresolved-Volume Monotonicity Theorem and shows that pending-leaf counts can mislead (cell 7's pending leaves rise, not fall, from depth 26 to 30, even as its unresolved volume actually contracts about 15-fold), and updates the production scheduler to a B₇-first policy. The source document states plainly that this remains reference/pilot arithmetic covering only the 12-cell subset, not extrapolable to the 77-cell atlas or a global theorem, and that the global bound a_Leb≥0.835 remains compute-deferred.
[document] First Push to the Complete 77-Cell Necessity Atlas: Common Depth d=36 Reaches 51/77, a Unified Global-Pad Proposal Vetoed by Its Own Audit Data Before Activation
Round 26 records the first time the AMRAL LUC-FC research line has pushed its search to the complete 77-cell necessity atlas: at a shared checkpoint depth of d=36, 51/77 (66.23%) cells achieve strict reference B₇ closure, while the remaining 26 residual cells are all still contracting (maximum contraction ratio ρ_max≈0.57615), with no joint-witness necessity evidence yet. This round also formally establishes a production arithmetic ABI, and vetoes a proposed unified 10⁻⁸ global pad — the actual audit shows the smallest observed slack among already-completed leaves is only about 2.8982×10⁻⁹, so applying that pad would silently reopen cells that are already legitimately closed.
[document] First Exact-Arithmetic Leaf Certificates Produced: Rational Inner-Polygon Theorem Established, Cell0's Five Thinnest Leaves Pass 5/5, but Closure Scope Remains Limited to the Existing Reference State
Round 27 records the AMRAL LUC-FC research line's first proof of the Rational Inner-Polygon Theorem: once a point set has been verified by strict interval arithmetic to lie within an already-certified core region, its exact rational convex-hull area is itself a legitimate lower bound, independent of floating-point hull, shoelace, or any transcendental operation. This round also produces the program's first true batch of exact-arithmetic leaf certificates — cell0's five thinnest leaves, 5/5 all PASS, with exact rational margins ranging from about 3.19×10⁻⁸ to 2.03×10⁻⁷. The document explicitly states that this prototype encloses only the existing stored binary64 reference state, not yet a full exact/directed split-semantics reconstruction from the master root, and still falls short of publication-grade rigor — this is the direct technical precursor to the Round 34 RHCert format.
[document] Root Semantics Upgraded from Stored Floats to Exact-Rational Directed Reconstruction: All 9,278 of Cell0's Terminal Leaves Complete Bulk Migration, 9,278/9,278 Pass with Zero Selective Resplits
Round 28 records the AMRAL LUC-FC research line upgrading root and path semantics from enclosing the existing stored binary64 reference state to reconstructing from an exact rational master target (T_M=1673/2000) and directed interval arithmetic: d⋆, t3/t5/t7, and the D3 root are all made directed-interval, and cell0's 40-layer base path now stores an explicit split axis/side bit (measured override count 0). On this foundation, all 9,278 terminal leaves of cell0 undergo margin-adaptive rational inner-polygon bulk migration, yielding 9,278/9,278 PASS, zero selective resplits, zero membership failures, and a thinnest exact rational margin of about 3.1948922738×10⁻⁸, upgrading cell0 to CELL0-ARITHMETIC-MIGRATED-PROTOTYPE. The document states the backend is not yet pinned or independently audited and the 77 necessity markers are not all migrated; the global bound a_Leb≥0.835 remains unproven.
[document] All 77 Cells of the Necessity Atlas Complete Exact-Rational Upper Migration, First Whole-Shard Prototype Closes: Marker 70 Confirmed as Round 28's Complete Lift Cell
Round 29 records how the AMRAL LUC-FC research line migrates every necessity marker (the base-hull upper bound, dual to the witness-tree lower bound migrated elsewhere) of the complete 77-cell necessity atlas into exact rational form in one pass — 77/77 PASS, zero UPPER-INCONCLUSIVE — precisely confirming 77 as the atlas's complete total cell count. The same round confirms that marker 70 is exactly Round 28's complete lift cell, joining the marker upper bound and the B7 lower bound for the first time into this research line's first ARITHMETICALLY-CLOSED-WHOLE-SHARD-PROTOTYPE; of the 77 markers, only 6, 47, and 70 have been independently cross-checked via a second path, the document states plainly that publication_candidate=false, and the global bound a_Leb≥0.835 remains unproven.
[document] Second Independent Implementation Replays the marker70/B7 Shard (9278/9278 Lower Leaves Pass), Backend Now Pinned: Shared Arithmetic Trust Still Blocks Publication-Candidate Status
Round 30 records how the AMRAL LUC-FC research line supplies a second, genuinely independent implementation (A1) for the marker70/B7 whole shard: root/path recomputation of t₃, t₅, and t₇ overlap-PASSes against Round 28's directed root (after fixing a verifier script bug that had perturbed an interval's position by about 10⁻¹⁷, logged as R30-A1-ROOT-001); marker70's upper bound re-verifies PASS via an independent exact cyclic polar hull (margin 9.24985499×10⁻⁵); and all 9278 leaves of the B7 lower tree re-verify under a completely new defining-disk algorithm, 9278/9278 A1-PASS with zero inconclusive. The entire arithmetic backend is now version- and hash-pinned (PINNED-MPMATH-LIBMP-PROTOTYPE-v0.1) and the shard's status rises to A1-VERIFIED-PINNED-PROTOTYPE-SHARD, but because both implementations still share one backend, backend trust independence remains incomplete, the document withholds promotion to publication-candidate, and the global bound a_Leb≥0.835 remains unproven.
[document] Independent Second Arithmetic Backend libMPFR/GMP Clears Full Replay, marker70/B7 Shard Becomes the Research Line's First Publication Candidate: Root, Upper Bound, and All 9,278 Lower Leaves Pass, Global Bound Still Unproven
Round 31 records the AMRAL LUC-FC research line's discovery of its first system-level second independent arithmetic backend, libMPFR 4.2.2 + GMP (called directly via the C ABI/ctypes), and uses it to fully re-verify the marker70/B7 whole shard: root intervals t3, t5, t7 all overlap-PASS against the Round 28 mpmath/libmp intervals; the marker70 upper bound recomputes to 0.8349075014501105<0.835 (margin≈9.24985499×10⁻⁵); and the full lower tree passes at 9278/9278 leaves with 0 inconclusive (thinnest margin≈3.5423707501×10⁻⁹). With two independent backends now each passing the root, the upper bound, and every lower leaf, marker70/B7 becomes the research line's first shard to reach PUBLICATION-CANDIDATE-SHARD status. This round also logs a self-correction, R31-MPFR-MARKER-001: an initial MPFR marker check included overly broad adjacent-sector candidates, producing a safe but overly conservative false negative (U≈0.9201), fixed by restricting to genuinely active pieces. The document states plainly that this is not a formal verification of MPFR/GMP itself; the global bound a_Leb≥0.835 remains unproven, and the geometry residual (Γ_B7(36)=51/77) is also still incomplete.
[document] Proof Progress Becomes a Staged Coverage Dashboard for the First Time: Cell69 Reaches PUBLICATION-CANDIDATE-SHARD Status as Geometry Completion Climbs to 66/77
Round 32 records the AMRAL LUC-FC research line's first split of proof progress into a staged coverage dashboard (Geometry→Arithmetic→Publication Candidate): three new strict geometry closures this round (cell31 at depth 42, cell27 at depth 44, cell7 at depth 46) bring known geometry-complete cells to 66/77, though the only fully synchronized common-budget result remains the depth-36 Γ_B7(36)=51/77; cell69 completes dual-backend arithmetic verification (mpmath/libmp and MPFR, including one fail-closed INCONCLUSIVE-to-PASS case resolved by raising sample density) and becomes the second PUBLICATION-CANDIDATE-SHARD (with the existing marker70, reaching 2/77); cell47 completes its rational lower verification and becomes ARITHMETICALLY-CLOSED-PROTOTYPE (3/77), but has not yet completed MPFR cross-backend replay. The global bound a_Leb≥0.835 remains unproven.
[document] cell47, cell48 Clear Dominance Audit With Zero Failures, Yet Still Refuse Promotion to Publication-Candidate: Cross-Backend Enclosure Dominance Cuts Re-Verification Scale to About One-Sixth
Round 33 records the AMRAL LUC-FC research line's proposal of the Cross-Backend Enclosure Dominance Theorem: it compresses the second independent backend's audit of the common-core enclosure from regenerating every leaf polygon into verifying a containment relation, cutting cell47's re-verification state from 9,228 leaves to 1,564 unique witness-core states, and cell48's from 9,285 to 1,574 — about one-sixth. Applied to cell47 and cell48, whose geometry was already known to be correct, the dominance audit passes with zero failures on both, and cell48's rational lower-bound migration reaches 9285/9285 PASS, raising the arithmetic-closed-or-better tier from 3/77 to 4/77. But this round explicitly states that this is a computation summary, not an independently replayable finite certificate entity, so cell47 and cell48 are not promoted to publication-candidate — that tier remains at 2/77; this gap is filled in the next round, Round 34, by the RHCERT-v0.1 format. The global bound a_Leb≥0.835 remains unproven.
[document] Rational-Hull Certificates Become Independently Replayable for the First Time, No New Geometric Progress This Round: RHCERT-v0.1 Doubles Publication Candidates to 4/77
Round 34 records the AMRAL LUC-FC research line's introduction of RHCERT-v0.1, a binary replayable rational-hull certificate format: RHCert stands for Rational-Hull CERTificate, unrelated to the Riemann Hypothesis apart from a two-letter coincidence. Cell47 (2,163,069 vertices, 9228/9228 leaves PASS) and cell48 (2,109,700 vertices, 9285/9285 leaves PASS) are re-emitted in this format and pass byte-level, leaf-by-leaf replay by an independent verifier, raising the publication-candidate tier from 2/77 to 4/77; with cell68 also promoted to arithmetically-closed-prototype, the arithmetic-closed-or-better tier reaches 5/77. This round performed no new global geometric search — geometry-complete remains at 66/77 — and the global bound a_Leb≥0.835 remains unproven.
[document] RHCERT-v0.1 Advances From Format Experiment to Repeatable Mass Production, cell68 Promoted to Publication-Candidate: Publication-Candidates Reach 5/77, cell75/76 Await Only Certificate Bytes
Round 35 records the AMRAL LUC-FC research line carrying RHCERT-v0.1 from Round 34's two-cell format experiment into repeatable mass production: cell68 passes bytes-only replay across all 9255 of its 9255 leaves (0 failures; raw RHCERT 35,940,305 bytes, 2,126,336 vertices, minimum margin 2.2329×10⁻⁸), and is formally promoted to PUBLICATION-CANDIDATE-SHARD, raising the publication-candidate tier from 4/77 to 5/77. cell75 (10948/10948 lower PASS) and cell76 (10932/10932 lower PASS) have both closed their mathematics and cross-backend audits, but the document states plainly that both are still missing only their concrete RHCERT bytes and are not yet promoted; together with them, arithmetic-closed-or-better reaches 7/77 while geometry-complete remains at 66/77. This round also identifies a geometry-frontier durability gap and specifies the DFRONT-v0.1 persistence format, though only as a specification — not yet applied to any real recovery. The global bound a_Leb≥0.835 remains unproven.
[document] All Seven Seats of the Depth-30 Batch Advance to Publication-Candidate, DFRONT Completes Its First Real Recovery: cell33's Lost Frontier Exactly Rebuilt, Zero Error
Round 36 records two closures in the AMRAL LUC-FC research line: the depth-30 batch's last two cells — 75 (10,948 leaves) and 76 (10,932 leaves) — passed 10,948/10,948 and 10,932/10,932 bytes-only replay respectively, bringing all seven cells {47,48,68,69,70,75,76} to complete the Depth-30 Publication Batch (7/7), contributing to the global publication-candidate tier at 7/77 (≈9.09%). In the same round, the DFRONT-v0.1 format completes its first real geometry recovery: cell33's previously lost depth-36 search frontier is deterministically rebuilt from the witness root, exactly matching the Round 26 ledger — 129,401 nodes, 14,027 pending leaves, absolute volume error of 0. The global bound a_Leb≥0.835 remains unproven.
[document] Three Seats Cross the Publication Threshold While the Unresolved Boundary Keeps Widening: Depth-32 Migration and Composable DFRONT Extension
Round 37 records the latest progress in the AMRAL LUC-FC research line: the depth-32 queue's first three cells (49, 64, 66) complete full rational lower-bound migration and independent MPFR upper-bound cross-verification, raising the publication-candidate tier from 7/77 to 10/77. In the same round, cell 33's durable frontier is extended from depth 36 to depth 42 via the newly-proposed Compositional DFRONT Merge Theorem — its residual volume shrinks to about 8.7% of the original value, but its unresolved box count rises from 14,027 to 78,507, and the global bound a_Leb≥0.835 remains unproven.
[document] UESFCM v0.1 (Unbounded Expansion–Self-Referential Finite Closure Methodology): Anchoring Unbounded Method Search onto a Single Fixed Target Proposition Q* via Mandatory LinkBack Classification and Finite Closure States
UESFCM v0.1 is a general research methodology designed by Neo.K and formalized by Aletheia/GPT-5.6 Sol: it locks onto a single mathematical proposition Q* as the canonical target, permits unbounded expansion of method, representation, and computation, but forces repeated self-referential convergence via LinkBack classification and finite closure states, stopping only when one of ProofClosed, CounterexampleClosed, IndependenceClosed, TARGET-FAILURE, or SEARCH-STALLED holds. In the Lebesgue Universal Covering Problem, it is applied to a still-incomplete 17-round B7 witness-exchange sub-series that yields only a qualitative improvement.
[document] A finite-closure programme for Lebesgue's universal covering problem
Lebesgue Universal Covering Problem · III · Crystallization: A finite-closure programme for Lebesgue's universal covering problem — Certified progress, target ledgers, and an independent recomputation
[branch-hub] III · Crystallization
Lebesgue Universal Covering Problem · III · Crystallization: The papers of this line
[document] Replaying large geometric certificates without trusting their producer
Lebesgue Universal Covering Problem · III · Crystallization: Replaying large geometric certificates without trusting their producer — Integer intervals, an exact root and a decodable certificate format, on a lower-bound programme for Lebesgue's covering problem
[document] A certified finite reduction for Lebesgue's universal covering problem
Lebesgue Universal Covering Problem · III · Crystallization: A certified finite reduction for Lebesgue's universal covering problem — From sets of diameter one to finitely many checkable inequalities, with every error term explicit
[document] Does the Reuleaux heptagon raise the three-body value? A far-set route and how far its certificates go
Lebesgue Universal Covering Problem · III · Crystallization: Does the Reuleaux heptagon raise the three-body value? A far-set route and how far its certificates go — An exact gate, erosion certificates in exact arithmetic, a gate that is not established, and a configuration below 0.835, on Lebesgue's universal covering problem
[branch-hub] II · Computation and Reproduction
Lebesgue Universal Covering Problem · II · Computation and Reproduction: The Lebesgue case's second layer: all 42 documents independently recomputed, RUN-001 to RUN-068
[document] BCODR: the method and LUC 01–05 and 07
BCODR · Bidirectional Circular Overlap Decomposition · II · Computation and Reproduction: BCODR: the method and LUC 01–05 and 07
[document] DLMVC: the method itself, and its four deep lagged passes on Round 04
DLMVC · Deep-Lag Verification Methodology · II · Computation and Reproduction: DLMVC: the method itself, and its four deep lagged passes on Round 04
[document] LESR: Papers 00–09B and the midpoint handoff
LESR · Skew-Field Variational Reconstruction · II · Computation and Reproduction: LESR: Papers 00–09B and the midpoint handoff
[document] Round 00 · The methodology freeze: the external baseline, the support-function interface and the governance rules
Round 00 · Methodology Freeze · II · Computation and Reproduction: Round 00 · The methodology freeze: the external baseline, the support-function interface and the governance rules
[document] Round 01: the reduction chain holds, and the reflection branch is made explicit
Round 01 · Descent Start · II · Computation and Reproduction: Round 01: the reduction chain holds, and the reflection branch is made explicit
[document] Round 02: the finite shape compiler holds, and its error bound is safe by a wide margin
Round 02 · Finite Shape Compiler · II · Computation and Reproduction: Round 02: the finite shape compiler holds, and its error bound is safe by a wide margin
[document] Round 03: the placement certificate holds, and its sanity example could not have failed
Round 03 · First Self-Correction · II · Computation and Reproduction: Round 03: the placement certificate holds, and its sanity example could not have failed
[document] Round 04: the cover compiler holds; its sanity polygon is not quite the one it defines
Round 04 · Boundary Compiler · II · Computation and Reproduction: Round 04: the cover compiler holds; its sanity polygon is not quite the one it defines
[document] Round 05: the saturation theory holds; its sanity test could not have caught a wrong bound
Round 05 · Saturation Gate · II · Computation and Reproduction: Round 05: the saturation theory holds; its sanity test could not have caught a wrong bound
[document] Round 06: the exchange compiler holds; its seed ladder is exact at the second rung and strict at the third
Round 06 · Witness Exchange Compiler · II · Computation and Reproduction: Round 06: the exchange compiler holds; its seed ladder is exact at the second rung and strict at the third
[document] Round 07: the lifting theorems hold, every external number checks, and one recorded lift is not a minimum
Round 07 · Minimizer Atlas · II · Computation and Reproduction: Round 07: the lifting theorems hold, every external number checks, and one recorded lift is not a minimum
[document] Round 08: the proof grammar holds, two hard leaves close at 10⁻⁴, and the verifier has no root for a mirror image
Round 08 · Conditional-Lift Certificate · II · Computation and Reproduction: Round 08: the proof grammar holds, two hard leaves close at 10⁻⁴, and the verifier has no root for a mirror image
[document] Round 09: the cost layer is sound, the common core closes cells 2.2× wider than the representative prune, and dominance pruning has nothing to prune
Round 09 · Adaptive Atlas Refinement · II · Computation and Reproduction: Round 09: the cost layer is sound, the common core closes cells 2.2× wider than the representative prune, and dominance pruning has nothing to prune
[document] Round 10: the reference certificate replays and re-emits byte for byte, the exact core clears every leaf by 3.8×10⁻⁴, and the split's tie-break lives only in the code
Round 10 · Reference Dry Run · II · Computation and Reproduction: Round 10: the reference certificate replays and re-emits byte for byte, the exact core clears every leaf by 3.8×10⁻⁴, and the split's tie-break lives only in the code
[document] Round 11: the frontier theorems hold and the reference shards merge, but the digests and boxes cannot be rebuilt from the text, and the depth forecast is not a bound
Round 11 · Sharded Certificate Architecture · II · Computation and Reproduction: Round 11: the frontier theorems hold and the reference shards merge, but the digests and boxes cannot be rebuilt from the text, and the depth forecast is not a bound
[document] Round 12: the checkpoint machinery works, but three stored aggregates contradict their ledgers and a rejected certificate comes back unchanged
Round 12 · Checkpoint Crystal · II · Computation and Reproduction: Round 12: the checkpoint machinery works, but three stored aggregates contradict their ledgers and a rejected certificate comes back unchanged
[document] Round 13: the merge rules are sound and the race replays, but the reference merger never writes the aggregate and cannot hold two valid certificates
Round 13 · Autonomous Scheduler & Merger · II · Computation and Reproduction: Round 13: the merge rules are sound and the race replays, but the reference merger never writes the aggregate and cannot hold two valid certificates
[document] Round 14: the migration rules hold and compaction keeps readiness, but the reported capacity jumps above a failed target and the hot core drops the evidence that matters
Round 14 · Semantic Rebase & Compaction · II · Computation and Reproduction: Round 14: the migration rules hold and compaction keeps readiness, but the reported capacity jumps above a failed target and the hot core drops the evidence that matters
[document] Round 15: the capacity algebra is exact, but the local proof's capacity is 0.835, not 0.8350003545 — its B7 lift root was sized for 0.835
Round 15 · Proof Capacity Ladder · II · Computation and Reproduction: Round 15: the capacity algebra is exact, but the local proof's capacity is 0.835, not 0.8350003545 — its B7 lift root was sized for 0.835
[document] Round 16: every pilot number rebuilds, but its frontier profile measures its 40-direction sampling; APR can never fire on this root, and 19 HARD cells hold configurations below 0.835
Round 16 · Global Master-Root Pilot · II · Computation and Reproduction: Round 16: every pilot number rebuilds, but its frontier profile measures its 40-direction sampling; APR can never fire on this root, and 19 HARD cells hold configurations below 0.835
[document] Round 17: the D3 quotient is exact and every run rebuilds; the quotient's gain is understated, and the tail window's edge comes from a changed override rule, not from starting at depth 10
Round 17 · D₃ Symmetry Reduction · II · Computation and Reproduction: Round 17: the D3 quotient is exact and every run rebuilds; the quotient's gain is understated, and the tail window's edge comes from a changed override rule, not from starting at depth 10
[document] Round 18: both checkpoints decode, re-prove and re-emit byte for byte; the tail forest is not Round 17's tail window, three conventions of the format are unstated, and the shipped verifier never reads the pending frontier
Round 18 · Production Shard Checkpoint · II · Computation and Reproduction: Round 18: both checkpoints decode, re-prove and re-emit byte for byte; the tail forest is not Round 17's tail window, three conventions of the format are unstated, and the shipped verifier never reads the pending frontier
[document] Round 19: every tree, bracket and probe rebuilds; lazy evaluation changes nothing but cost; the depth-20 recheck is complete; the B7 floor is mostly the pilot's sampling
Round 19 · Lazy Proof Cascade · II · Computation and Reproduction: Round 19: every tree, bracket and probe rebuilds; lazy evaluation changes nothing but cost; the depth-20 recheck is complete; the B7 floor is mostly the pilot's sampling
[document] Round 20: every tree, marker and placement rebuilds; the package ships no code; its search minima are not minima; with exact cores B7 closes all seven marked cells it was run on
Round 20 · First Counterexample · II · Computation and Reproduction: Round 20: every tree, marker and placement rebuilds; the package ships no code; its search minima are not minima; with exact cores B7 closes all seven marked cells it was run on
[document] Round 21: the tail atlas rebuilds box by box, and every box closes with exact cores; the synthesis search values sit below the true minima
Round 21 · Two-Lobe Phase-Lock · II · Computation and Reproduction: Round 21: the tail atlas rebuilds box by box, and every box closes with exact cores; the synthesis search values sit below the true minima
[document] Round 22: the legality rules and the lift pilot rebuild exactly; with dense cores the Pareto map's volume axis inverts, and the "cheap" harmonics cannot close their cell
Round 22 · Fourier Pareto Search · II · Computation and Reproduction: Round 22: the legality rules and the lift pilot rebuild exactly; with dense cores the Pareto map's volume axis inverts, and the "cheap" harmonics cannot close their cell
[document] Round 23: the strict-incidence grammar is sound and the B7 edges rebuild exactly; with exact cores B7 closes all twelve cells, and no harmonic can close any
Round 23 · Strict Cover Scores Zero · II · Computation and Reproduction: Round 23: the strict-incidence grammar is sound and the B7 edges rebuild exactly; with exact cores B7 closes all twelve cells, and no harmonic can close any
[document] Round 24: the first complete-edge certificate rebuilds bit for bit; the tail numbers mix two bounds, and cell 3 closes too
Round 24 · Refuted Premature Escalation · II · Computation and Reproduction: Round 24: the first complete-edge certificate rebuilds bit for bit; the tail numbers mix two bounds, and cell 3 closes too
[document] Round 25: all twelve B7 closures rebuild node for node; the recorded closure depths are checkpoints, and six cells close a level earlier
Round 25 · Single-Witness Full Closure · II · Computation and Reproduction: Round 25: all twelve B7 closures rebuild node for node; the recorded closure depths are checkpoints, and six cells close a level earlier
[document] Round 26: all 77 necessity cells rebuild row for row under the package's pad; the thinnest leaf in the atlas clears T by 8.5×10⁻¹¹, not 2.9×10⁻⁹
Round 26 · Full 77-Cell Atlas · II · Computation and Reproduction: Round 26: all 77 necessity cells rebuild row for row under the package's pad; the thinnest leaf in the atlas clears T by 8.5×10⁻¹¹, not 2.9×10⁻⁹
[document] Round 27: at a common depth 40 the residual's lower bounds are exact, 57 by 38 and 63 by 40; the five thinnest leaves certify again under this tree's own integer intervals, and seven more
Round 27 · First Exact Certificate · II · Computation and Reproduction: Round 27: at a common depth 40 the residual's lower bounds are exact, 57 by 38 and 63 by 40; the five thinnest leaves certify again under this tree's own integer intervals, and seven more
[document] Round 28: the directed root and all 9,278 leaves of cell 0 check under this tree's own arithmetic; no leaf needs the 16,384-direction density; and this tree's exact kernel loses a piece on one leaf
Round 28 · Exact Root Bulk Migration · II · Computation and Reproduction: Round 28: the directed root and all 9,278 leaves of cell 0 check under this tree's own arithmetic; no leaf needs the 16,384-direction density; and this tree's exact kernel loses a piece on one leaf
[document] Round 29: all 77 necessity markers certify again, with 128–256 normals once the hull's bridging edges get their own; the package's polygons lose first order at those edges, so its thinnest marker is not the thinnest
Round 29 · Confirms the 77-Cell Total · II · Computation and Reproduction: Round 29: all 77 necessity markers certify again, with 128–256 normals once the hull's bridging edges get their own; the package's polygons lose first order at those edges, so its thinnest marker is not the thinnest
[document] Round 30: the whole shard passes again here, and the second implementation's lower ledger comes back leaf for leaf from its own rule; that rule keeps one contact point per direction, so its thinnest leaf measures the rule's loss, not the geometry
Round 30 · A1 Replay & Backend Pinning · II · Computation and Reproduction: Round 30: the whole shard passes again here, and the second implementation's lower ledger comes back leaf for leaf from its own rule; that rule keeps one contact point per direction, so its thinnest leaf measures the rule's loss, not the geometry
[document] Round 31: the second backend's root, marker and 9,278 leaves pass again here, and its lower ledger is Round 30's leaf for leaf — the same polygons, their membership decided again in MPFR; the queue is this tree's atlas; the wrapper rounds its exact inputs to nearest, so §3's directed rule holds for its outputs only
Round 31 · Cross-Backend Publication Candidate · II · Computation and Reproduction: Round 31: the second backend's root, marker and 9,278 leaves pass again here, and its lower ledger is Round 30's leaf for leaf — the same polygons, their membership decided again in MPFR; the queue is this tree's atlas; the wrapper rounds its exact inputs to nearest, so §3's directed rule holds for its outputs only
[document] Round 32: cells 31, 27 and 7 close here too, continued from this tree's own frontier at 40 — at depths 42, 43 and 45, inside the even checkpoints 42, 44 and 46 the round reports; cells 69 and 47 are the shipped trees node for node, every leaf passes, and cell 69's MPFR ledger is its own rule rebuilt, the escalated leaf included
Round 32 · Bulk Publication-Candidate Migration · II · Computation and Reproduction: Round 32: cells 31, 27 and 7 close here too, continued from this tree's own frontier at 40 — at depths 42, 43 and 45, inside the even checkpoints 42, 44 and 46 the round reports; cells 69 and 47 are the shipped trees node for node, every leaf passes, and cell 69's MPFR ledger is its own rule rebuilt, the escalated leaf included
[document] Round 33: the dominance theorem is right and the four new trees rebuild node for node; its audits rest on MPFR, not recomputed here — and the certificates the ledgers do not keep, this tree regenerates from density and rule
Round 33 · Self-Refused Promotion · II · Computation and Reproduction: Round 33: the dominance theorem is right and the four new trees rebuild node for node; its audits rest on MPFR, not recomputed here — and the certificates the ledgers do not keep, this tree regenerates from density and rule
[document] Round 34: the certificates are real — both RHCERT files decode from their specification alone and all 4,272,769 stored vertices check out in this tree's own integer arithmetic; cell 68's summary comes back from this tree's certificates
Round 34 · RHCert Origin · II · Computation and Reproduction: Round 34: the certificates are real — both RHCERT files decode from their specification alone and all 4,272,769 stored vertices check out in this tree's own integer arithmetic; cell 68's summary comes back from this tree's certificates
[document] Round 35: cell 68's certificate is this tree's own, leaf for leaf — every density and hull count agrees, and every one of its 2,126,336 vertices checks out here; cells 75 and 76 certify here too; the lost frontier is noted, not guessed
Round 35 · RHCERT Mass Production · II · Computation and Reproduction: Round 35: cell 68's certificate is this tree's own, leaf for leaf — every density and hull count agrees, and every one of its 2,126,336 vertices checks out here; cells 75 and 76 certify here too; the lost frontier is noted, not guessed
[document] Round 36: cells 75 and 76's certificates check out here, vertex for vertex; cell 33's DFRONT file is this tree's own depth-36 frontier, written here byte for byte; cell 49's tree hashes to its manifest
Round 36 · Depth-30 Batch & cell33 Recovery · II · Computation and Reproduction: Round 36: cells 75 and 76's certificates check out here, vertex for vertex; cell 33's DFRONT file is this tree's own depth-36 frontier, written here byte for byte; cell 49's tree hashes to its manifest
[document] Round 37: the three depth-32 certificates are this tree's own, leaf for leaf; cell 33's continuation to depth 42 is this tree's, every checkpoint and all 166 segment files byte for byte; the merge never checks the premise its theorem rests on
Round 37 · Latest Progress · II · Computation and Reproduction: Round 37: the three depth-32 certificates are this tree's own, leaf for leaf; cell 33's continuation to depth 42 is this tree's, every checkpoint and all 166 segment files byte for byte; the merge never checks the premise its theorem rests on
[document] UESFCM: the method and its seventeen Lebesgue cycles
UESFCM · Unbounded Expansion Self-Referential Closure · II · Computation and Reproduction: UESFCM: the method and its seventeen Lebesgue cycles

legendre · 13

[case-hub] Legendre's Conjecture: The Base-Space Prime-Fitting Program
AMRAL case: Neo.K × AI collaboration's Legendre base-space prime-fitting operator program (the Program plus Phases 1–32) — 'there is always a prime between consecutive squares' is rewritten as a prime-fitting operator, audited on finite ranges, repeatedly corrected by its own retractions, and reduced step by step to a torically coupled three-GAP energy problem; every document says 'Legendre proof status: OPEN'.
[document] Legendre Base-Space Prime-Fitting Program
A methodological reconstruction and research program; the paper says it does not claim to complete Legendre's conjecture, and its closing block reads 'Legendre proof status: NOT PROVEN'.
[document] Canonical Algebraic Consecutive-Square Base Space
An equivalent reformulation, not a proof of Legendre (the paper: 'Theorem 15.1 is an equivalent reformulation, not a proof of Legendre').
[document] Operator Audit, Closed-Loop Canonicalization and the Historical Obstruction Theorem
An explicit self-correction: the open-loop operator of Phase 2 is falsified as the canonical fitter. The 'historical obstruction theorem' is in essence a restatement of trial division.
[document] Square-Anchored Obstruction Residue Field, Atomic Reduction and the Exact Sieve Identity
An exact restatement of classical sieve identities plus two scoping no-gos.
[document] Canonical Fit-Ordered Fiber, Fixed-Point Depth and the Low/High Obstruction Decomposition
An honest negative result: the rank-1 prime section is falsified (17.15%) and the position formula has no advantage over scanning from the left edge.
[document] Dynamic Obstruction Horizon, Factor Shells and the Sieve-Critical Gap
An elementary horizon theorem plus an account of the parity barrier projected onto this base space.
[document] The Square P₂ Boundary and Bilinear Semiprime Capacity: Cube-Root RootRough, Least-Factor Rows, Cofactor Switching and the Buchstab log 2 Margin
An exact structural reduction (primes = cube-root-rough survivors − semiprime rows) plus a no-go for the standard linear sieve at s = 3/2. Legendre's conjecture remains unproved.
[document] The Square-Anchored P₂ Constant Ledger: the Rough-Lower Gate, the Bilinear Semiprime Upper Bound and the Parity-Signed Reformulation
The heuristic main-term constant ledger passes and the crossing of the current black-box providers fails: the paper writes that failure 'comes from provider strength, not from the architecture's main-term constant'. Legendre's conjecture remains unproved.
[document] Square-Anchor Type-I / Type-II Information Audit and the P₂ Literature Correction (with the Errata for Phases 12–14)
Retracts the P₂ frontier statement of Phases 12–14: 'the unconditional every-square frontier is P₃ and P₂ is not known' is 'incorrect'; the cube-root-rough set S₃ remains a stronger statement; the genuinely open target is 'prime occupancy / parity closure'.
[document] The Type-I / Type-II Coverage Polytope: the Exact Square-Root Localization Gate, the Weighted Reciprocal Gap and a Localization of the Minimal Gap
A literature map and scoping; no new proof claim for Legendre (the header says so).
[document] The Landing-Graph Moment Hierarchy and GCD Stratification: Fourth-Order Bulk Mixing, Large-GCD Closure, the Sixth-Order Closure Gate and the Primitive Correlation Triangle
A conditional theorem (assuming a sixth-moment bound) plus partial deterministic closures; the paper: 'this is still only analytic provider closure, not the completion of the whole sieve architecture for Legendre'.
[document] The Fully Nondegenerate Toric Core: the Opposite-Pair Three-GAP Normal Form, Alternating Product Conservation, Opposite-GCD Defect and Multiplicative Slope Coupling
The end of the series: the fully nondegenerate core is reduced to a torically coupled three-GAP energy problem; full CRE6, the BA6 exact-zero provider and Legendre's conjecture all remain OPEN.

licensing · 1

[utility-page] AI content licensing
AMRAL AI content licensing: human reading and ordinary search are free; commercial AI training, retrieval, generated answers and AI indexing require a licence. Licensor, scope and how to apply.

links · 1

[utility-page] Links
A machine-readable hyperlink graph of the whole AMRAL site: every page is a node, and its relationships to others — parent/child, previous/next, language mirror, related case — are typed edges. For human readers, this is a second way to browse as the site's content keeps growing past what chronological ordering can scale to; for AI/agents, it's a structured site map that needs no HTML scraping.

methodology · 6

[case-hub] Methodology
AMRAL-Core methodology summary: Result-Induced Intermediate Theorem Generation (RIITG), Reverse Axiom Backfilling (RAB), Knowledge-Conditioned Proof-Space Enumeration (KCPE), and the Autonomous Mathematical Research Agent Loop (AMRAL). This is AMRAL Research Lab's original core methodology, not a mandatory requirement for every research case. Includes links to all three original papers in full.
[document] Autonomous Mathematical Research Agent Loop
Autonomous Mathematical Research Agent Loop (AMRAL) — a preliminary architecture for result-induced intermediate theorem generation, reverse axiom backfilling, and knowledge-conditioned proof-space enumeration (KCPE).
[document] From Transient Axioms to Backfillable Bridges
From Transient Axioms to Backfillable Bridges: result-induced intermediate-proposition reconstruction in the Riemann Hypothesis case. Series paper one of the methodology sequence, a non-proof-bearing reverse-structural-design experiment.
[branch-hub] III · Crystallization
Methodology · III · Crystallization: The papers of this line
[document] Verifying machine-assisted mathematics: one instrument built to fail, run on four research programmes, and what it found about itself
Methodology · III · Crystallization: Verifying machine-assisted mathematics: one instrument built to fail, run on four research programmes, and what it found about itself — Corpus identity by content hash, one gate per document, recomputation that never runs the author's code, and a mutation drill on every gate — applied to a Birch–Swinnerton-Dyer programme, a Collatz programme, a Lebesgue covering programme and a Moser worm programme; with the instrument's own failures, classified, as the main result
[document] Result-Induced Intermediate Theorem Generation and Reverse Axiom Backfilling
Result-Induced Intermediate Theorem Generation (RIITG) and Reverse Axiom Backfilling (RAB). Series paper two of the methodology sequence, the general methodology draft.

moser · 37

[case-hub] Moser's Worm Problem
AMRAL case: Moser's Worm Problem. Linear programming over support functions to find the critical container scaling factor, benchmarked against literature-certified results (the disk, the 30° sector, the Wetzel triangle), with round-by-round adversarial curve search strengthening the representational power of the candidate curve family. The original engineering packages are unmodified, with a full round-by-round trail.
[document] Support-Skew Linear Programming, Finite-Curve Pressure, and the First Adversarial Search
Moser Skew Lab Round 1: support-skew linear programming, finite-curve pressure, and the first adversarial search. Uses linear programming at fixed rotation to solve for the optimal translation or the minimal container scale, benchmarked against a disk, a 30° sector, and the Wetzel triangle; tests 35 candidate curves and completes 5 generations of adversarial curve search. Does not constitute a new upper or lower bound for the Moser problem.
[document] The Complete Phase Contact-Interval Map, Envelope Derivatives, and a Global Numerical Exclusion Ledger
Moser Skew Lab Round 10: splits the entire phase circle into 18 intervals of active support identity, computes derivatives via the envelope theorem (without explicitly differentiating the support-point location), and enumerates all 12 smooth stationary points and 17 contact switches, building a per-interval minimum “global exclusion ledger.” Four phase resolutions (32768 to 262144) all consistently confirm that 270° remains the global minimum, with the closest competitor at 120°, a gap of about 1.64e-9.
[document] Exact Contact Boundaries, Derivative Interval Boxes, and a Dedicated 120°/270° Difference Certificate
Moser Skew Lab Round 11: rewrites all 18 contact boundaries as exact closed-form expressions, builds 579 adaptive derivative interval boxes (0 unresolved) and 12 stationary-point root boxes, and gives the first explicit error box for the 10⁻⁹-level 120°/270° competition: s₁₂₀-s₂₇₀∈[1.635e-9,1.642e-9], strictly positive. Self-declared as a semi-verified certificate — substantially stronger than grid scanning, but not full directed-rounding throughout, and still short of the rigorous certificates from dedicated interval libraries such as Arb/MPFI.
[document] Independent mpmath.iv Replay, Interval Newton, and the Arb-Absent Boundary
Moser Skew Lab Round 12: with no python-flint/Arb/Sage available in the environment, directed-interval arithmetic via mpmath.iv is used as an independent fallback verification. The two most critical differences (120°-270°, smooth candidate minus event control) both replay successfully and independently, strictly positive; 19/19 closed-form boundaries and 12/12 stationary-point root boxes pass. But only 5/17 boundaries can be directly signed (the rest suffer dependency inflation), and the 579 leaf boxes could not be fully replayed — honestly recorded as “not completed” rather than written up as “passed.”
[document] The Smooth Five-Parameter Event–KKT System, Isolation, and Peak Correction
Moser Skew Lab Round 13: upgrades Round 8's smooth candidate into a formal 12-unknown five-parameter event–KKT system (four-branch equal height + dual stationarity + branch-pressure balance), obtaining a minute correction s=0.998914343297485 (only about 4.2e-9 higher than Round 8). The 12x12 Jacobian is full rank but has a condition number of about 3.77e7, highly ill-conditioned — supporting numerical isolation but not robust interval invertibility. All 20/20 random-perturbation basin tests converge back to the same root.
[document] Two-Peak Curvature Splitting, Chirality Breaking, and Single-Peak Local Stability
Moser Skew Lab Round 14: tests whether Round 13's single-peak candidate is merely a spurious isolated point produced by a restricted parametrization. The best solution from a two-peak search collapses back to near-single-peak (peak separation about 3.3e-6); in an 80-point two-dimensional survey of center and width chirality offsets, the best nonzero point is always worse than zero offset. The single-peak mirror-symmetric candidate is locally stable in every direction tested. The round also records and excludes a spurious improvement caused by a coordinate error in one version (the right-wing center mistakenly set to c instead of 1-c), which was not carried into the conclusions.
[document] Curvature-Function Mode Spectrum, Hidden-Branch Opening, and a New Finite-Mode Candidate
Moser Skew Lab Round 15, round 15/15, concludes the series. It builds an eight-member orthogonal curvature-mode basis; the pressure-projected Hessian has 7 negative eigenvalues plus 1 small positive eigenvalue (1.33e-6) — so Round 13's candidate is not a strict local maximum in this space. Ascending along the Newton direction, a new ninth local minimum begins to appear at m≈2.2 and takes over by about m≈3.228. Taking the in-window candidate gives s=0.998914480716946, an improvement of about 1.37e-7, but the global minimum is nearly exactly tied between the 120° and 270° neighborhoods (a gap of only 2.8e-15).
[document] Phase Jumps, the Dual Contact-Pressure Ledger, and Topology-Guided Curve Search
Moser Skew Lab Round 2: dual contact-pressure ledger, full phase sweep, and topology-guided three-link search. A three-link candidate is found approaching the certified Wetzel scale, but exact re-verification exposes a false alarm — an orientation-preserving scale exceeding 1 does not refute the Wetzel covering result, since the paper permits reflection; chirality correction is completed.
[document] Contact-Ledger Reverse Generation, Mirror-Symmetric Multi-Link Curves, and a Degrees-of-Freedom Validity Test
Moser Skew Lab Round 3: contact-ledger reverse generation, mirror-symmetric multi-link curves, and a degrees-of-freedom validity test. The five-link curve outperforms the three-link curve, but the seven-link curve does not outperform the five-link curve — revealing that the currently effective degrees of freedom are not the number of segments, but rather whether the lowest placement branch can be raised; a four-contact skeleton structure with double-endpoint contact on the hypotenuse is found.
[document] Phase-Branch Ledger, Sensitivity Matrix, and Four-Branch Equalization
Moser Skew Lab Round 4: the phase-branch ledger, the sensitivity matrix, and four-branch equalization. Directly solves the max-min equalization problem for the four lowest phase branches, raising the five-link critical scale from 0.998754371668 to 0.998903750476. The four branches use distinct contact topologies, and the sensitivity matrix shows that no single direction can raise all four branches simultaneously.
[document] Contact-Event Equations, a Non-Smooth KKT System, and an Isolated Five-Link Candidate
Moser Skew Lab Round 5: writes the four cusp contact events as exact analytic phase formulas, adds branch-pressure stationarity conditions, and assembles a combined event-KKT system of 9 equations in 9 unknowns, numerically solving for the isolated candidate s=0.998903757132509. The 9x9 Jacobian is full rank, and all 40 randomly perturbed initial values converge back to the same root.
[document] Chiral Escape, Eight-Dimensional Contact-Topology Search, and a Local-Stability Draft
Moser Skew Lab Round 6: an eight-dimensional chiral-escape search (four symmetric + four antisymmetric parameters) tests whether the mirror-symmetric five-link platform from Round 5 can be escaped. The eight-dimensional search produced no reproducible positive transcendence; 1600 random contact-topology samples plus a local stability-box audit both support local stability of the event root against small chiral perturbations.
[document] Mixed Polyline–Curvature-Arc Families, Curvature Concentration, and the Value of Discrete Kinks
Moser Skew Lab Round 7: compares piecewise-curvature wings (m = 2, 3, 4, 6, 8) against continuous constant-curvature circular-arc wings, testing whether the near-parallel two-sided wings of Rounds 3–6 are a discrete-kink skeleton or a coarse approximation of a smooth wing. Ranking: the discrete-event five-link (0.998904) > the constant-curvature arc wing (0.998862) > the best multi-segment candidate (0.998839). Spreading finite turning continuously releases a small amount of congruent-containment pressure.
[document] Finite-Width Curvature Layer, a Smooth Candidate's Surpassing Result, and Dual-Path Support Cross-Checks
Moser Skew Lab Round 8: smoothing the internal kinks of the five-link's side wings, we find that a finite-width tanh curvature layer can slightly surpass the discrete-event five-link polyline platform (s*=0.998914339084632, about 1.058e-5 above s₀=0.998903757132509). Cross-checked against an independent support-path method using a dense point cloud of about 240,000 points, together with a multi-resolution audit, the two methods agree at the ~1e-14 level. Still awaiting arbitrary-precision and interval-certificate confirmation; this does not constitute a new Moser lower bound.
[document] Arbitrary-Precision Reconstruction, the Monotone Darboux Cusp Envelope, and the Boundary of the Certificate
Moser Skew Lab Round 9: using up to 120 decimal digits of precision and two independent quadrature algorithms (tanh-sinh and Gauss-Legendre), we reconfirm that the Round 8 smooth candidate surpasses the five-link event root by about 1.058e-5, ruling out double-precision error as the cause. We also establish a monotone Darboux cusp lower bound (a positive gap of 7.8e-6 remains even at 4096 subdivisions) — a rigorous mathematical monotonicity argument rather than a purely numerical coincidence. The 120° branch is found to be the closest competitor, with a gap of only about 1.64e-9.
[branch-hub] III · Crystallization
Moser's Worm Problem · III · Crystallization: The papers of this line
[document] Beyond the event five-link: curvature layers, a saddle against peak splitting, and a certified ascent of a worm's critical scale
Moser's Worm Problem · III · Crystallization: Beyond the event five-link: curvature layers, a saddle against peak splitting, and a certified ascent of a worm's critical scale — Rounds 07, 08 and 13 to 15 of a search for the hardest unit arcs in the 30-60-90 triangle, recomputed: each round's local optimum surpassed by the next enlargement of its family, and each step of the ascent certified in interval arithmetic
[document] Six rounds of a search for the hardest unit arcs in the 30-60-90 triangle, recomputed: the exact critical-scale formula, two chirality conventions, and the event five-link
Moser's Worm Problem · III · Crystallization: Six rounds of a search for the hardest unit arcs in the 30-60-90 triangle, recomputed: the exact critical-scale formula, two chirality conventions, and the event five-link — Grid programs that run low, a nesting of families, four branches at exact phases, and — numerically, in double precision — a strict local maximum among nearby unit five-links, on a neighbourhood of unestablished size
[document] The hardest worm for the 30-60-90 triangle: fifteen rounds of search, an independent recomputation, and a certified ascent
Moser's Worm Problem · III · Crystallization: The hardest worm for the 30-60-90 triangle: fifteen rounds of search, an independent recomputation, and a certified ascent — A research programme's search for the unit arcs that need the most of Wetzel's triangle, every round recomputed: the verdict ledger, the certified results, and what the record got wrong
[document] Certifying a worm's critical scale over the whole rotation circle: a phase-contact map, interval enclosures, and the gaps of a semi-validated certificate
Moser's Worm Problem · III · Crystallization: Certifying a worm's critical scale over the whole rotation circle: a phase-contact map, interval enclosures, and the gaps of a semi-validated certificate — Rounds 09 to 12 of a search for the hardest unit arcs in the 30-60-90 triangle, recomputed: the least of a tanh-layer curve certified in interval arithmetic, and where the programme's own certificate did not enclose
[branch-hub] II · Computation and Reproduction
Moser's Worm Problem · II · Computation and Reproduction: The Moser case's second layer: all fifteen round packages independently recomputed, RUN-001 to RUN-016
[document] Round 01 (v0.1): the grid programs reproduce; what they print is a grid's value, a local search's, and one handedness's
Round 1 · II · Computation and Reproduction: Round 01 (v0.1): the grid programs reproduce; what they print is a grid's value, a local search's, and one handedness's
[document] Round 10 (v0.10): the phase-contact map reproduces to 10⁻¹³, but one of its four cusp minima is a smooth minimum it misses, and at the wing switches one of each pair of stated derivatives is not the derivative; the least at 3π/2, which the round left open, is certified here
Round 10 · II · Computation and Reproduction: Round 10 (v0.10): the phase-contact map reproduces to 10⁻¹³, but one of its four cusp minima is a smooth minimum it misses, and at the wing switches one of each pair of stated derivatives is not the derivative; the least at 3π/2, which the round left open, is certified here
[document] Round 11 (v0.11): the exact boundaries and the 120°/270° enclosures hold, and the 579 derivative boxes and the root boxes hold where sampled; the switch neighbourhoods' derivative intervals leave out the 2×10⁻¹⁰ rad beside each switch, and three exclusions rest on them
Round 11 · II · Computation and Reproduction: Round 11 (v0.11): the exact boundaries and the 120°/270° enclosures hold, and the 579 derivative boxes and the root boxes hold where sampled; the switch neighbourhoods' derivative intervals leave out the 2×10⁻¹⁰ rad beside each switch, and three exclusions rest on them
[document] Round 12 (v0.12): the interval replay of the 120°/270° enclosures reproduces to 3×10⁻⁸¹ and the Newton steps hold, but one boundary ball in 19, not 19, holds Round 11's float, the root replay's positions are estimates, and "dependency inflation" explains only part of what it is used for
Round 12 · II · Computation and Reproduction: Round 12 (v0.12): the interval replay of the 120°/270° enclosures reproduces to 3×10⁻⁸¹ and the Newton steps hold, but one boundary ball in 19, not 19, holds Round 11's float, the root replay's positions are estimates, and "dependency inflation" explains only part of what it is used for
[document] Round 13 (v0.13): the five-parameter event-KKT point lies 6×10⁻⁸ from the stated one and is a strict local maximum, and the gain over Round 08 is certified between 4.04×10⁻⁹ and 4.25×10⁻⁹; but the Jacobian's stated spectrum is not the system's — its condition is 2.1×10³, not 3.8×10⁷ — §7's projection is not reproduced, and three of the four other minima are not the curve's
Round 13 · II · Computation and Reproduction: Round 13 (v0.13): the five-parameter event-KKT point lies 6×10⁻⁸ from the stated one and is a strict local maximum, and the gain over Round 08 is certified between 4.04×10⁻⁹ and 4.25×10⁻⁹; but the Jacobian's stated spectrum is not the system's — its condition is 2.1×10³, not 3.8×10⁷ — §7's projection is not reproduced, and three of the four other minima are not the curve's
[document] Round 14 (v0.14): the single peak is a saddle against splitting, not a local maximum — split into two halves with its five parameters re-solved, the curve rises, certified 1.19×10⁻⁷ above Round 13's at separation 0.03 — while the chirality modes are stable for the congruent scale, as stated; the search's evaluator puts the low branches 10⁻⁸ low, its profile holds the parameters fixed, and its minima lists are phase samples
Round 14 · II · Computation and Reproduction: Round 14 (v0.14): the single peak is a saddle against splitting, not a local maximum — split into two halves with its five parameters re-solved, the curve rises, certified 1.19×10⁻⁷ above Round 13's at separation 0.03 — while the chirality modes are stable for the congruent scale, as stated; the search's evaluator puts the low branches 10⁻⁸ low, its profile holds the parameters fixed, and its minima lists are phase samples
[document] Round 15 (v0.15): the eight-mode candidate stands — exact to 2×10⁻¹⁴ and certified in interval arithmetic at least 1.3725×10⁻⁷ above Round 13's — with nine minima and a latent margin of 3.0046×10⁻⁹; but Round 13's point is not stationary in the modes, so the Hessian decides nothing there, the base's low-branch gradients are off by 10⁻⁵, the ledger's takeover opens and closes before the stated window, and the headline figures are printed past their digits
Round 15 · II · Computation and Reproduction: Round 15 (v0.15): the eight-mode candidate stands — exact to 2×10⁻¹⁴ and certified in interval arithmetic at least 1.3725×10⁻⁷ above Round 13's — with nine minima and a latent margin of 3.0046×10⁻⁹; but Round 13's point is not stationary in the modes, so the Hessian decides nothing there, the base's low-branch gradients are off by 10⁻⁵, the ledger's takeover opens and closes before the stated window, and the headline figures are printed past their digits
[document] Round 02 (v0.2.2): the ledger, the scans and the exact values reproduce; the main report's numbers are its grid's, and the three-link family goes higher than its corrected curve
Round 2 · II · Computation and Reproduction: Round 02 (v0.2.2): the ledger, the scans and the exact values reproduce; the main report's numbers are its grid's, and the three-link family goes higher than its corrected curve
[document] Round 03 (v0.3): the five- and seven-link values reproduce; the seven-link family contains every five-link curve, so seven below five is a search's shortfall
Round 3 · II · Computation and Reproduction: Round 03 (v0.3): the five- and seven-link values reproduce; the seven-link family contains every five-link curve, so seven below five is a search's shortfall
[document] Round 04 (v0.4.1): the equalized five-link reproduces; its four branch minima sit at exact phases, and re-equalized there they level to 10⁻¹⁵, 6.7×10⁻⁹ higher
Round 4 · II · Computation and Reproduction: Round 04 (v0.4.1): the equalized five-link reproduces; its four branch minima sit at exact phases, and re-equalized there they level to 10⁻¹⁵, 6.7×10⁻⁹ higher
[document] Round 05 (v0.5): the contact-event system reproduces; its root is a strict local maximum, of the four-branch model and so of the least scale on a neighbourhood of unestablished size
Round 5 · II · Computation and Reproduction: Round 05 (v0.5): the contact-event system reproduces; its root is a strict local maximum, of the four-branch model and so of the least scale on a neighbourhood of unestablished size
[document] Round 06 (v0.6.1): the escape, the census and the audit reproduce; the event root is a strict local maximum of the eight-parameter model, and so of the congruent least scale among nearby five-links on a neighbourhood of unestablished size
Round 6 · II · Computation and Reproduction: Round 06 (v0.6.1): the escape, the census and the audit reproduce; the event root is a strict local maximum of the eight-parameter model, and so of the congruent least scale among nearby five-links on a neighbourhood of unestablished size
[document] Round 07 (v0.7): the curvature wings reproduce; the arc wing's deficit stands, every segmented family reaches the event five-link in a limit, and the m = 6 signature is one of Round 05's four events
Round 7 · II · Computation and Reproduction: Round 07 (v0.7): the curvature wings reproduce; the arc wing's deficit stands, every segmented family reaches the event five-link in a limit, and the m = 6 signature is one of Round 05's four events
[document] Round 08 (v0.8.3): the smooth curvature layer's gain over the event five-link is real — 1.0581952124×10⁻⁵, confirmed in independent code and in 40-digit arithmetic — but its published curve file is not the candidate
Round 8 · II · Computation and Reproduction: Round 08 (v0.8.3): the smooth curvature layer's gain over the event five-link is real — 1.0581952124×10⁻⁵, confirmed in independent code and in 40-digit arithmetic — but its published curve file is not the candidate
[document] Round 09 (v0.9): the 270° cusp holds to 120 digits and its Darboux bound is sound; the draft's target over the whole phase circle is certified here — the candidate's least scale exceeds the event five-link's
Round 9 · II · Computation and Reproduction: Round 09 (v0.9): the 270° cusp holds to 120 digits and its Darboux bound is sound; the draft's target over the whole phase circle is certified here — the candidate's least scale exceeds the event five-link's

new-methodology · 1

[hub] New Mathematical Methodology
An overview of AMRAL's New Mathematical Methodology cluster: CCM, CSM, AMRR, RCIG, NIOT, PPS, ACTM, DMSD -- new methods and formal systems for studying mathematical research itself, not claims to prove or disprove an existing conjecture.

niot · 11

[case-hub] Numerical Information Object Theory
AMRAL case: Numerical Information Object Theory (NIOT) — ten v0.1 DRAFT documents proposing a definitional and specification framework in which a numerical value is a finite projection of a richer information object; the statements labelled theorems are elementary consequences, there is no code or machine verification, and no known conjecture is attacked.
[document] Numerical Information Object Theory: From Linear Floating-Point Projection to Unbounded Probe Matrices and the Microscopic World of Numbers
The overview proposes a framework in which a usable numerical value is a projection of a richer information object that can be observed, step by step, with finite but unboundedly expandable probe matrices. It is a proposal, not an established result.
[document] Numerical Identity Units and the Projection Non-Identity Principle
One scalar value can correspond to different numerical information objects, and adding an observable only refines the equivalence classes, never merges them. This is an elementary consequence of the definitions, not a new mathematical theorem.
[document] Information Probe Calculus: Observation, Refinement, Composition, and Stopping Conditions for Numerical Information Objects
Adding a probe can only refine the indistinguishability relation. This is a one-line fact; the rest is a specification of terms and rules, with no new theorem.
[document] Unboundedly Expandable Finite Matrices: Dynamic Finite Dimensionality, Sparse Structure, and Task-Relative Closure
A sequence of finite-dimensional matrices can have no fixed bound on dimension while every step keeps a finite description and a task-relative finite closure. These are design rules and direct consequences.
[document] Spectral Discrimination and Multi-Probe Coupling: From Bidirectional Information Fields to Multiscale Numerical Microstructure
Spectra and coupling of several probes can serve as a language for organizing 'where it is worth probing again'. This is vocabulary and specification, not a validated method.
[document] Numerical Index Geometry: Addressing, Reindexing, Local Neighborhoods, and Identity Preservation
Changing how an object is indexed should not change its canonical identity. This is a definition-level norm.
[document] Floating-Point Projection, Completion, and Cross-Domain Bridges: Bidirectional Semantics from Finite Machine Representations to Numerical Information Objects
Non-injective floating-point rounding has no global left inverse, so a float cannot uniquely determine the object it came from. This is an elementary fact, written here as a specification of bridge semantics.
[document] Bidirectional Structural Localization and Responsibility Closure: A Generalized Information-Theoretic Form of BCODR
BCODR's cautions (overlap is not alignment; missing data cannot establish alignment) can be written as general responsibility-closure rules. This is a proposal with no worked example.
[document] Canonical Numerical Architecture: From Numeral Interpretation and Numerical Information Ontology to Authoritative Projection and Responsibility Closure
A numerical system can be governed by versioned candidate-to-canonical promotion and rollback; this paper gives the interface specification.
[document] AI-Native Numerical Information Runtime: Adaptive Probing, Dynamic Expansion, Responsibility Closure, and Authoritative Commit
An AI-controlled numerical probing loop can be specified under invariants such as 'no silent promotion'. This is a specification at the level of architecture and interfaces.

ns · 352

[case-hub] NS Research Zone
AMRAL's Navier–Stokes research zone: 16 independent sub-lines, ~529 source files, all built and live. Eleven of them (RFP through RKAP) form one continuous relay across Cycles I-XI toward the 3D incompressible global-regularity problem; the rest are independent lines, including the original NS_O chain and an observer-theory framework (NTLA-O). Global regularity remains fully OPEN throughout — this is a public research log, not a claimed proof.
[branch-hub] NS-ANP
AMRAL's NS-ANP (Navier–Stokes Ancestry Necessity Program) sub-line: all 10 Cycle IV rounds live. Builds a causal-lineage theory for pre-singular points from a formal causal relation domain up through a genuine C3 causal parent edge, closing with ANP-09's Horizon Causal-Forest Necessity Theorem — but atomic-level necessity (CN3) stays open. Global regularity remains fully OPEN.
[document] ANP-00: Pre-Singularity Causal Relation Domain, Hybrid Continuity, Legality, Phase-Like Transitions, and Causal Interpretation
ANP series paper 1 (round 00), opening Cycle IV. Defines the pre-singularity causal relation domain and the canonical causal atom, establishes the semantic/dynamical/numerical/logical rules every future ancestry edge must satisfy, recompiles the source-core provenance bridge into fully typed causal obligations. A pure framework document, proving no substantive proposition yet.
[document] ANP-01: Source–Core Provenance, Adjoint Causal Tubes, Scale-Resolved Vorticity Renewal, and the C2→C3 Gap
ANP series paper 2 (round 01). Uses the pressure-free vorticity equation plus a terminal core-anchored adjoint cutoff, proves an exact weighted forward causal-ancestry identity - output-local source-core ancestry proven in the weighted adjoint sense (a genuine C2 PDE causal edge). Geometric parent-source localization remains open, the C2→C3 gap unclosed.
[document] ANP-02: Recursive Edge Compatibility, Adjoint-Footprint Aperture, Canonical Footprint Nodes, and the Parent-Localization Gap
ANP series paper 3 (round 02). Proves a second-moment aperture estimate for the adjoint footprint, introduces canonical footprint spectral nodes stable under backward recursion, closing the footprint/representation component of recursive-edge compatibility. Proves a functional-analysis NO-GO: adjoint-weight localization does not imply source localization, geometric parent-source localization remains open.
[document] ANP-03: Source-Parent Recapture, Kernel-Inflated Footprints, Weighted Parent-State Extraction, and the C3 Causal Upgrade
ANP series paper 4 (round 03). Absorbs Littlewood-Paley nonlocality into a kernel-inflated causal footprint, proves a projected source-localization inequality, proves a weighted C3 causal parent edge for strong source atoms - the first genuine ancestry upgrade, restricted to a weighted quasi-local footprint-node class, not yet hard-ball-compact parent localization.
[document] ANP-04: Non-Type-I Ancestry Entry, Adaptive Weak-L³ Seeds, UV Square-Tail Extraction, and Universal Causal-State Initialization
ANP series paper 5 (round 04). Handles the branch with no uniform Type-I constant, extracts a quantitative UV vorticity square-tail lower bound, proves non-Type-I failure does not block causal-state initialization (only makes the causal time step adaptive), obtains a universal two-branch causal-state entry theorem.
[document] ANP-05: Arbitrary-Depth Compatible C3 Paths, No-Terminal-Node, Adaptive Generation Renormalization, and the Singular-Horizon Compactness Gap
ANP series paper 6 (round 05). Proves a no-terminal-node theorem and the existence of arbitrary finite-depth compatible C3 paths. The original inheritance criterion was later flagged as too strong by a same-series v0.2 correction note (earlier-state existence does not imply forward propagation contribution); the correction is linked on this page.
[document] ANP-06: Singular-Horizon Infinite Ancestry Extraction, Dual-Propagator Correction, Horizon Persistence, and Chain-Necessity Closure Audit
ANP series paper 7 (round 06). Corrects ANP-05's inheritance criterion, replaces bare earlier-state positivity with an exact dual-propagator Duhamel contribution, proves finite-depth realizability does not imply infinite-branch existence, defines the horizon-persistent node, identifies the missing theorem as extraction of a horizon-persistent marked branch.
[document] ANP-07: Horizon-Persistent Branch Extraction, Strong-Child Compactness, Causal Edge Closure, and the Renewal-Rate Alternative
ANP series paper 8 (round 07). Splits horizon-persistence failure into transmission degeneration (D_HTRANS) and compactness degeneration (D_HCOMP); proves a horizon-cut dual-ledger theorem and a local causal-edge closure theorem.
[document] ANP-08: Horizon Transmission Rigidity, Fresh-Source Cascade, Budgeted CN3, and Actual-Branch Shadowing Audit
ANP series paper 9 (round 08). Proves horizon-transmission collapse is not an independent obstruction, decomposing into one of three existing mechanisms; proves the horizon-cut source-norm theorem; gives an explicit counterexample where profile compactness does not shadow the actual chain. D_HTRANS removed as a primitive term, actual-branch shadowing remains open.
[document] ANP-09: Scale-Fragmentation Rigidity, Actual Horizon Inverse Limits, Causal-Forest Necessity, and the CN3 Final Audit
ANP series paper 10 (round 09), Cycle IV final audit. Proves the Horizon Causal-Forest Necessity Theorem (CN_Forest): an actual pre-singularity causal DAG exists, with terminals at arbitrarily late times and unbounded scales. Atomic CN3 remains OPEN - the irreducible frontier is a diffuse horizon branch, possibly a forest rather than a single lineage. Formally hands off to NS-CFOP.
[branch-hub] NS-CFOP
AMRAL's NS-CFOP (Navier–Stokes Causal Forest Obstruction Program) sub-line: Cycle V, all 3 rounds live. Continues NS-ANP Cycle IV's horizon causal forest, proving a normalized causal-cutset capacity theorem and a spatial-scale forest capacity bound; the final audit in CFOP-03 finds that standard finite budgets are summable per scale and cannot exclude an infinite cascade, defining the 'Forest Coercive Budget Problem' and handing off to NS-FCBP. Global regularity remains fully OPEN.
[document] CFOP-01: Diffuse Horizon Causality, Causal Cutsets, Action–Congestion Duality, and Forest Obstruction
CFOP series round 1, opening Cycle V. Continues ANP Cycle IV's horizon causal forest, proving a normalized causal-cutset capacity theorem and an action–congestion duality inequality, and proving carrier-ratio collapse forces multiplicity and branch entropy to grow, yielding a conditional forest-cutset obstruction principle.
[document] CFOP-02: Spatial-Scale Atomization, Forest Capacity, Enstrophy Cutsets, Driver Interfaces, and Diffuse-Cascade Rigidity
CFOP series round 2, Cycle V. Quantifies the forest's available spatial-scale capacity: bounded weight mass across a footprint and dyadic shells forces a strong spatial-scale atom to exist, or forces shell-span/scale-span growth or state-tail escape. Introduces the SPARSE-GUARD regularization interface.
[document] CFOP-03: Finite Forest Obstruction, Universal Budget Audit, Negative-Sobolev Forcing, Sparse/Dense Geometry, and Cycle-V Closure
CFOP series round 3, Cycle V final audit. Asks whether standard Navier–Stokes theory supplies a universal finite budget closing the five residual classes left by CFOP-02. Answer: no — proves an energy-class negative-Sobolev nonlinear forcing budget, shows the Leray enstrophy-time budget and this forcing budget are each summable per parabolic scale, and formally defines the Forest Coercive Budget Problem, handing off to NS-FCBP.
[branch-hub] NS-CSP
AMRAL's NS-CSP (Navier–Stokes Coercive Synchronization Program) sub-line: all 8 Cycle II rounds live. Synchronizes mid-strain action with moving frequency-window action round by round, closing with CSP-08's explicit four-mechanism residual core (exponential preload, dissipation-range replenishment, core dilution, source/state multiplicity), formally handing off to NS-DRC (Cycle III) — matching exactly the residual set DRC-01 opens by addressing. Global regularity remains fully OPEN.
[document] CSP-01: Spatial Concentration Synchronizer, Window Capture, Shell Atomization, and Wavelength-Cell Dispersion
CSP series round 1, opening Cycle II. Continues from Cycle I's coercive synchronization problem, proves a wavelength-cell inequality synchronizing localized strain mass with moving frequency-window density, obtains a window/shell/space synchronization trichotomy.
[document] CSP-02: Spatial-Atom Equivalence, Type-I Enstrophy-Core UV Extraction, and Parabolic Packing
CSP series round 2. Proves a two-way equivalence between wavelength-cell vorticity atomization and scaled dyadic velocity amplitude, proves a Type-I singular-core UV vorticity extraction theorem from Barker–Prange enstrophy concentration, reduces spatial synchronization failure to three concrete defects.
[document] CSP-03: Shell Atomization, Spectral-Variance Geometry, Approximate Eigen-Shells, and Resonant Transfer
CSP series round 3. Proves that under severe global shell atomization, the exact approximate-eigenfunction residual must necessarily grow (a universal residual-gap theorem), and gives a conditional resonant-transfer dispersion theorem.
[document] CSP-04: Moving-Window Capture, Dissipation-Wavenumber Geometry, Escape Intervals, and UV Stock Placement
CSP series round 4. Proves window dominance using an exact Bradshaw–Grujic window construction, reduces the global moving-window defect to a shell/spatial-carrier defect or an escape-gap time mismatch.
[document] CSP-05: Escape-Time Synchronization, Besov Recovery Packets, and Temporal Gap Rigidity
CSP series round 5. Builds an escape-time calculus for the critical Besov norm, proves every half-layer escape carries a universal recovery-action packet, reduces the time defect to bounded-delay synchronization or stale-floor separation.
[document] CSP-06: Stale-Floor / Model-Cone Synchronization, Preloaded Reservoir Depth, and Band-Passed Core Alignment
CSP series round 6. Uses the exact strain–vorticity perturbation structure to prove a model-cone monotonicity principle and a preloaded-reservoir dichotomy; proves excess preload must force the UV depth past a threshold, reduces the core-alignment defect to shell-index alignment or core dilution.
[document] CSP-07: Preloaded Reservoir Transport, Viscous Survival, Replenishment Debt, and Core Dilution
CSP series round 7. Proves the PRELOAD branch must either survive by exponential amplification or pay a high-frequency Duhamel replenishment debt; the debt further splits into two forcing sources, giving a partial source–state synchronization theorem.
[document] CSP-08: Unified Reservoir/Alignment Cover, Exponential Preload Audit, and Cycle-II Closure
CSP series round 8, Cycle II final audit. Absorbs D_INDEX into existing mechanisms, proves a functional-analysis NO-GO (energy plus instantaneous Besov amplitude cannot bound the preloaded reservoir), closes with an explicit four-mechanism residual core, hands off to NS-DRC (Cycle III).
[branch-hub] NS-DCRP
AMRAL's NS-DCRP sub-line: 55 rounds live (original numbering 01-55 and 59; rounds 15 and 56-58 are missing from the source folder), a continuous research chain advanced round by round through correction, orbiting the Navier–Stokes global-regularity problem — starting from carrier entropy and concentration recovery, through logarithmic model-cone debt, dissipation-supply ancestry, filtered-vorticity subgrid-scale energy, Type-II Euler reprofiling, Kelvin circulation, and affine-jet vorticity-covariance rigidity, advancing to sheet/pancake geometry and viscous thickness floors. Global regularity remains fully OPEN. Cycle VIII of an eleven-segment research lineage running RFP through RKAP.
[document] DCRP-01: Carrier Entropy and Nonlinear Concentration Recovery
Starting from the surviving normal form of NS-MORP Cycle VII (a minimal, zero-tax, kernel-saturated diffuse carrier), proves that entropy itself does not constitute a dynamical obstruction, and identifies the actual nonlinear concentration functional: if local output is superlinear in normalized carrier mass, a fixed output forces a fixed-proportion atom. Proves a concentration-recovery theorem for same-shell diagonal vorticity stretching, so a diffuse carrier cannot sustain order-fixed dangerous supply through local same-shell stretching alone, and must migrate to nonlocal channels such as cross-scale, far-field, or commutator transport. The true opening of the NS-DCRP series, round one of Cycle VIII.
[document] DCRP-02: Cross-Scale Interaction Graph and Supply-Migration Rigidity
Building on DCRP-01's source-migration theorem, represents the migrated nonlinear supply as a directed interaction graph among carrier-lattice points, and proves a partner-degree compensation theorem — for fixed output, if the atomic proportion vanishes then the sub-weighted partner degree must diverge. Also proves that under comparable shell offsets, Biot–Savart quasi-locality gives bounded graph degree, so a diffuse carrier likewise cannot sustain order-fixed supply through bounded cross-scale stretching alone. Further proves a comparable-annulus recovery theorem and a conditional commutator coherence theorem.
[document] DCRP-03: Logarithmic Model-Cone Debt and Scale-Return Exclusion
Replaces the previously failed raw-tax accumulation route with a scale-invariant logarithmic model-cone debt identity, checked directly against the MORP recurrence-return test, resolving in one stroke the two open problems left by the previous round (scale-normalized recurrence does not imply equal endpoint kinetic energy; a fixed-scale critical raw toll can still be geometrically additive).
[document] DCRP-04: Scalar Gain Transfer and the Scale-Gap Bound
Continuing DCRP-03, removes an unnecessary high-derivative transfer requirement from the logarithmic model-cone debt route.
[document] DCRP-05: Transverse Model-Cone Rigidity and Normalization-Orientation Audit
Audits the MORP normalization compiler, corrects a scale-orientation ambiguity (including a sign error in MORP-04), and strengthens the Miller model-cone estimate using the exact orthogonality of the Navier–Stokes strain residual.
[document] DCRP-06: Spectral Moment Separation and Hellinger Rigidity
Attacks the β_SV→0 frontier left by DCRP-05, proving that the originally conjectured claim — that a fixed-proportion strain energy must move to remote high frequencies — is false, refuted directly by a two-scale counterexample.
[document] DCRP-07: H² Interaction Tax and the Derivative-Visibility Gap
Attacks the low–high interaction-tax frontier from DCRP-06, testing whether the ultraviolet derivative carrier can be charged by the existing low-order energy/flux accounting.
[document] DCRP-08: Dissipation-Wavenumber Supplier-Atom Recovery and the Ultraviolet Supply Bridge
Proves that even if a derivative-dominated ultraviolet tail can make the low-order raw mass vanish, this does not mean that tail can be dynamically supplied without relying on a low-order critical atom.
[document] DCRP-09: Duhamel Supplier Ancestry and Genuine Historical Causality
Proves that a non-vanishing dissipation-boundary supply shell is not merely an instantaneous frequency marker, but must connect to a genuine, single-history nonlinear Navier–Stokes ancestry.
[document] DCRP-10: First-Crossing Shell Flux and Parent Localization
Refines DCRP-09's nonlinear source ancestry into a genuine forward kinetic-energy transfer, localizing the signed triple ancestry into a binary choice: parent source or defect.
[document] DCRP-11: Heat-Band PFET Compatibility and Forward/Backward Scattering Substitution
Without inventing a new physical detector, takes DCRP-10's forward first-crossing spectral-shell flux and bridges it back to the existing FCBP pressure–flux framework via heat-semigroup coarse-graining.
[document] DCRP-12: Local PFET Localization and Work-Carrier Completion
Closes the global-to-local heat-work localization gap left by DCRP-11, and pins down what actually remains when a fixed critical amount of work spreads across unboundedly many normalized parabolic cells.
[document] DCRP-13: Supplier-Trace Critical Lift and Finite-Family Anti-Diffusion
Directly extracts a scale-consistent finite-family trace witness from dissipation-boundary supplier atoms, bypassing DCRP-12's work-multiplicity obstruction.
[document] DCRP-14: Solenoidal Trace-Window Compiler and Final Trace-Realization Accounting
Audits DCRP-13 against the genuine finite-window adjoint-trace definition, corrects an impermissible scalar-test-function shortcut within it, and constructs a genuine finite-dimensional divergence-free trace window for the nonlinear increments generated by the supplier.
[document] DCRP-16: Good-Collar Localization and Local Supplier Capture
After DCRP-15 — missing from the original files — this round closes the gap it left behind at the first-singular-point localization level: it constructs a divergence-free localization and proves that a bounded localized dissipation wavenumber forces local continuation.
[document] DCRP-17: Supplier Stopping-Time Synchronization and Excursion Irreversibility Obstruction
Recasts DCRP-16's local supply sequence as a genuinely MORP-compatible return/repeated-root stopping rule, and proves that the supplier-rooted finite-window packet is indeed natively separated and compact once the normalization is fixed.
[document] DCRP-18: Trace-Erasure Action and Two-Sided Scale-Carrier Completion
Rigorously examines DCRP-17's supplier-excursion irreversibility proposal — which holds only within a fixed normalization frame — and completes the missing infrared direction of the relative-frequency packet.
[document] DCRP-19: Critical-Supply Source Reduction and Filtered-Stretching–Diffusion Pivot
Reduces the untaxed positive supply to a short list of quantitative source mechanisms, and — without abandoning the existing DCRP framework — pivots to a coercive filtered vorticity-stretching mechanism.
[document] DCRP-20: Filtered-Enstrophy Diffusive/Infrared Dichotomy and Far-Field Reduction
Using a spectral diffusive–infrared dichotomy, rules out the low-mode filtered-enstrophy reservoir as a hidden zero-cost mechanism, reducing the surviving branch to only the far-field survivor.
[document] DCRP-21: Far-Field Annular Escape and Harmonic-Jet Reduction
Proves that a persistent far-field stretching surplus forces the source annular region to escape to infinite relative spatial radius with a divergent normalized annular vorticity amplitude, ruling out the bounded harmonic affine jet as the final zero-cost survivor.
[document] DCRP-22: Supplier-to-Filtered-Enstrophy Activation and Temporal-Spike Elimination
Closes the 'local supplier ⟹ filtered-enstrophy activation' interface at the level of a quantitative either/or, rules out an 'ultra-short temporal-spike' escape, and corrects DCRP-20's treatment of the localized reservoir.
[document] DCRP-23: Bounded-Lag Increment Activation and Young-Profile Frontier
Reduces the persistent-bounded-reservoir non-CKN branch to a derivative-compatible velocity-increment defect that does not vanish at any sufficiently small scale.
[document] DCRP-24: Increment Young-Profile Fiber Completion and Covariance Rigidity
Corrects a consistency issue in the MORP extended-cost definition, completes the exterior-cylinder Young-profile theorem by filling in the infinite-dimensional fiber-escape defect it omitted, and proves a rigidity theorem for the covariance of the actual velocity-increment field.
[document] DCRP-25: Pressure-Compatible SGS Energy Rigidity and Affine-Kernel Collapse
Proves that pressure-compatible Reynolds covariance has no bulk SGS production; zero SGS viscous variance forces an affine velocity profile; inherited Morrey energy growth then excludes every nonzero affine strong profile on the bounded-reservoir blowup branch.
[document] DCRP-26: SGS Recurrence Gap and Dual-Work Coercivity NO-GO
Proves that the energy/enstrophy work pairing cannot itself be coercive (rigid-transport tangent vectors are exactly work-orthogonal), replaces dual-work coercivity with an exact SGS-energy recurrence argument, and identifies the remaining global branch as critical-reservoir/compactness escape rather than an unresolved stress-angle kernel.
[document] DCRP-27: Critical-Reservoir Absorption and Type-II Euler–Reynolds Reprofiling
Removes 'critical-reservoir blowup' as an undifferentiated escape label, proves that bounded local energy and pressure reservoirs force an eventual uniform dissipation bound along a nested chain, and reprofiles the kinetic-energy Type-II branch, via Euler-time normalization, into a local Euler or Euler–Reynolds defect object.
[document] DCRP-28: Type-II Double-Level Crossing and the Genuine Euler Barrier
Isolates the genuine two-level energy transition, separates the surviving viscous payment from the genuinely inviscid Type-II limit, proves that a finite Euler-time level crossing cannot become a silent Euler/Euler–Reynolds profile, and shows that no known general finite-energy Euler Liouville theorem can close the remaining branch.
[document] DCRP-29: Raw-Energy Atomicity and the Atom-Free Backward-Ancient Survivor
Proves that a fixed positive fraction of actual physical kinetic energy trapped in the shrinking core forces an atom in the terminal energy measure; isolates the genuinely remaining Type-II state: the atom-free backward-ancient Euler recurrence branch.
[document] DCRP-30: Same-Parent DSS Recurrence, Atom-Free Exponent Window, and Mandatory Tail Escape
Proves that a compact, nondegenerate, recurrent same-parent branch is an Euler generalized/discretely self-similar branch, derives the similarity-exponent window, and proves that the atom-free branch necessarily loses the mass of the normalized 'global' kinetic-energy distribution to spatial infinity.
[document] DCRP-31: DSS Radial PFET Rigidity and the Core–Tail Matching Flux
Proves that a smooth nonzero core cannot connect to the critical DSS tail without a finite-radius inward Euler pressure–kinetic-energy flux; compresses this conclusion into a finite, native PFET witness on the class of compact, normalized profiles.
[document] DCRP-32: Critical Telescoping NO-GO and Kelvin-Holonomy Rigidity
Proves that every energy-homogeneous summation closure runs into an exact critical telescoping obstruction; switches instead to the Euler Kelvin/Weber material invariant, proves that zero material holonomy forces the circulation to vanish, and shows that under the critical tail-growth rate this in turn forces the profile itself to be zero.
[document] DCRP-33: Circulation Replenishment, Backward Filamentation, and Navier–Stokes Kelvin Shadowing
Proves that nonzero DSS circulation must be supplied either from spatially remote material labels or through exponential backward filamentation, and derives the exact Kelvin correction term for pre-limit Type-II Navier–Stokes profiles.
[document] DCRP-34: Quotient-Corrected Kelvin Number and the Critical Kelvin–Oseen Equality Manifold
Points out that DCRP-32/33's reading of the DSS circulation contraction as a native return tax is imprecise; identifies the quotient-correct circulation variable, separates the SGS circulation cascade from molecular viscosity, and defines the corrected Kelvin/Oseen equality manifold.
[document] DCRP-35: DSS Enstrophy Replenishment and Outer Affine-Jet Reduction
Replaces DCRP-34's heuristic language with exact vorticity/enstrophy dynamical bookkeeping, proves that a nonzero strictly-DSS core must be sustained by positive vortex stretching or inward enstrophy transport, localizes the unavoidable stretching source to a finite intermediate annular region, and reduces it to a finite-dimensional symmetric trace-free affine strain jet.
[document] DCRP-36: Affine-Jet Reproduction Action and Critical Shell Packing
Proves that the supplier hierarchy is exactly critical rather than supercritical, derives the exact periodic affine-jet reproduction equation, proves that a nonzero periodic jet must pay a fixed finite-dimensional reproduction action, and identifies angular/phase cancellation as the next closure frontier.
[document] DCRP-37: Affine-Jet/Vorticity-Covariance Phase Locking and Eigenframe Dynamics
Converts the amplitude problem into a tensor phase/alignment problem, defines a normalized strain–vorticity covariance phase parameter, and derives eigenframe evolution formulas for the affine strain jet and the core vorticity covariance.
[document] DCRP-38: Covariance-Determinant Rigidity and Low-Rank Vorticity-Phase Collapse
Corrects the claim that 'persistent phase alignment must be non-generic,' derives the fixed core-vorticity covariance matrix equation, proves that periodic full-rank covariance requires a nonzero non-affine residual, and proves that the exact zero-residual periodic branch has rank at most 2.
[document] DCRP-39: Rank-One Vorticity-Core Decomposition and Burgers-Jet Normal Form
Proves that a spatially common vorticity direction forces axial invariance of the vorticity magnitude, proves a global rank-one Liouville theorem under strictly-DSS sublinear tail growth, and concludes that every nonzero rank-one core must undergo either finite-radius vorticity-direction diffusion or directional tail escape.
[document] DCRP-40: Rank-Two Planar Covariance and Normal-Compression Floquet Rigidity
Derives the exact evolution of the common vorticity-plane normal vector and the pseudo-determinant evolution of the in-plane covariance, proves that a purely kinematic global planar-vorticity Liouville theorem is false, and identifies the planar conformal Floquet mode as the true remaining branch.
[document] DCRP-41: Planar-Covariance Shape Disk and Moving Pancake-Jet Normal Form
Derives the exact two-dimensional disk equation for the normalized in-plane covariance, proves that zero shape action forces pointwise isotropic affine stretching on the vorticity plane, and on this equality branch reconstructs the full three-dimensional affine tensor as a moving pancake jet.
[document] DCRP-42: Planar Potential–Shear Scalar Reduction and Canonical Pancake Amplification
Derives the true scalar PDE hidden inside the planar potential–shear representation, proves that the canonical moving-pancake eigenmode reduces to a scalar material amplification equation, and obtains a conditional global L^p Liouville theorem for that eigenmode.
[document] DCRP-43: Anchored-Shear Poincaré Cocycle and Infinite-Sheet Reservoir Rigidity
Replaces the absolute scalar amplitude with an anchor-relative, gauge-completed shear potential, derives a one-period affine Poincaré cocycle, and proves that on the pure-cocycle branch, every nonzero global mode requires an infinite-measure scalar super-level-set reservoir.
[document] DCRP-44: Coarea NO-GO and Sheet-Interface/Plateau-Escape Dichotomy
Proves a kinematic NO-GO: infinite scalar super-level-set measure can coexist with finite horizontal-gradient cost; replaces the point-anchor gauge with a slice-mean-zero gauge, obtaining a finite sheet-interface enstrophy gap on the class of compact strong profiles.
[document] DCRP-45: Log-Sheet Capacity, Super-DSS Interface Escape, and Vanishing Inward Portal
Quantifies how far the interface must escape in horizontal scale in order to hide a fixed contrast behind small planar enstrophy, and proves that both the area and volume flux of the large-radius inward self-similar material portal tend to zero.
[document] DCRP-46: Canonical Label Measure, Logarithmic-Radius Transport, and Intermittent Super-DSS Exhaust
Corrects the error of directly identifying the inflow source radius with the outflow rescaled-sheet radius, and proves that any coherent super-DSS sheet exhaust must occupy only an exponentially vanishing fraction of the material.
[document] DCRP-47: Shear–Vorticity Two-Form Invariant and Critical-Sheet Monodromy Group
Identifies the true physical carrier of the pure rank-two pancake branch as a codimension-one vorticity-flux form rather than a three-dimensional volume density, and derives the complete critical-sheet monodromy-group exponent identity.
[document] DCRP-48: Coherent-Pancake Fokker–Planck Reduction and the Viscous Batchelor Floor
Identifies a coherent single-sign fixed-plane pancake-sheet subbranch that reduces exactly to a one-dimensional Fokker–Planck equation, proves a positive viscous Batchelor/Burgers thickness fixed point, and rules out asymptotically subdiffusive coherent-sheet maps.
[document] DCRP-49: Material Sheet-Tube Signed-Distance Accounting and the General Viscous Thickness Floor
Generalizes DCRP-48's one-dimensional coherent-sheet variance identity to genuinely curved material sheet-tubes, and proves that the molecular-diffusion contribution has a positive leading-order term independent of sheet curvature.
[document] DCRP-50: Thickness-Scale Curvature and the Filtered Vorticity-Direction Compiler
Compiles thickness-scale curvature escape into a physical vorticity/rank/tube defect, proving that thickness-scale curvature forces a scale-invariant filtered vorticity-gradient gap unless rank coherence fails.
[document] DCRP-51: Curved-Sheet Uncertainty and Fragmentation-Resistant Second-Order Diffusion Activation
Closes the gap in DCRP-50 (the gradient rate can be large while the sheet's enstrophy-carrying mass tends to zero), proves that sheet fragmentation cannot reduce the reciprocal-thickness diffusion ledger, and compiles the multi-sheet filtered gradient sum back into genuinely unfiltered Navier–Stokes second-order diffusion.
[document] DCRP-52: Palinstrophy Criticality Audit and Gaussian-Batchelor Return Rigidity
Proves a critical NO-GO: the positivity of the raw normalized palinstrophy is not by itself sufficient to yield a same-source finite-budget contradiction; identifies the diffusive Batchelor branch as a legitimate strain–diffusion balance rather than a defect, and proves Wasserstein contraction and uniqueness for the recurring Gaussian profile.
[document] DCRP-53: Gaussian-Width–Strain Reconstruction and Finite Matching-Layer Rigidity
Proves that the Gaussian sheet is not self-contained: the global Gaussian-shear/affine-strain normal form is incompatible with a strictly sublinear Type-II kinetic-energy tail, yielding a finite upper bound on the exact affine–Gaussian core radius.
[document] DCRP-54: Finite Annular Dual Moments and Return-Vorticity Matching Rigidity
Converts the finite matching annulus into quantitative vorticity-moment accounting, proves that the supplier mode and the constant-mean return mode are exactly orthogonal, and records an important NO-GO: dual-moment kinematic compatibility is not, by itself, sufficient to close the branch.
[document] DCRP-55: Two-Mode Dynamic Leakage and the Failure of Autonomous Matching Closure
Tests whether DCRP-54's zero-surplus two-mode matching manifold is invariant under genuinely locally self-similar Navier–Stokes vorticity dynamics, proves that the nonlinear self-interaction of the annular strain-supplier mode leaves that two-mode span, and concludes that the two-mode internal-equality manifold cannot by itself constitute a complete finite-annulus matching solution.
[document] DCRP-59: Signed-Residual Channel Confluence and Rank-Two Identity Closure
Building on DCRP-58's closure of the globally transparent fixed-plane tail (that file itself is missing from the original delivered folder), proves that any exact compensation for DCRP-54's recurring visibility leakage must occur through a finite compensation branch, while DCRP-55/56 show that finite complete compensation forces the accumulated vorticity covariance to become isotropic rank-three.
[branch-hub] NS-DRC
AMRAL's NS-DRC (Navier–Stokes Dynamic Reservoir Closure Program) sub-line: all 7 Cycle III rounds live. Absorbs, compresses, and reclassifies the four reservoir/source residual classes left by Cycle II, closing with DRC-07's Type-I reservoir-mechanism classification closure — but the audit finds closure does not imply chain necessity, formally handing off to NS-ANP (Cycle IV). Global regularity remains fully OPEN.
[document] DRC-01: Exponential Preload, Prehistory Renewal, Viscous-Age Slabs, and High-Parent Source Genealogy
DRC series round 1, opening Cycle III. Continues from Cycle II's four residual mechanisms. Proves surviving high-frequency legacy stock requires exponential preload, and that this preload must itself be generated by prehistoric Duhamel forcing — EXP-PRELOAD removed as an independent mechanism, recompiled into source renewal.
[document] DRC-02: Source-to-State Efficiency, Parent Multiplicity, Cancellation Geometry, and Renewal-Chain Compression
DRC series round 2. Uses a normalized dual witness to upgrade the renewal branch into an exact signed parent ledger, derives a bilinear parent-state envelope, proves finite parent-envelope capture under bounded cancellation/utilization/multiplicity, obtains a finite-branching renewal-chain criterion.
[document] DRC-03: Source Amplification, Interaction Utilization, Spectral State Share, and Dissipation-Range Coupling
DRC series round 3. Separates deterministic frequency weighting from genuine source/state mismatch in the source amplification ratio, proves a scale-local cluster-envelope bound and a dissipation-range absorption estimate, reclassifies utilization collapse as certificate inefficiency rather than a primitive mechanism.
[document] DRC-04: Cancellation Rigidity, Many-Parent Aggregation, Net-Shell Coherence, and Dissipation-Span Compression
DRC series round 4. Proves signed cancellation can extract a high-parent carrier without needing uniform boundedness (finite shell support forces a positive net contribution); completes the dissipation-wavenumber forcing split; R_CAN and R_MULT removed as independent residual classes.
[document] DRC-05: Dissipation-Range Reservoir Closure, Low-Mode Driver Packets, Boundary Residence, and Forcing-Level Viscous Coercivity
DRC series round 5. Proves the dissipation residual is not an independent mechanism: once the viscosity-small sector is removed, every strong renewal is either controlled by low-mode driver action or forces ancestry re-rooting. R_DISS is absorbed into standard low-mode driver action, main residual reduces to R_DIL.
[document] DRC-06: Persistent Core Dilution, Backward Concentration, Absolute UV Core Carriers, and Core-Reuse Rigidity
DRC series round 6. Shows global probability share is not the right primary variable for singular core ancestry; switches to an absolute scale-invariant local core carrier, proves a geometrically concentric backward core-reuse chain. R_DIL reclassified from a main dynamic reservoir escape to a normalization/certificate defect within the Type-I branch.
[document] DRC-07: Unified Dynamic Reservoir Cover, Type-I Ancestry Recompilation, Chain-Necessity Audit, and Cycle-III Closure
DRC series round 7, Cycle III final audit. Completes closure at the level of Type-I reservoir-mechanism classification, but the audit finds closure does not imply chain necessity, identifying SCPB, REC, and non-Type-I entry as the main gaps. Formally hands off to NS-ANP (Cycle IV).
[branch-hub] NS-FCBP
AMRAL's NS-FCBP (Navier–Stokes Forest Coercive Budget Program) sub-line: all 6 Cycle VI rounds live. From searching for a globally finite, near-critical, branching-stable forest coercive budget, through FCBP-03's slow-scale critical-lift breakthrough and FCBP-05's sharp half-exponent time threshold, to FCBP-06's final audit proving the replication-gate NO-GO and handing off to NS-MORP. Global regularity remains fully OPEN.
[document] FCBP-01: Critical Forest Coercivity, One-Derivative Gap, Dual Congestion Renormalization, and Structural Cancellation
FCBP series round 1, opening Cycle VI. Proves the energy-class forcing upper bound and the critical forcing topology differ by exactly one spatial derivative, proves a weighted-to-unweighted critical-lift NO-GO, integrates three external cancellation modules, defines this cycle's core 'critical lift problem.' Continues from CFOP Cycle V.
[document] FCBP-02: Filtered Stretching Coercivity, Comparable-Annulus Barrier, Signed Affine-Jet Lift, Commutator Recurrence, and Critical-Lift No-Go
FCBP series round 2. Tests whether local gains from the filtered vorticity architecture can be upgraded to an unweighted global forest budget — not with existing filtering inequalities alone. Reduces the critical lift to four concrete obstructions: comparable-annulus signed stacking, commutator recurrence/stacking, far-tail control, and residual localization.
[document] FCBP-03: Signed Pressure–Flux Work, Variable-Radius Telescoping, Slow-Scale Critical Lift, Filter-Switch Defects, and Model-Cone Recurrence
FCBP series round 3. This cycle's first real breakthrough: generalizes pressure–flux telescoping from geometric to arbitrary radii, proving that choosing r_k=r_0(k+1)^(-β) yields a non-summable 'slow-scale critical lift window.' Also finds a new compatibility problem between fixed and moving filters (the filter-switch defect).
[document] FCBP-04: Moving-Filter Telescoping, Continuous Filter Drift, Horizon Alignment, Time-Thickness Barrier, and Borderline Critical Lift
FCBP series round 4. Largely closes the compatibility problem of a filter moving with scale (continuous filter drift is controlled by the Leray energy budget), but proves a parabolic-alignment summability theorem and a universal time-thickness theorem, revealing a new, deeper time-thickness barrier.
[document] FCBP-05: Long-Age Observability, Sharp Half-Exponent Window Threshold, Combined Anti-Phantom Detection, and Paid-Side Recurrence
FCBP series round 5. Proves a direct bridge from fresh vorticity sources to a single signed work channel is impossible; replaces it with combined observability. Proves a sharp sequencing theorem for horizon scheduling — exponent 1/2 is the sharp threshold for exhaustion effectiveness. Integrates Tao's quantitative L³ backward propagation as an external module.
[document] FCBP-06: Causal-to-Audit Transfer, Combined-Invisible Cascades, Paid-Side Absorption, and Cycle-VI Closure Audit
FCBP series round 6, Cycle VI final audit. Proves the replication-gate NO-GO (a formal version of the anti-cheating rule), a native CAR compiler, and a conditional paid-side absorption compiler. Concludes Cycle VI produces no unconditional forest coercive budget; the final obstruction becomes minimal non-tautological extraction, formally handing off to NS-MORP.
[branch-hub] NS-GSM
AMRAL NS zone's 17th sub-line: NS_GSM, an executable Reference Runtime software project and audit trail that applies the Closure-Space Mathematics (CSM) methodology to AMRAL's existing NS research corpus (C1-C6, X72, DCRP, RFP, MORP, FCBP). A seed dataset plus 7 versions, running from full corpus ingestion, candidate review, proof authority review, and independent verification, through formalization and cross-replication, to the FELRA formal-proof bridge. Throughout, C1, C2, and the formal NS root remain OPEN; only 13 narrowly-scoped local lemmas/theorems are gradually promoted through the audit tiers.
[document] The NS_GSM Seed Dataset
Not a paper — a structured dataset (12 YAML files + 5 JSON files, no prose). Extracts 7 logical seed units from 5 real source documents (the ETN-X foundational paper, plus C6-Q, DCRP103, DCRP104, and
[document] CSM Reference Runtime v0.1
A genuine, installable Python package (csm_reference_runtime, src/csm_runtime/, 12 pytest files) — not a paper. Loads the seed dataset and rebuilds native state, demonstrating that the runtime itself
[document] NS_GSM Full Corpus Ingestion v0.2
The first time real corpus documents are actually brought into the package (46 markdown files under corpus/, spanning the C, RFP, MORP, X72, DCRP, FCBP, and PAM lines). Adds manifest-driven source dis
[document] NS_GSM Candidate Review v0.3
Turns v0.2’s 1,460 raw candidates into a replayable review/promotion workflow. Every candidate receives an explicit review decision; only structurally ‘safe’ categories (FRONTIER, NONCLAIM, SURVIVOR)
[document] NS_GSM Proof Authority Review v0.4
The first time a specific, hand-selected set of candidates (limited to ETN-X, DCRP103/104/105, and 3 RFP papers — not the full 1,726-candidate pool) is pushed through a full audit of source hash, stat
[document] NS_GSM Independent Verification v0.5
The precise meaning of ‘independent’ here: an in-package Python/SymPy verification module, independent of the original derivation, that re-derives each claim from scratch (for example, verify_d103_1()
[document] NS_GSM Formalization and Cross-Replication v0.6
Does not upgrade the closure status of v0.5’s 12 PROOF assets — only strengthens their auditability. Compiles each one into a machine-readable ‘Formal Intermediate Representation’ (NSGSM-FIR/0.1), the
[document] NS_GSM FELRA Formal Proof Bridge v0.7
In this environment, FELRA was never actually connected. What v0.7 builds is the protocol and pipeline toward the external tool FELRA (confirmed version 1.8.1/main, Lean backend), but the sandbox this
[branch-hub] NS-IDRP
AMRAL's NS-IDRP (Navier–Stokes Impulsive Defect Recurrence Program) sub-line: Cycle IX, all 4 rounds live. Continues NS-DCRP's (Cycle VIII) surviving normal form 'diffuse impulse recurrence'; the final audit in IDRP-04 reduces the surviving obstruction to a 'tangential singular-impulse phantom,' formally handing off to NS-TSKR (Cycle X). Global regularity remains fully OPEN.
[document] IDRP-01: Impulse Persistence, Trace Thickening, Temporal Action Packing, Moving-Window Visibility, and Recurrent Defect Normal Forms
IDRP series round 1, opening Cycle IX. DCRP Cycle VIII closed with the surviving normal form 𝒦_IDR (diffuse impulse recurrence). This paper separates PERSISTENCE from BURST DEBT, imports Barker–Prange Type-I concentration, proves an abstract trace-persistence-or-variation theorem, and proves a universal energy-class temporal regularity u_t ∈ L_t^(4/3) H_x^(-1).
[document] IDRP-02: Source-Impulse Visibility, Filtered Trace Variation, PFET Burst Coupling, Logarithmic Atom Thickening, and Moving-Window Depletion
IDRP series round 2, Cycle IX. Proves that for a filtered vorticity trace, rapid loss is not mechanism-invisible at the ledger level: a filtered-mechanism burst theorem, combined with DCRP's logarithmic far-field atom lower bound, yields a full-parabolic-window-packet-or-burst theorem. Defines burst-to-defect-realization (BDR) as the missing non-tautological bridge.
[document] IDRP-03: Relative Invisible Burst Kernels, Dual-Compatible Burst-to-Defect Realization, Amplitude-Normalized Audit, and Temporal Rigidity
IDRP series round 3, Cycle IX. Partially closes the burst-to-defect-realization (BDR) problem via an exact native route through a finite-window source quotient. Proves an approximate causal–audit dual-compatibility compiler, and a compact-family moving-window theorem: operator-norm precompactness plus kernel-freeness of every limit map gives a uniform positive minimum singular value, excluding every relative invisible burst.
[document] IDRP-04: Source Transversality, Adjoint Synchronization, Singular Limit Kernels, Physical Burst Amplitude, and Cycle-IX Closure Audit
IDRP series round 4, Cycle IX final audit. Runs the Cycle IX closure audit on the four remaining PDE obligations (TRAN, DUAL, KERN, AMP): proves pressure-only source transversality is generally impossible, a stronger 'forcing pairing implies source defect' NO-GO, exact dual-compatibility under causal/audit adjoint synchronization, and that the universal weak source-action budget is summable in scale. Reduces the surviving obstruction to a tangential singular-impulse phantom.
[branch-hub] NS-INRS
AMRAL's NS-INRS (Independent Navier–Stokes Research Series) sub-line: 63 rounds live (DCRP43-58 plus 43-QC, round 59 missing; DCRP60-105/X72-R44-88). Originally hidden inside NTLA-O's own source drop and mistaken for cross-reference files reprocessing DCRP's same-numbered papers, direct reading confirmed this is a separate continuation line bridging the two official series DCRP and X72 — DCRP43-58 is a same-numbered parallel branch, and from DCRP60 on the source text itself states rank-two local geometry is exhausted and the compound DCRP/X72 numbering formally begins; the 63 rounds form a single continuous chain of STOP-D nodes. DCRP105/X72-R88 is the current frontier, its own text listing eight concrete next-round to-dos with no language suggesting a stop. Global regularity remains fully OPEN. The underlying papers were authored directly in English — this page translates only the site's own commentary.
[document] DCRP76/X72R59: 2γ Stretch Resonance and Infinite Conveyor
Continuing from DCRP75's reduction of the independent turnover branch to a dynamic material-replacement/stretching branch, the candidate 'X-free escape route' requires pressure-curvature silence Π_P°=0 and periodic recurrence of the packet-centered kinetic-energy/enstrophy ratio Q_D°. This round works from D75's evolution equation (Q_D°)'=(2γ-σ_D)Q_D°-Π_P°/Z_D to derive that periodicity simultaneously forces two independent time-moment conditions — the material-averaged stretching rate must equal exactly 2γ, and the stretching modulation must be temporally orthogonal to the centered-packet scale — from which it further follows that any finite material-replacement cycle must carry a strictly >1 energy/enstrophy amplification factor e^{γκS₀}, so finite material cycles are excluded. At the same time, inward turnover requires the Euler observer to remain below DCRP61's neutral Floquet threshold, while the resonant material carrier must sit a fixed gap above that same threshold — the two cannot coexist within a finite cycle. The conclusion is that the sole surviving X-free equality route is forced into an infinite 2γ stretch-selection conveyor; if that conveyor stays coherently aligned, DCRP62 immediately forces its axial X72 pressure response to be strictly negative, leaving DCRP77 to test the tilt/pressure cost of crossing the threshold.
[document] DCRP103 / X72R86: Adjoint Eigen-Lock and Five-Ray Classification
Following the nonlocal tensor-ray eigen-lock kernel left by DCRP102, this round solves it completely at the level of local tensor algebra: diagonalizing the traceless strain S, it proves that every nonzero shear component must satisfy the resonance condition β=s_i+s_j=-s_k, that the diagonal traceless subspace is exactly span{S,C_S^0}, and it gives the complete five-ray spectrum for r=0 (three shear rays plus two coaxial rays); for r≠0 the nonlocal Riesz term loads only the coaxial sector without altering the shear resonance. Using the exact example (S=diag(1,0,-1), Φ=E13, r=0), it proves that the shear eigen-lock can indeed coexist with a nonzero transport–Riesz angular pairing, showing that pure tensor algebra alone cannot complete the proof. The conclusion moves the remaining problem entirely to the global nonlocal self-consistency equation r=T0*Φ (either a coaxial scalar fixed point or one of three shear–Riesz self-consistency systems), leaving the next round to examine the solvability of these nonlocal equations themselves.
[document] DCRP62 / X72R45: Aligned Neutral Pressure Compatibility and Convergence of the N Branch
Building on the invisible eigen-aligned Floquet equality mode DCRP61 found (neutral averaging rate λ*=(2−3γ)/2), this round asks whether that mode can simultaneously sustain a perfect pressure response. Differentiating the eigenvector relation along the material derivative yields the proper pressure–Hessian compatibility condition E_pΩ=−(λ'+λ+|Ω|²/6)Ω, and proves that under neutral Floquet averaging, the single-period directional integral of this pressure defect is strictly positive — meaning the mode cannot satisfy zero turnover, perfect pressure, and cognate periodic recurrence all at once. The non-affine-stretching 'N branch' that DCRP61 had opened is therefore closed as an independent terminal branch, converging fully into X∨T. STOP-D62 compresses the rank-two continuation down to just two global exits — X (X72 pressure/projection defect) and T (cognate turnover) — and hands to DCRP63 the task of judging which carries sharper new structure and should be attacked first.
[document] DCRP67 / X72R50: Aligned Two-Stress Spectral Geometry and Axisymmetric Self-Locking Modes
Building on DCRP66's reduction of the silent X branch to the 4:1 correlation balance Q_Cω=4Q_CC between the cofactor and the vorticity stress, this round works out the pointwise aligned spectral geometry underlying that balance: it proves every aligned traceless strain tensor has a unique spectral form S=(3λ/2)U_ξ+dH, determined solely by one transverse-anisotropy scalar d and the frame angle, and derives a 'pointwise co-axiality theorem.' The analysis shows only two zero-spin axisymmetric spectra (Type A and Type B) allow the cofactor to avoid intrinsic tensor spin, and for both the cofactor amplitude is frozen; X72's silence is thereby reduced to an exact orthogonality condition between 'the necessary spatial rotation of the cofactor's principal axis' and 'the necessary variation of the vorticity amplitude,' which is handed to DCRP68 to test the integrability of these two modes.
[document] DCRP89/X72R72: Ancestry-Exit Pricing and the Supplier-Speed Normal Form
Continuing from DCRP88's proof that every circulation atom must exit any compact loop-state class within a finite backward depth N*, this round prices that first exit, drawing on the native Morrey law from DCRP31 and the Bedrossian–Germain–Harrop-Griffiths warning about vortex-filament solutions (that circulation alone does not guarantee a volumetric energy lower bound). It proves: for a first exit whose support carries circulation ≥c_Γ and is geometrically tame, after filtering at a fixed tube scale ℓ*, if the filtering error carries at least half the circulation then it reverts to the existing increment/scale compiler; otherwise the filtered circulation remains ≥c_Γ/2, which via Young's inequality forces a fixed positive local tail-energy atom E_tube≥c_E>0. For J tame suppliers with overlap multiplicity M_J and maximum radius R_J, the native Morrey law gives the exact packing trade-off R_JM_J≳J (Theorem D89.7, the 'tail-packing NO-GO', explicitly flagged as 'an important correction to prevent overclaiming', since the Morrey law alone does not rule out an infinite sequence of tame suppliers). Conclusion: repeated regeneration cannot draw on a stationary, zero-cost tail source; this yields two new quantified normal forms — bounded overlap forces suppliers into at least linear-speed escape (the linear-speed supplier conveyor S_tail^lin), or bounded radius forces divergent supplier multiplicity (S_mult) — left for DCRP90 to test whether the linear-speed supplier can coexist with the existing far-field/PFET/interaction costs.
[document] DCRP68 / X72R51: Collapse of Axisymmetric Director Integrability
Building on the two zero-spin axisymmetric candidate modes (Type A, Type B) that DCRP67 screened out, this round adds a constraint the previous round left uncounted: S+R=∇V must genuinely be a Euclidean velocity gradient, which requires satisfying the first-order compatibility equation ∂kLij=∂jLik. A pointwise computation of Type A's first-order jet-system determinant gives (r²−9λ²)(r²+9λ²)²/256, showing rigidity everywhere except one resonance point that collapses on its own under uniform stretching; Type B's unique torsion, meanwhile, produces a nonzero Euclidean-frame curvature and so must vanish. Both modes are thereby closed, and both would force the vorticity direction to stay fixed in space, contradicting isotropic third-order covariance — the conclusion is that every surviving aligned/no-flip branch must carry positive-measure cofactor shape activity, which is handed to DCRP69 to test whether this activity can cancel against a pressure/transport phase lock.
[document] DCRP102 / X72R85: Backward Adjoint Dynamics and the Copula Cone
Following the joint second/third-moment lock problem left by DCRP101, this round derives the exact backward adjoint equation for the pulled-back X72 test Φ, and proves that no universal invariant-sign half-space exists (the No-Invariant-Sign-Cone result): using the explicit example G=diag(1,-1,0), it shows that at a detector zero, admissible local strains S=±G push the detector projection to opposite signs, so fixed-sign transport–Riesz recurrence cannot be read as pointwise adjoint-sign conservation. But on the complementary regular pair-scale branch, it proves that a fixed positive transport–Riesz source together with a compact amplitude bound forces a positive-measure pair set into a strict oriented angular cone, and a finite pair-state pigeonhole argument yields a fixed recurrent angular cell. The conclusion gives a new dichotomy: the adjoint direction either pays a positive angular action, or falls into an explicit nonlocal tensor-ray eigen-lock kernel, leaving the next round to classify the complete tensor-ray structure of this eigen-lock kernel.
[document] DCRP45: Canonical-Ray Compression of the Annular Strain Supplier
Building on the untested implication DCRP44 posed — 'finite annular PFET/strain supplier ⟹ C_qz≠0 or F_sz≠0' — and combining DCRP41's fixed-plane zero-deformation branch with DCRP35's annular-supplier localization result, this round proves the implication is false at leading affine order: the symmetric trace-free affine strain decomposes orthogonally into 1+2+2 dimensions, and the canonical-ray component a(s)C_n is fully compatible with the gauge-flat normal form, so the 'supplier breaks flatness' route closes entirely. But projecting DCRP36's annular affine-jet equation onto the canonical ray collapses the original five-dimensional affine-phase frontier into a one-dimensional signed canonical-ray regeneration problem, whose regeneration action gap is strictly positive. STOP-D45 confirms that finite annular strain supply is compatible with gauge flatness, with the survivor reduced to a one-dimensional signed canonical-amplitude regeneration problem, left to DCRP46 to explicitly compute j_dil, j_adv, j_str and test their coupling to PFET.
[document] DCRP50: Central-Response Affine NO-GO and the Three-Component Frontier
Building on DCRP49's central-response reduction c=B_q=1/2, and combining DCRP38's affine/non-affine strain-residual decomposition, DCRP41's fixed-plane zero-deformation tensor, and the affine pressure-response defect and vorticity-stress realizability frontier from X72 Round37 and 42–43, this round substitutes c=1/2 back into the flat scalar representation and proves that the mixed pressure Hessian ∇_hP_z automatically vanishes (two of the five mixed components of the X72 defect cancel identically), compressing the remaining defect exactly to three components. It further proves a central-rigidity theorem: a canonical affine pancake (S=A_pan) cannot coexist with nonzero planar vorticity — affine strain forces the vorticity to zero — constituting an explicit 'exact-affine NO-GO'. STOP-D50 establishes that this cofactor-invisible central response cannot realize a pointwise canonical affine pancake with nonzero vorticity: every active central survivor must carry non-affine strain, turnover/cancellation, a residual three-component pressure defect, or must solve the full nonlinear wave–pseudo-eikonal system, left to DCRP51 to analyze whether that system forces q to be affine.
[document] DCRP96 / X72R79: Circulation Young Profile and Nematic Lock
Following DCRP95's sign-coherent SGS phase-slip conveyor C_slip, this round tests the original hypothesis that sign-coherent circulation slip forces a nonzero barycenter shift in the increasing Young profile, and the answer is no (the Barycenter NO-GO): the SGS circulation functional is quadratic in the velocity increment, so a centered, sign-symmetric Young measure (such as (δ_{e1}+δ_{-e1})/2) can still carry a nonzero circulation flux. The true rigidity variable is the deviatoric second moment: it proves that sign-coherent phase slip instead forces a trace-free deviatoric/nematic covariance lock, and that circulation reset and positive SGS work are two linear projections of the same deviatoric covariance, so pure covariance algebra cannot rule out both holding at once. The conclusion leaves the next round to determine whether this narrowed dual-lock PSD cone is compatible with rank-two carrier geometry and X72 dynamics.
[document] DCRP82/X72R65: Codimension-Two Trace Barrier and the Kelvin Concentration Defect
Continuing from DCRP81's reduction of the Kelvin residue to the subgrid-scale circulation flux K^sgs_ℓ and its proposed plan to absorb this via tubular thickening into the existing volume-type commutator detector, this round tests whether that absorption holds unconditionally. It proves that it does not: it constructs an explicit codimension-two kinematic counterexample — a function that concentrates near a curve, with O(1) line-trace mass while its tubular-normalized volume mass tends to zero — showing that no universal trace-to-volume inequality can exist. It derives the exact factorization S̃_C=Θ_tr·S̃_T, where Θ_tr is a dimensionless codimension-two trace ratio, and shows the absorption goes through only under the additional assumption Θ_tr≲1 — an important correction to the D81 plan. Conclusion: the Kelvin terminal problem reduces to R_K⟹S̃^(4)_active∨R_tr∨known material noncompactness; the second-order viscous mystery has been reduced in order to a first-order material line-trace concentration problem R_tr, left for DCRP83 to test whether Θ_tr→∞ forces a finer active transverse scale.
[document] DCRP66 / X72R49: Cofactor Null-Channel Repair and Two-Stress Correlation
Building on DCRP65's claim that all three of X72 Round38's null channels are now closed, this round points out that the claim needs correction: X72 Round38's own pressure self-commutator null identity shows that the defect factor actually entering the triple increment commutator is the strain cofactor δC_S⁰, not δE_p alone — so the δE_p increment budget DCRP64 proved does not rule out the cofactor itself being spatially constant. This round uses the cofactor's proper norm identity |C|²=|S|⁴/6 to prove, under the aligned branch and isotropic covariance, that a spatially constant cofactor is likewise impossible, completing this overlooked null-channel repair. Since the pressure source is exactly the difference between the cofactor and the actual vorticity-stress amplitude, the true triple-correlation frontier is thereby reduced precisely to a single 4:1 correlation-balance condition, Q_Cω=4Q_CC, which is handed to DCRP67 to address its spectral geometry.
[document] DCRP64 / X72R47: Constant-Defect Null-Channel Exclusion and Forced Pressure Increment
Building on DCRP63's reduction of the X branch to two cases — 'spatial oscillation of the pressure-response defect' versus 'the defect trapped in X72 Round38's spatially constant null channel, with the stretching eigenvalue instead paying the cost via temporal Floquet modulation' — this round proves the second branch impossible: on the aligned/no-flip finite-compensation branch, any spatially constant traceless tensor is orthogonal to B by isotropic covariance, so if the null channel held it would force the neutral stretching rate to satisfy λ'+λ=−M₄/6Z<0, which, once integrated over one DSS period, contradicts the period-averaged neutrality condition. This closes X72 Round38's N1 (δE_p=0) null channel, proving that the aligned branch must carry a strictly positive, cumulatively increasing pressure-defect budget, leaving N2 (δq=0) and N3 (δV=0) for DCRP65 to handle.
[document] DCRP72/X72R55: Critical Twist Collapse and Multi-Axis Mosaic Residue
Continuing from the unique native residual branch left after the DCRP71 audit — the critical twisting transparent cylinder that can saturate the linear Morrey bound — this round proves that genuinely smooth active twisting cannot realize this endpoint: it defines the material rate of change of the cylinder angle, Θ, and proves that either Θ≠0 or an unsteady tangential component produces cubic energy growth E(R)≳R³, contradicting the native linear Morrey bound, so Θ=0 must hold and the velocity along the instantaneous axis direction must be translation-invariant. It further proves that a nonzero twist rate θ_z forces the vorticity to be horizontally uniform, producing E(R)≳R² and is likewise excluded. Genuinely smooth twisting is therefore completely excluded at the native Morrey endpoint, and the only surviving transparent critical tail collapses to a 'multi-axis mosaic of straight cylinders separated by material zero-vorticity corridors'; whether two or more non-parallel cylindrical sectors can coexist is handed off to DCRP73.
[document] DCRP73/X72R56: Cylinder Mosaic Absorbed into the Turnover Branch
Continuing from DCRP72's reduction of the critical transparent tail to a multi-axis mosaic of straight cylinders, this round proves that the mosaic is not an independent third branch: from the axial local velocity-invariance already proved in D72, the stretching term within every active sector of the mosaic is identically zero, and the similarity vorticity equation reduces to D_sΩ=-Ω, so vorticity decays exponentially as e^{-s} along material paths with fixed direction; the corresponding enstrophy density satisfies D_s e_ω+2e_ω=0 and, after the similarity-volume correction, decays as e^{-(2-3γ)s}. Consequently, a finite material-sector cycle cannot recur periodically without replenishment — a periodic cylindrical state must carry a strictly positive inward enstrophy/material-replacement budget, which is exactly the defining feature of the existing T turnover branch. The conclusion is that the critical-cylinder-mosaic endpoint is fully absorbed into T, restoring the native global frontier to the 'active X vs. material turnover' dichotomy, and leaving DCRP74 to jointly analyze enstrophy turnover and PFET on the same finite annulus.
[document] DCRP58: Cylindrical Transparent-Tail Elimination and Outer Closure
Building on DCRP57's result, which excluded only the straight cylinder and left the twisted-cylinder and affine-hinge routes unclosed, this round closes both out using DCRP30/Xue's DSS periodic-average velocity-energy sublinear bound E(R)=O(R^κ) (κ=3−2α∈(0,1)). For the general representation of a fixed-plane transparent tail, it proves: if the transverse affine vorticity offset β≠0, a dual-curl test gives E(CR)≳R², contradicting the sublinear bound, so β≡0 must hold; in the pure cylindrical-shear case, a nonzero constant slope likewise violates the sublinear bound, so f_r≡0. Altogether, divdiv(Ω⊗Ω)=0 combined with a fixed plane and the sublinear energy bound forces Ω=0, ruling out every fixed-plane transparent tail — straight, twisted, or affine-hinged — entirely. STOP-D58 therefore declares the rank-two zero-residual visibility-compensation branch globally closed, handed to a later residual-branch confluence round (DCRP59, not included in this folder) for further treatment.
[document] DCRP70/X72R53: Double-Integrability Rigidity and Straight-Tube Energy NO-GO
Continuing from the unique local phase-lock algebraic mode found in DCRP69 (strain frame and shape ratio c materially frozen, H_P uniquely specified), this round tests whether that state can simultaneously satisfy the first-order-jet versions of velocity-gradient integrability L=∇V and pressure-Hessian integrability H_P=∇²P. An exact solution shows that double integrability freezes the physical vorticity direction pointwise; incompressibility then forces any globally persistent phase-lock component to correspond to a single entire straight vortex tube, and the curl–energy duality relation gives a local energy growth of at least linear order, E(R)≳R. This directly contradicts the sub-linear tail growth E(R)=O(R^κ) (κ<1) required by DCRP30 / the strict-DSS tail, so the global phase-lock equality branch is closed — proving that it can only terminate in active X72 dynamics or material turnover — leaving DCRP71 to handle the finite cofactor-angle jump.
[document] DCRP47: Dual-Current Critical Scaling and the Characteristic Window
Building on the two forced finite-annular observables DCRP46 left behind — DCRP31's PFET current and DCRP46's scalar transport current — this round tests whether the two being simultaneously positive constitutes a new same-parent recurrence-exhaustion contradiction. The answer is no: exact same-parent rescaling shows the two currents scale as e^{-(5γ-2)S_0} and e^{S_0} respectively, landing precisely on the same critical scaling orbit, so the magnitude contradiction closes entirely. But this yields a new anisotropic divergence identity for the flat-pancake branch that excludes the closed elliptic response sector, forcing every nonzero survivor either into the characteristic window 0≤B_q≤1 or to output a finite boundary/transition flux. STOP-D47 confirms that the dual-current magnitude route is exactly critical, and that the real obstruction shifts to the flat-pancake characteristic compatibility equation, left to DCRP48 to derive the evolution of c=B_q and test the invariance of the [0,1] window.
[document] DCRP97 / X72R80: Dual-Lock PSD Cone and the Pancake Gap
Following DCRP96's dual-lock deviatoric covariance cone, this round finds that the originally planned next step — imposing the increment-covariance condition Qn=0 directly from the normal vector of the DCRP40 vorticity covariance — had silently conflated two distinct objects, the velocity-increment covariance Q and the filtered-vorticity covariance B_ω, and so first performs a 'scope repair,' measuring the misalignment between the two via the increment normal share θ_Q instead. Anchored at the DCRP40 canonical pancake affine jet A*, it proves that the positive-SGS-work lock forces the sum of θ_Q and the strain's deviation from A* to have a positive lower bound: under an exact planar lock the pancake-equality state is excluded because it would give negative work, but under a general rank-two anisotropic strain the dual-lock cone is not empty, so pure algebra cannot complete the proof. The conclusion notes that the dual-lock survivor maintains a consistent transversal distance from the old D40–60 pancake/X72 equality manifold, leaving the next round to reattach this transversal gap to X72, non-affine vorticity stretching, or material-turnover coordinates.
[document] DCRP91/X72R74: Filamentation Terminal Elimination and the Directional-Diffusion Compiler
Continuing from DCRP90's closure of the material-support escape, leaving only the material filamentation escape R_fil, and drawing on the curvature/direction compiler from DCRP50, the time-sliced Morrey law from DCRP71, the filamentation-is-noncompactness result from DCRP79–80, the scale-gap debt from DCRP85, and the finite ancestry depth from DCRP88–90. It proves that R_fil is not an independent terminal coordinate: the exact tube-volume formula |T_r(C)|=πr²L(C) shows that bounded support plus a positive reach radius gives a uniform upper bound on loop length, so length blow-up must force the reach radius to collapse, which in turn splits into either tube self-approach/multiplicity (state noncompactness) or curvature-scale collapse. On the carrier-locked rank-two branch, the D50 curvature compiler converts curvature folding into rank transition, filtered-vorticity-magnitude-direction activity, or second-order tube geometry (collectively R_FV), while filamentation witnesses that tend toward shrinking relative scale are exactly D85's scale-gap debt. This round explicitly does not identify the material line tangent with the vorticity direction, nor does it claim that R_fil implies X72. Conclusion: R_fil is fully absorbed as R_fil⟹R_state∨R_FV∨D_gap∨R_crit; there is no longer any generic 'tail' or 'filamentation' placeholder — the entire shared-ancestry material-regeneration branch now terminates only in already-declared finite-scale/state/reservoir coordinates, and the remaining problem is a recursion/budget question about these already-visible defects rather than further escape classification — left for DCRP92 to seek a single joint recursive budget.
[document] DCRP100 / X72R83: Finite-Lag Duhamel and the Rotational SGS Kernel
Following DCRP99's bounded-lag X72–Kelvin term, this round tests the tempting inference that Kelvin SGS reset directly causes the subsequent X72 defect, and proves that this does not currently hold, for two reasons: first, a level mismatch — DCRP95's Kelvin reset is a pre-filter-limit SGS circulation source that X72 Round37's defect equation does not treat as an independent forcing term; second, a rotational SGS kernel — Kelvin circulation senses only the rotational component, while the direct strain/pressure response senses the symmetric-gradient component, and it constructs an explicit counterexample: the rigid skew-symmetric vortex force f(x)=Bx has zero symmetric gradient but nonzero circulation, and can be realized by a local PSD Reynolds stress R_B, proving that positive Kelvin slip can be orthogonal to the direct X response. The conclusion uses X72 Round37's exact Duhamel formula to decompose the delayed X test into a memory term plus four forcing channels, identifies the transport–Riesz channel as the highest-leverage one, and leaves the next round to determine whether this channel can share the same increment profile as the Kelvin slip.
[document] DCRP92 / X72R75: Finite-Scale Confluence and the Joint Detector
Following DCRP91's reduction of the same-parent material-regeneration problem to a five-term disjunction, this round compresses the first three finite-scale branches (fixed-relative filtered-vorticity activity, the D26 SGS recurrence detector, and scale-gap debt) into a single joint detector vector J. It proves that on the compact same-parent material-regeneration class, the ℓ∞ norm of J must have a positive lower bound, and a finite-coordinate pigeonhole argument then shows that some fixed detector coordinate must recur with positive density at least 1/(M_J N*), so the survivor can no longer evade this indefinitely by switching defect types. The round states plainly that this does not yet amount to a global exhaustion contradiction — the detector can recur at positive density while still paying only a geometrically summable physical cost — leaving the next round to address the relationship between positive-density finite-detector recurrence and non-summable regeneration debt.
[document] DCRP90/X72R73: Finite-Time Tail-Transport Infeasibility Theorem
Continuing from the sole tame tail survivor left by DCRP89 — the linear-speed supplier conveyor S_tail^lin — this round tests whether it is compatible with the finite ancestry-depth dynamics of DCRP88, drawing on the far-field amplification of DCRP21, the PFET of DCRP31, the time-sliced Morrey law of DCRP71, and the increment/trace/scale compilers of DCRP82–85. It proves Theorem D90.8 (finite-time material tail-transport NO-GO): if a material loop arc reaches radius R and returns to the compact core within a uniform upper bound T*=N*S0, the self-similar rheological-parameter formula forces it to pay O(R) of speed action. Splitting this at a fixed filter scale: if the filtering error carries this action, it forces an O(R⁴) increment trace (an already-known defect); if it is instead carried by the filtered velocity, then on a bounded-stretch/tame world-sheet it must pay O(R²) of volumetric tube energy — but the native time-sliced Morrey law supplies only O(R) of energy over the same bounded time, producing a contradiction for large R, and hence a finite upper bound R_tame<∞ on the tame tail radius. Conclusion: D89's linear-speed supplier is fully absorbed into the increment/filamentation/state defects; no independent sparse tail conveyor exists. The material-support escape branch is thus largely closed, while D21's far-field Euler source and D31's PFET remain independent, separately standing obligations — left for DCRP91 to test whether the remaining material filamentation escape R_fil is itself independent or reducible.
[document] DCRP44: Gauge-Covariant Pancake Connection and Flatness Classification
Building on DCRP43-QC's discovery that the scalar q carries residual gauge freedom, and on the defect that DCRP42's condition G=F_z+2a=0 fails to be gauge-invariant when F_q≠0, this round repairs it. It constructs the gauge-covariant connection coefficients A_z, A_s and the covariant differential operator on nondegenerate blocks, identifies two gauge-invariant primitive defects — the torsion-type C_qz and the curvature F_sz (Theorem D44.3) — and proves that when both vanish, a periodic canonical gauge exists and is unique. The new STOP (STOP-D44) is corrected to: the true canonical-pancake equality branch is the gauge-flat connection class C_qz=F_sz=0, not the original G=0; the next round, DCRP45, will test whether a finite annular PFET/strain supplier forces this flatness defect to be nonzero.
[document] DCRP46: Gauge-Flat Annular Scalar Moment and Signed Transport Gap
Building on DCRP45's one-dimensional canonical-amplitude reduction, this round asks whether its signed regeneration can be supplied purely by internal vortex stretching within the annulus, or whether a genuine finite annular transport carrier is required, adopting DCRP44's unique periodic canonical gauge. Writing the canonical annular strain amplitude as a gauge-invariant weighted moment of the scalar q yields the exact transport identity a_ψ'+k(s)a_ψ=T_ψ(s); a periodic-average identity together with Jensen's inequality proves ∫T_ψ ds is strictly negative, and this sign survives robustly whenever the DCRP35/45 localization error is small enough. STOP-D46 therefore excludes the 'fully flat, aligned, periodic, zero-transport' branch, establishing that finite annular scalar transport is a forcing term with a strict signed periodic gap, left to DCRP47 to compare this transport current against DCRP31's PFET current under same-parent rescaling.
[document] DCRP53: Global Cylindricity and the X72 One-Quarter Visibility Slice
Building on DCRP52's local developable-envelope and finite-caustic conclusions, this round brings in the Hartman–Nirenberg cylinder theorem as an external tool and asks whether an entire self-similar time-slice can globally sustain a rank-one central perfect response. It proves that if the whole slice is C³ with rank ≤1, its image is a complete flat hypersurface and, by the cylinder theorem, must be a generalized cylinder; but the wave equation requires the cylinder-axis direction to be G-isotropic, while the pseudo-eikonal identity requires that same direction to be M-isotropic, and the two are compatible only for the zero vector. Hence no nonzero global central perfect-response solution exists, lifting DCRP52's local caustic conclusion to a coordinate-independent global statement. It is also shown that null-Hessian blocks satisfy an exact X72 differential identity with visibility fixed at 1/4. STOP-D53 hands to DCRP54 the question of whether the visibility defect on the transition shell can be localized into transparency.
[document] DCRP86/X72R69: Hardy Annularization and the Single-Component Work Gap
Continuing from the linear finite-chain bad-scale debt obtained in DCRP85 using a four-term standard cost package (C3,k plus leakage, pressure tail, and PFE residue), this round carries out the forest-budget audit originally planned. The audit finds that D85's usage needs correcting: the actual closed proof of the 2026 finite-chain original theorem uses only the single-component term C3,k (bad scale ⟹ C3,k≥ε3(M)>0); the other three terms, while honest nonnegative ledger entries, have not been independently shown to close CKN badness. Building on this, it derives an exact discrete Hardy identity that converts the heavily overlapping nested-core costs into pairwise-disjoint parabolic-shell debts, proving that the overlap itself can be resolved exactly and is not a genuine obstruction. At the same time, it proves Theorem D86.4 (critical shell additivity NO-GO): the critical model F(r)=cr² shows that the normalized shell debt can diverge even while the physical L³ mass remains finite, so packing alone cannot yield a mandatory global budget. Using the coarse-grained CKN decomposition Ψ(r)≤4Ψ^ℓ(r)+4Ω^ℓ(r), the remaining problem is narrowed to an observability question — whether already-resolved badness can be converted into signed pressure-flux work — left for DCRP87.
[document] DCRP93 / X72R76: Homogeneity-Sign Principle and the Critical Replacement Conveyor
Following DCRP92's proof of positive-density recurrence for a fixed detector, this round tests the intuitive conjecture that positive density plus a fixed positive cost should force an unbounded physical budget, and proves it false for every detector with positive physical homogeneity exponent p>0: the cost ℓ_n^p J_n is geometrically summable over any subset of generations, so positive density supplies no extra coercive force (the Positive-Density Budget NO-GO). It also computes the homogeneity exponents of energy/PFET (p=κ>0), the coarse-grained work chain (p=1>0), and circulation (p_Γ=1-α<0), showing that Kelvin circulation succeeds precisely because its homogeneity is negative. The round compresses the remaining compact equality survivor into a single positive-homogeneity critical replacement conveyor C_work^{+h}, and states plainly that the next round must switch to a nonpositive-homogeneity, conserved/finite-capacity regeneration witness rather than adding yet another energy or work tax.
[document] DCRP57: Isotropic Residual, Straight-Cylinder NO-GO, and Twist Tail
Building on the two normal forms DCRP56 produced — the rank-three covariance and the cylindrical tail — this round checks each in turn using DCRP38's proper vorticity-covariance ledger and DCRP30's DSS sublinear energy-growth law. Substituting B=ρI into the ledger proves that the isotropic rank-three branch is not a zero-defect equilibrium but must continually pay a residual R_B=[ρ'+(2−3γ)ρ]I−2ρA, whose per-period norm is bounded below in proportion to DCRP56's ρ≥Z_in/2. It further proves that a globally straight cylindrical tail contradicts the DSS sublinear velocity-energy law, giving a NO-GO, which restricts the tail's only possible surviving forms to a twisted cylinder or an affine-hinge transition chain. STOP-D57 hands to DCRP58 the task of analyzing the coupling between pressure/PFET and the twisted cylindrical tail, to determine whether it can be excluded entirely.
[document] DCRP101 / X72R84: Joint-Path Young Profile and the Second/Third-Moment Lock
Following DCRP100's selected high-leverage transport–Riesz branch C_TRΓ^{ℓ*}, this round tests whether the Kelvin second-moment Young profile already forces the transport–Riesz sign, and proves the negative with an explicit Rademacher-coupling counterexample: the one-factor marginals and pairwise marginals can be made completely identical while the mixed third moment can still be positive, zero, or negative, so no theorem that derives the sign from second moments or pairwise correlations alone can hold. Together with a scope repair between DCRP100's finite-lag Duhamel term and the X72 Round38 defect-energy pairing, this round fixes the surviving paradigm as a joint-path covariance lock carrying both the Kelvin second-moment lock and the transport–Riesz mixed-third-moment lock simultaneously, reducible via DCRP66's 4:1 identity only on the zero-lag defect-energy subbranch. The conclusion leaves the next round to determine whether the pulled-back X72 adjoint test can maintain a fixed sign correlated with this third moment under a fixed lag.
[document] DCRP88/X72R71: Kelvin Circulation Regeneration Depth and Ancestry Escape
Continuing from DCRP87, which closed work-visibility on the compact class but left the uniform normalized work gap summably convergent because the coarse-grained exhaustion theorem carries geometric weights w_k=r_k/r_0, this round asks whether compact shared-ancestry regeneration can exploit this summability indefinitely; it draws on the Kelvin circulation resupply from DCRP32–33, the native Morrey law from DCRP31, and the 2026 Constantin–Ignatova–Vicol self-similar Weber/Kelvin law (2/5<γ<1/2). It proves that it cannot: compact resolved badness must force a uniform finite family of nonzero circulation atoms (otherwise curl-free plus divergence-free together with the Morrey law would force U≡0, contradicting Ψ^ℓ≥b0). Combined with the strict type-II Kelvin circulation multiplier ρ_Γ=e^{-(1-2γ)S0}<1, the backward ancestry of any circulation atom is amplified by a factor of ρ_Γ^{-n}, so it must exit any compact loop-state class within an explicit finite depth N*=1+⌊log(Γ*/c_Γ)/log(1/ρ_Γ)⌋, and this conclusion is unaffected by the geometrically summable work weights; it further proves that finite loop permutation is impossible (Theorem D88.9). Conclusion: fixed-order badness cannot regenerate indefinitely through a compact material ancestry — any infinite regeneration must repeatedly enter one of the existing terminal channels: tail, filamentation, state, increment, or scale gap — left for DCRP89 to quantify the cost of this first departure.
[document] DCRP94 / X72R77: Kelvin Reset Graph and the Nonpositive-Homogeneity Sidecar Theorem
Following DCRP93's isolation of the positive-homogeneity critical replacement conveyor C_work^{+h}, this round proves that this conveyor cannot by itself constitute a complete same-parent regeneration mechanism and must be paired with a circulation-reset 'sidecar.' Using DCRP88's finite family of circulation states and the strict Type-II Kelvin holonomy contraction rate ρ_Γ<1, it derives an exact reset Duhamel formula and proves that on the finite material-shadowed loop-state graph, every block of M+1 generations must contain either a carrier/state replacement or a uniform circulation-reset event, and that this reset carries exactly the nonpositive homogeneity D93 required. The round admits that it has not yet proved the reset source has finite total capacity — a constant-circulation recurrence counterexample shows that a p=0 reset can persist algebraically forever — leaving the next round to address whether the SGS circulation-reset source has finite capacity, framed as a phase-slip encapsulation problem.
[document] DCRP81/X72R64: Mesoscale Kelvin Decomposition and the SGS Circulation Bridge
Continuing from the single pure-Navier–Stokes terminal coordinate R_K singled out by DCRP80 (the one-period viscous Kelvin residue K^visc_n), and using the filtered-vorticity commutator architecture from DCRP33 and DCRP20–26, this round performs a mesoscale decomposition of it. It proves the exact three-term decomposition K^visc=M_ℓ+K^fvisc_ℓ+K^sgs_ℓ (endpoint-loop shadowing error, filtered viscous circulation, and subgrid-scale circulation flux), and shows that within the mesoscale window ℓ_n=ε_n^p (0<p<2/7) the filtered viscous term vanishes, while the subgrid-scale circulation flux is exactly the pairing of the filtered-vorticity differential commutator force against the spanning surface — so R_K is no longer an irreducible mystery second-order mechanism. However, it explicitly states that this pairing has not yet been shown to be necessarily captured by the existing volume-type commutator detector — a trace/tubular-thickening step is needed, and the gap is left for DCRP82 to address the codimension-two trace-visibility problem.
[document] DCRP54: Localized X72 Visibility Defect and Shell Leakage
Building on DCRP53's proof of the null-envelope block identity T₀*W_Ω=(1/3)|Ω|² and its conclusion that such blocks cannot fill an entire spatial slice and must undergo a finite structural transition, this round asks what happens if the internal stress is localized before that transition occurs. It proves that any nonzero compact localization necessarily produces a source term on the truncation shell — since divdiv(Ω⊗Ω)=0 inside the block, the source comes entirely from the localization itself — whose quadrupole moment exactly reproduces the internal vorticity dyadic mass, with the Riesz field leaking along the normal direction at rate r⁻³. Hence no compactly supported nonzero vorticity-stress fragment can be fully transparent to the localized Piola–vorticity law. STOP-D54 hands to DCRP55 the question of whether a finite exterior multipole compensation can cancel this r⁻³ leakage.
[document] DCRP84/X72R67: Logarithmic Capacity, Matched Atoms, and Scale Escape
Continuing from the strongest surviving branch singled out by DCRP83 — the matched line atom R_atom — this round tests whether it can form an independent new compact terminal. It proves that neither the native Morrey energy nor a general viscous-gradient packing argument can directly rule out thin atoms (two NO-GOs: the Morrey packing NO-GO and the naive diffusion packing NO-GO), because codimension two is critical at logarithmic scale, with an optimal transverse H¹ capacity cost of only 1/logΛ. It further proves, however, that an infinite silent cascade of matched atoms must force the adjacent-generation ratio r_{j+1}/r_j→0, since otherwise D82's trace ratio would remain bounded and the volume-type increment detector would necessarily be positive. Conclusion: R_atom is fully absorbed into the existing volume-type increment branch, relative-scale/shell escape, or state compactness failure — no independent Kelvin/trace/line-atom terminal mechanism exists — left for DCRP85 to handle the surviving relative-scale escape coordinate R_scale.
[document] DCRP71/X72R54: Endpoint Energy Audit and Critical Twisting Residue
This round conducts a scope audit of the 'endpoint' of DCRP61-70, distinguishing the project-native, unconditionally valid time-sliced Morrey bound ∫_{B_R}|V|²≤CM₀R from the Xue-type DSS sub-linear tail R^{3-2α}, which requires an additional global-integrability hypothesis (conditionally valid only for 1<α<3/2). It points out that earlier exclusion results relying only on R^{3-2α}=o(R) must all be flagged as conditional, unless they can be repaired using the native Morrey bound instead. This round repairs and strengthens several existing results on that basis: it proves that the phase-lock tube actually forces cubic energy growth E(R)≳R³, which the native Morrey bound alone excludes without needing the Xue exponent (a stronger result than DCRP70), and likewise natively excludes both a flat pressure source and a globally straight cylindrical tail. After the audit, the only residue that cannot be natively excluded is the 'critical twisting transparent cylinder', which can exactly saturate the linear Morrey bound; the native frontier is reset to a three-way case — 'active X72, material turnover, or critical-twisting cylindrical tail' — leaving DCRP72 to handle that cylinder endpoint.
[document] DCRP98 / X72R81: Moving-Pancake Gap and X/N/T Confluence
Following DCRP97's exclusion result for the frozen canonical pancake tensor, this round points out that reading it as excluding the entire DCRP41 moving-pancake equality manifold would overstate the proof — a correction for what D97 missed: DCRP41's actual zero-shape equality manifold is the time-dependent moving pancake jet A_pan(s), whose coefficient a(s) is positive on period average but may change sign during part of the period. It proves that under the planar lock Qn=0 the motion term is invisible to SGS energy transfer, so positive SGS work can coexist algebraically within the zero-shape action via a temporary reverse-pancake phase (a(s)<0). However, this correction creates no new endpoint: DCRP50 still excludes the nonzero pure-affine central pancake, and DCRP60 proves that any nonzero continuation must exit into X∨N∨T, so this round's dual-lock phase-slip conveyor is not an independent endpoint but reconverges into the older X72/non-affine-stretching/turnover compiler — leaving the next round to overlay the Kelvin slip sidecar and re-examine X/N/T recurrence.
[document] DCRP55: Multipole Compensation, Rank Lift, and Tail Escape
Building on the far-field formula for localization leakage that DCRP54 derived, and drawing on the DSS exponent window and annular-supplier results of DCRP30, DCRP31, and DCRP35, this round asks whether a finite exterior vorticity-stress carrier can transparently compensate for that leakage. It proves that canceling the leading r⁻³ term in every direction is equivalent to requiring M^in+M^out=cI — that is, the exterior carrier must isotropize the accumulated vorticity dyadic moment. But M^out is positive semidefinite while M^in is degenerate in the normal direction, so a finite in-plane compensation is impossible: any effective compensation must lift the normal-direction vorticity to at least half of the internal core's. STOP-D55 splits the problem into two as-yet-unclosed routes — a finite rank-lift ring, or an infinite-vorticity (non-L²) critical tail — handed to DCRP56 to pursue separately.
[document] DCRP80/X72R63: Noncompact-Escape Absorption and the Terminal Compiler
Continuing from the catalogue of eight noncompact escape modes left by DCRP79, and drawing on the forced-inward PFET from DCRP31, the circulation-resupply/filamentation/viscous-Kelvin-shadowing architecture from DCRP33, and DCRP59–62 and 77–79, this round audits each mode in turn to determine whether it constitutes a genuinely new terminal mechanism. It proves that none do: all eight modes can be absorbed into DCRP33's four existing terminal coordinates — material tail/ancestry escape R_tail, filamentation R_fil, state/packet compactness failure R_state, and pre-limiting second-order viscous Kelvin residue R_K — yielding a finite rank-two terminal compiler O_PFET∧(X∨R_tail∨R_fil∨R_state∨R_K); the late-stage X72/T research line thus collapses entirely back onto the old shared-ancestry resupply architecture. Of the four, only R_K is genuinely Navier–Stokes-specific (it can remain nonzero even when the Euler object itself is well-behaved), so it is designated the top priority for DCRP81, to be bridged via Stokes' theorem and second-order vorticity derivatives/filtered diffusion.
[document] DCRP52: Null-Hessian Envelope Integrability and the X72 Lift
Building on the rank-one null-Hessian survivor cone DCRP51 obtained on the positive pseudo-eikonal sector (C>0), and drawing on X72 Round43's vorticity-stress nonlinear realizability cone (STOP-C47), this round asks whether Hessian integrability eliminates this null cone. It proves that it does not: every non-affine block is exactly a developable-envelope local normal form (its gradient curve lies on the pseudo-eikonal hyperboloid and moves along a wave-null direction), so unconditional local affine rigidity on the positive-C sector is false, and this envelope still satisfies X72 vorticity-stress realizability pointwise. But every non-affine realization necessarily produces a finite caustic/transition frontier. STOP-D52 hands the problem to DCRP53: can same-family continuation cross this finite transition set?
[document] DCRP75/X72R58: Packet-Centered Pressure Work and the T→X Confluence Bridge
Continuing from DCRP74's proposed 'scale-matched counterflow conveyor' as a candidate zero-stretch T equality, this round rules out the two simplest ways it could stay silent toward X72. First, it proves that the material pressure work can be properly decomposed into a packet-wide translation term Mb·g and a genuinely internal pressure-curvature work Π_P° (which admits a paired-increment representation and is sensitive to the pressure Hessian), completely quotienting out all affine pressure jumps. Second, it proves that any closed, nonzero-vorticity, zero-stretch packet must carry a strictly positive pressure-gradient increment and Hessian-curvature budget, so pure affine pressure alone cannot sustain DCRP74's counterflow conveyor. More strongly, the actual D72/D73 cylinder-mosaic state continually satisfies SΩ=0, so DCRP62 gives E_pΩ=-|Ω|²Ω/6 directly, and hence |E_p|²≥|W_Ω|²/24 holds pointwise — this explicit zero-stretch T conveyor is therefore already an X72 defect state. A T-residual branch genuinely independent of X must instead draw on nonzero stretching, alignment collapse, or genuinely non-closed material replacement, leaving DCRP76 to test the route of 2γ stretch resonance.
[document] DCRP49: PFET–Neumann Independence and Off-Central Rigidity
Building on the two pressure observables DCRP48 left behind — DCRP31's PFET and DCRP48's pressure-Neumann/mixed-Hessian response — and formally connecting for the first time to the cofactor/pressure-response coherence and vorticity-stress realizability frontier of X72 Round36, 37, and 41–43, this round tests whether the two pressure channels obey a universal algebraic coupling. The exact affine Euler solution u=S_0x, p=-½x^TS_0^2x serves as an explicit counterexample: its PFET current is identically zero while its pressure-Neumann flux is strictly positive, so no universal coupling theorem holds. Instead, combining DCRP48 with the X72 affine pressure-response defect E_p=H_P^0+C_S^0 yields an off-central pancake vorticity-density law whose damping coefficient agrees exactly with DCRP35, and shows that removing both replenishment sources simultaneously forces the response slope to equal exactly c=1/2. STOP-D49 establishes that off-central response cannot be sustained for free — it must be replenished either by inward turnover or by the X72 mixed-affine pressure defect — and when both are absent, the only survivor is the invisible central slope c=1/2, left to DCRP50 to substitute this value and test its compatibility with DCRP35, DCRP31, and X72 vorticity-stress realizability.
[document] DCRP69/X72R52: Cofactor Phase-Lock Normal Form
Continuing from DCRP68's proof of 'mandatory cofactor-shape activity', this round further asks whether that activity can be algebraically cancelled by the pressure and vorticity terms and phase-locked. First, the full similarity Euler strain equation is reduced to the identity D_sS+S+E_p+¼W_Ω=0, in which all quadratic strain self-amplification terms and the isotropic pressure term cancel exactly; on the aligned branch this yields the exact material evolution equation for the cofactor C, together with the exact angular-rate equation for the normalized cofactor direction Ĉ. It classifies the unique exact phase-lock equality mode, which requires the strain frame and the non-axisymmetric shape ratio c=d/λ to be materially frozen, and uniquely determines E_p=-(1+λ'/λ)S-¼W_Ω, together with a strict pointwise defect lower bound — leaving DCRP70 to test whether this forced local pressure tensor can be globally integrated into a pressure Hessian.
[document] DCRP43: Poincaré Scalar Transfer and Material Nonrecurrence
Building on DCRP42's canonical rank-two pancake branch G=0 and its scalar transport equation, and heeding DCRP32→34's warning that the raw self-similar-coordinate blow-up factor can be absorbed by same-parent re-root rescaling, this round avoids prematurely declaring a contradiction. It proves the exact one-period Poincaré flow-map transfer law, an existence theorem for a finite positive-scalar-weighted material turnover carrier, and a pointwise nonrecurrence theorem for nonzero scalar material labels under the Euler periodic gauge, establishing that Euler identity and material identity are distinct. The conclusion states explicitly that this is not a claim of physical contradiction; whether it amounts to a genuine same-parent obstruction is left to the next round's quotient-correct re-root-rescaling audit of q, r, ∇_hq, and |r|^p dy.
[document] DCRP48: Pressure-Driven Response Slope and Mixed-Hessian Telescoping
Building on the response slope c=B_q that DCRP47 derived from the constitutive relation w=B(q,s)-2a(s)z, together with its divergence equation and the [0,1] response window, this round first corrects it. It proves that DCRP47's current J_c is actually ∂_z(∇·V)=0 — merely a differentiated restatement of the constitutive relation under incompressibility, not an independent equation. The genuinely new dynamics comes from the vertical self-similar Euler momentum equation D_sc=-P_{zq}: the mixed pressure Hessian must be parallel to ∇_hq and is the sole driver of response-slope evolution. This yields a pressure-Poisson source identity, and shows that a zero mixed-pressure offset, together with DSS scaling and q=0 continuity, forces the response slope to be constant. STOP-D48 establishes that the response window is governed not by an independent compatibility equation but by the pressure Hessian: leaving [0,1] requires a finite pressure-Neumann flux, while staying inside it requires obeying a bounded telescoping budget, left to DCRP49 to compare this pressure-Neumann gap against DCRP31's PFET gap on the same annulus.
[document] DCRP63 / X72R46: Axial Pressure Oscillation and Floquet Stretch Modulation
Building on the X∨T dichotomy DCRP62 converged to, this round compares the two and chooses to attack X first: the reasoning is that DCRP62 supplied a 'signed axial pressure-response identity' absent from X72's older general defect theory, whereas the T branch, although able to coexist with DCRP31's inward PFET inside the same finite-gauge package, lacks any new signed algebraic relation and its energy/dissipation remains merely critically summable. Under the turnover-free eigen-aligned setup inherited from DCRP61 and DCRP62 (B=ρI, SΩ=λΩ, R_B^tr=0), this round derives Z'/Z=2(λ−λ*) and the proper pressure-defect formula, proving that an aligned pressure defect taken at exactly the neutral rate cannot sustain both 'eigen-alignment' and 'the X72 constant-commutator null channel' for free: the quantified commutation law forces the system to produce either a spatial pressure-defect oscillation or a large temporal Floquet stretch overshoot (λ<0 or λ>2−3γ), and at the exact neutral rate the spatial oscillation is unavoidable. STOP-D63 compresses the X branch into two sub-normal-forms, X_osc and X_mod, and hands to DCRP64/X72-R47 the task of a rigidity analysis focused on the Floquet modulation overshoot.
[document] DCRP56: Rank-Three Covariance Lift and the Cylindrical Tail
Building on the 'rank lift vs. infinite tail' dichotomy DCRP55 left behind, this round asks whether both branches can be quantified into exact normal forms. It proves that finite transparent compensation is not merely 'escaping rank two' but is precisely an isotropic rank-three covariance (λ₁=λ₂=λ₃=c>0), whose minimum eigenvalue and exterior total vorticity are both at least half the internal local vorticity, so finite X72 transparency necessarily entails a rank-three covariance lift. On the other hand, it proves that a globally transparent tail on a fixed plane (of cylindrical-shear type) cannot lie in any positive L^p vorticity-integrable class. STOP-D56 hands to DCRP57 two tasks: testing whether rank-three supplier dynamics can be dynamically regenerated by existing mechanisms, and checking whether the cylindrical tail's energy growth contradicts the DSS sublinear energy law.
[document] DCRP60: Rank-Two Closure Package and X72 Frontier Selection
Building on the rank-two rigidity closure package accumulated across DCRP38–59 (including the DCRP59 signed-residual confluence, which is not itself archived in this folder), together with the pre-NTLA rank-two frontier from RMRM checkpoint v42 and the visibility theory of X72 Round37 and 42–43, this round conducts a formal closing audit of the entire rank-two equality track. It proves that the maximally rigid rank-two branch has no zero-defect global continuation: any continuation must fall into one of three channels — X (X72 visibility/pressure-response defect), N (non-affine vorticity stretching), or T (inward vorticity turnover). The audit further finds that N and T are in fact a recurrence of DCRP35's old stretching/turnover dichotomy under a stronger quantitative lower bound, forming a loop, and that the only genuinely new coordinate not absorbed by this loop is X. STOP-D60 therefore formally closes the rank-two subproject, selecting the coupling of non-affine stretching with X72's nonlocal stress projection as the new frontier and handing it to DCRP61/X72-R44 — the round text states plainly that rank-two local geometry is now exhausted and that the only new observational coordinate able to break the loop comes from X72, from which point the combined DCRP/X72 round numbering formally begins.
[document] DCRP87/X72R70: Recurrent-Work Unobservability Rigidity Theorem
Continuing from DCRP86's narrowing of the late-stage forest problem to 'does already-resolved CKN badness imply signed pressure-flux work' — an implication left explicitly open in the external 2026 Yu source, owing to possibilities such as pressure-flux cancellation, harmonic pressure tails, coherent low-frequency profiles, leakage, and backscatter — this round proves it, but only on the narrower class of shared-ancestry recurrent-compact solutions, not on the full class of suitable weak solutions. It proves Theorem D87.8 (no-recurrent-work unobservable resolved-bad limit): any configuration that is work-silent in the distributional sense, with local kinetic-energy recurrence and vanishing leakage, must have zero resolved dissipation, forcing the velocity to be spatially constant; if the subfilter residue vanishes as well, the only possible limit is a bulk translation plus an affine harmonic pressure, and the native global Morrey law rules out any nonzero translation — so positive CKN badness on this class cannot coexist with a zero-work detector. Compactness further reduces the infinite-test observability gap to a finite family of active tests, giving an explicit forward-work/backscatter dichotomy. However, it explicitly distinguishes (Theorem D87.14): observability is closed, but the global exhaustion problem is not — the exhaustion inequality's weights w_k=r_k/r_0 are geometrically summable, so even a uniform work lower bound does not contradict an infinite geometric chain — left for DCRP88 to test whether shared-ancestry regeneration can convert this geometrically weighted signed-work budget into a non-summable debt.
[document] DCRP104 / X72R87: Riesz Self-Consistency and the Shear-Polarization Survivors
Following DCRP103's five-ray eigen-lock classification, this round imposes the nonlocal self-consistency condition r=T0*Φ on each ray, and proves that the whole-space L² eigen-lock of the frozen-simple-strain coaxial branch is identically zero (the Frozen Coaxial L2 NO-GO, whose exceptional set is a measure-zero quadric cone), so the coaxial node is thereby completely excluded. By contrast, a single shear ray still has nonzero whole-space L² solutions off the resonance cone, and axisymmetric strain is structurally less rigid still: its two-dimensional shear eigenspace can produce an infinite-dimensional r=0 polarization kernel. It further proves that under fixed positive viscosity, every frozen constant-coefficient eigen-lock is identically zero. The conclusion notes that Riesz self-consistency alone cannot close the case: the survivor splits into three branches — a shear zero-order-transfer branch, a near-resonance concentration branch, and an axisymmetric polarization branch — leaving the next round to examine whether these surviving branches can maintain their spectrum in the vanishing-viscosity limit.
[document] DCRP43-QC: Same-Parent Scalar Re-Root and Gauge-Quotient Collapse
Building on the quotient-correct same-parent audit task left by DCRP43, and drawing on the existing identities and constructions of DCRP30, 34, 35, 40, and 42, this round proves that DCRP30's same-parent re-root identity gives the exact transformation law for the planar shear scalar q and its horizontal gradient (i.e., the planar vorticity): the normalized planar-vorticity re-root multiplier is always e^{-S_0}, independent of γ. At the same time, it shows that the absolute scalar q=w-∂_zφ is not invariant under the residual-potential gauge, so DCRP43's reading of the original |r|^p turnover as a 'new same-parent scalar tax' does not hold and is corrected here. The new STOP (STOP-D43-QC) reduces the problem to a gauge-invariant question — whether the gauge-quotient scalar dynamics carries a nonzero transport-projection residue — left to DCRP44.
[document] DCRP85/X72R68: Scale-Gap Debt and the CKN Finite Chain
Continuing from DCRP84's reduction of the entire Kelvin/trace/line-atom pathway to the old scale-escape coordinate R_scale (adjacent-generation ratio r_{j+1}/r_j→0), and using the DCRP02 interaction graph, the two-sided relative-frequency compactification from DCRP18–20, and the 2026 Yu finite-chain CKN bad-scale counting theorem, this round asks whether this escape is truly a zero-cost geometric degree of freedom. It proves that the scale gap admits two exact interpretations: a UV shell escape from the parent-scale viewpoint, and, from the child-scale viewpoint, an IR escape of that same gap. More importantly, under a uniform global critical bound, every intermediate dyadic bad scale within the skipped band carries a fixed positive standard-channel cost, giving a linear gap debt D_gap≥c(M)(m_j+1) (where m_j is the dyadic gap depth). Conclusion: R_scale is no longer a silent geometric escape but converts into a quantifiable linear finite-chain debt; the remaining question has pivoted from 'classifying another escape route' to 'proving that these repeated channel payments admit a bounded-overlap, mandatory forest budget' — left for DCRP86 to attempt to pack this debt into the PFET/X/tail/state budget and control the overlap.
[document] DCRP79/X72R62: Secular Compact-Chain NO-GO and Noncompact Catalogue
Continuing from DCRP78's reduction of the no-X dynamics branch T into two sub-branches — drift T_drift and pre-selection T_preselect — this round asks whether the drift branch can remain forever within a compact normalized shape set. Working within D78's E_p=0 moving-frame system, it constructs two scalar functionals F=a+logρ+λ/2 and G=log|b|+2logρ, and proves the exact tangent laws F'=-ρ²+2b²-1-3λ/2 and G'=-3(1+λ): resonance forces b to decay exponentially on any compact non-aligned shape class, after which F drifts linearly to -∞ — contradicting compactness without invoking any recurrence theorem (Theorem D79.5). Conclusion: the no-X material chain must escape compactness explicitly through one of: alignment-boundary escape, shape blow-up, support/tail escape, filamentation, divergent packet multiplicity, singular injection, or pre-limiting viscous Kelvin residue — a catalogue left for DCRP80 to audit for genuinely new mechanisms.
[document] DCRP95 / X72R78: SGS Phase Slip and the Total-Variation Audit
Following DCRP94's proof of uniform circulation reset, this round refines it by orientation into a sign-coherent SGS reset, and proves that its positive total variation V_{Γ,+}^{SGS}(N) grows at least linearly — meaning the final compact reset source is not an occasional or sign-canceling defect, but a sign-coherent, positive-density coarse-grained circulation-flux conveyor. However, invoking Eyink's circulation-cascade theory, it notes that classical vortices are not quantized, so no integer vortex-crossing inventory exists for each reset to draw down — hence there is no finite-crossing-capacity contradiction (No-Finite-Crossing-Capacity). It finally fixes the surviving paradigm as the sign-coherent SGS Kelvin phase-slip conveyor C_slip, and notes that the next round must instead seek a rigidity theorem at the level of increasing Young-measure profiles, rather than attempting another energy- or encapsulation-tax argument.
[document] DCRP65 / X72R48: Disproof of Pressure-Source Flatness and Null-Channel Closure
Building on DCRP64's closure of X72 Round38's N1 null channel, this round handles the remaining N2 (pressure source δq=0) and N3 (velocity δV=0). Using the proper divergence representation of the pressure source, q=∂i∂j(ViVj), together with DCRP30's strict DSS sublinear energy tail, it proves that a globally constant pressure source must be zero; DCRP62's exact pressure-response formula for the aligned branch then shows this again forces the neutral stretching rate to satisfy λ'+λ+λ²=0, which after period integration contradicts the non-negativity of λ². N3 is dismissed trivially, since a constant velocity kills the vorticity. With this, all three factor-by-factor null channels of X72 Round38 are closed, proving that any surviving silence of the X branch must come from a genuine pairwise support, tensor-angle, or principal-value correlation cancelling among the three individually active increments — the problem is handed to DCRP66 to address this triple-correlation rigidity.
[document] DCRP61 / X72R44: Stress Projection and the Aligned Neutral Floquet Mode
Building on the frontier question DCRP60 selected — whether non-affine vorticity stretching N implies an X72 visibility defect or turnover T — this round applies the projection and realizability tools of X72 Round38, 42, and 43 to test it. It derives the proper evolution equation for the actual vorticity stress W, splitting the stress change into an amplitude-stretching part λ and a directional-tilt part τ, and proves that pure eigen-aligned stretching (τ=0) only rescales the stress cone without rotating or deforming it — thereby locating an equality direction invisible to X72's projection attack: a spatially uniform eigen-aligned stretch that, at the proper neutral Floquet averaging rate (2−3γ)/2, can sustain a periodic isotropic covariant without triggering turnover. The general implication DCRP60 had envisioned, 'N⇒X∨T', is thereby refuted, leaving only modulation, tilt, or the transport–projection commutator as mechanisms that could make stretching visible to X72. STOP-D61 hands to DCRP62/X72-R45 the still-open question of whether this invisible eigen-aligned mode can simultaneously sustain a perfect pressure response.
[document] DCRP77/X72R60: Directional-Stretch First Crossing and the Tilt Cost
Continuing from the sole X-free escape candidate left by DCRP76 — the infinite, non-closed 2γ stretch-selection conveyor (the material carrier must stay above DCRP61's neutral Floquet threshold while the Euler observer must stay below it) — this round derives the exact non-aligned directional-stretch equation governing 'crossing this threshold'. Defining λ_ω=ξᵀSξ and the torsion τ_ξ=Sξ-λ_ωξ, it proves the general identity D_sλ_ω+λ_ω+|Ω|²/6=2|D_sξ|²-ξᵀE_pξ, which reduces exactly to DCRP62's aligned formula when D_sξ=0. From this identity it follows that 'first crossing' must pay a hard cost of at least γκ/2: crossing dynamically must be paid for in vorticity tilt or a negative axial X72 pressure response; if 'pure selection' is used instead, drawing on already-highly-stretched material, then the inflow stretching variance and the selection distortion must satisfy a quantitative covariance gap greater than γκ/2, or else new material must be injected. The conclusion is that only two cases remain for the surviving X-free branch — a 'genuinely tilting selection conveyor' or a 'non-compact, pre-selected high-stretch reservoir' — leaving DCRP78 to test whether the tilting action required by the former can stay silent toward the transverse pressure response.
[document] DCRP83/X72R66: Subfilter Trace Re-Rooting and the Parabolic Atom Trichotomy
Continuing from the single new gap Θ_tr,n→∞ singled out by DCRP82, this round tests whether trace blow-up can genuinely force a finer transverse scale and produce a same-type Navier–Stokes descendant. It proves that a quantified subfilter scale δ/ℓ≲Θ_tr^{-1/4} can indeed be extracted, but that direct re-rooting is NO-GO (Theorem D83.3): it causes the filter ratio ℓ/δ to diverge rather than being preserved, and uniform mass diffusion is also too weak to produce a strong descendant because it is short one power of the parabolic scale (a second NO-GO). This establishes the exact trichotomy R_tr⟹R_ratio∨R_atom∨R_mult (aspect-ratio escape, matched-quota line atom, or divergent carrier multiplicity), producing no fifth new mechanism. The strongest surviving branch is the matched atom R_atom, left for DCRP84 to test whether an infinite nested cascade of matched atoms can survive under the native Morrey energy and diffusion cost.
[document] DCRP78/X72R61: Tilt-Pressure Equation and Resonant-Return Infeasibility
Continuing from the two no-X branches left by DCRP77 — the finite/coherent tilt-selection branch T_tilt-sel and the pre-selection branch T_preselect — and drawing on the neutral Floquet threshold from DCRP61–63, the strain-pressure-defect-vorticity bridge from DCRP69, and the 2γ resonant carrier from DCRP76, this round directly confronts the coherent tilt-selection branch. It derives the exact self-similar tilt-pressure equation D_sχ=-(1+2λ)χ-ξ×H_Pξ, and proves that even under the assumption that the X72 response defect vanishes entirely (E_p=0), the resulting moving-frame ODE for the local shape variables (λ,|τ|,a,b) still admits no periodic resonant-return solution — the return equations contradict each other. This establishes that any shape-returning resonant carrier must belong to the X72 state; the only remaining no-X mechanism converges to a noncompact secular material chain (permanent drift or upstream pre-selection), left for DCRP79 to test whether it can remain compact.
[document] DCRP105 / X72R88: Vanishing-Viscosity Residual Matching and the Spectral-Migration Audit
Following the shear/axisymmetric nonlocal survivor branches left by DCRP104, and that round's result that the eigen-lock is identically zero under fixed positive viscosity, this round audits whether this positive-viscosity NO-GO becomes a uniform obstruction as ε→0, and concludes that it does not (No-Forced-Spectral-Migration): the viscous residual of the same fixed, normalized inviscid profile is merely R_ε=ε|ξ|²Φ, of order O(ε), which can survive approximately with no frequency migration required; the true critical quantity is Θ_ε=η_ε/ε — a fixed frequency-band mass requires η_ε≳ε, and only η_ε=o(ε) forces the entire Fourier mass to migrate toward a low-frequency, large-scale escape. It also checks DCRP102's transport–Riesz angular cone and DCRP95's Kelvin nematic lock, proving that neither can locally exclude the off-resonance shear survivor, and so fixes the surviving state as the viscosity-matched shear/polarization conveyor. The round closes, in the same 'Next autonomous step' format used by the preceding 13 rounds, with eight concrete tasks proposing the next round, DCRP106/X72-R89 (first-order Fredholm / radial spectral narrowing); nowhere in the text is there any statement that the series is being deliberately halted, shelved, or has a planned endpoint — on its own terms this is still a mid-course checkpoint that proposes further steps, and its status as the 'current' frontier comes from the fact that this batch of files stops at 105 and does not include DCRP106, not from any self-declared conclusion in the text.
[document] DCRP74/X72R57: Vector Annulus Tax and Counterflow Conveyor Normal Form
Continuing from DCRP73's restoration of the global frontier to 'active X vs. material turnover', this round points out that the T turnover branch simultaneously carries two obligations that are mutually independent (per DCRP49): DCRP31's inward PFET and DCRP35/59/73's inward enstrophy turnover. The correct conserved object is therefore a vector current rather than a scalar, with both components possessing a strict positive lower bound on the compact normal-form class. The key new identity takes the material-packet ratio Q_D=K_D/Z_D and derives Q_D'=2γQ_D-Π_P/Z_D: if a closed, zero-stretch material packet recurs periodically, it must output strictly positive pressure work under enstrophy-weighted averaging, while DCRP31 simultaneously requires the fixed Euler core to receive inward PFET — the two form an oppositely directed 'counterflow conveyor' without violating D49 (the observers differ). The two currents' physical scalings ℓ^{3-2α} and ℓ^{1-2α} are of the same order once converted and can be summed, so scaling alone cannot manufacture a contradiction. The conclusion is that the surviving T equality state is a 'scale-matched, pressure-mediated counterflow conveyor' normal form, and whether it is truly silent toward X72 pressure curvature is left to DCRP75.
[document] DCRP51: Wave–Pseudo-Eikonal Rigidity and the Null-Hessian Survivor Cone
Building on the central perfect-response system DCRP50 reduced to — q_zz=Δ_hq, |∇_hq|^2-3/2(q_z-4a)^2=12(a'+a-2a^2) — and using DCRP41/DCRP44's unique periodic gauge-flat eigenmode and the full-wave-cone/vorticity-realizability frontier of X72 Round43, this round asks whether the wave–pseudo-eikonal system forces q to be affine. The answer does not hold unconditionally, but carries strong signed rigidity: using a Lorentzian Bochner identity and an exact Hessian factorization, it proves that on any connected block where the right-hand side C(s)=12M_a(s) satisfied by the shifted scalar u=q-4a(s)z is non-positive, u must be spatially affine. Combining this with the infeasibility results of DCRP41/DCRP50 shows that M_a(s) cannot be negative for a persistent survivor, yielding a sharp periodic amplitude window 0≤a(s)≤1/2, with every genuinely non-affine point necessarily lying on the rank-one null-Hessian characteristic cone D^2u=κℓ⊗ℓ (ℓ a null vector). STOP-D51 explicitly does not claim general wave–pseudo-eikonal affine rigidity — it only establishes that the active periodic branch is confined to this logistic amplitude band and that non-affine points are constrained to the null-Hessian cone — left to DCRP52 to impose Hessian integrability/Codazzi conditions on D^2u=κℓ⊗ℓ, test whether ℓ must be constant, and connect to the X72 vorticity-stress algebraic cone.
[document] DCRP99 / X72R82: X72–Kelvin Bounded-Lag Synchronization
Following DCRP98's reconvergence of the dual-lock conveyor into X∨N∨T, and using DCRP62's N⟹X∨T to simplify it to C_dual⟹X∨T, this round uses compactness to upgrade DCRP76–79's qualitative conclusion that no infinite compact X-free material chain exists into a quantitative, uniform finite X-hitting horizon L_X and detector gap c_X>0. It further points out that both X recurrence and DCRP95's Kelvin phase slip are syndetic clocks, but positive density alone does not imply they co-occur at zero lag — a correction to the zero-lag assumption implicit in the DCRP96–98 analysis. Using a finite-lag/detector/orientation pigeonhole argument, it proves that a fixed Kelvin-slip coordinate and a fixed X72 detector co-recur at a fixed lag ℓ* on a positive-density set; the surviving paradigm is finally compressed into the bounded-lag X72–Kelvin lock conveyor, leaving the next round to determine whether this lag corresponds to a genuine causal transfer kernel.
[branch-hub] NS-MORP
AMRAL's NS-MORP (Navier–Stokes Minimal Obstruction Rigidity Program) sub-line: Cycle VII, all 5 rounds live. Starting from 'can a minimal nonzero obstruction be extracted,' it builds a defect-completed compactness topology, finds the correct return-transition dynamics, audits the equality manifold, and in MORP-05 proves the final survivor is a minimal, zero-tax, kernel-saturated diffuse carrier, formally handing off to NS-DCRP. Global regularity remains fully OPEN.
[document] MORP-01: Non-Tautological Extraction, Minimal Invisible Profiles, Kernel Saturation, and Transition Rigidity
MORP series round 1, opening Cycle VII. Continues FCBP Cycle VI's four theorem obligations. Defines native normalized obstruction slices, proves an abstract compactness–rigidity dichotomy theorem: either the cost has a positive coercivity gap, or a nonzero native isolated minimal invisible profile exists saturating every already-incorporated observation/mechanism/tax-channel kernel. Also proves a transition rigidity theorem and several NO-GOs.
[document] MORP-02: Native Defect Extraction, Defect-Completed Compactness, Profile Splitting, Harmonic-Pressure Quotients, and Minimal-Profile Existence
MORP series round 2, Cycle VII. Builds an explicit defect-completed compactness topology, proving strong local L³ compactness of velocity and strong L^(3/2) compactness of active Calderón–Zygmund pressure under standard uniform locally-suitable-weak-solution bounds; extracts a nonnegative dissipation-defect measure from weak H¹ convergence, giving a conditional minimal-profile existence theorem.
[document] MORP-03: Normalized Return Transitions, Profile Carrier Saturation, Ancient/Defect Normal Forms, and Rigidity Entry
MORP series round 3, Cycle VII. MORP-01 proved minimality implies zero strict transition tax; MORP-02 built a defect-completed packet topology. This round asks what the correct Navier–Stokes transition is on a minimal obstruction packet, replacing an over-strong fixed-time-step invariance with the correct native-separated-window return transition, and proves a minimal-profile splitting saturation theorem.
[document] MORP-04: Ancient-State Liouville Cuts, Local-Energy-Slack Rigidity, Zero-Tax Splitting, and Equality-Manifold Exclusion Audit
MORP series round 4, Cycle VII. Audits which equality-manifold objects are already incompatible with suitable weak Navier–Stokes structure or known Liouville theorems. Main new result: once MORP-02's strong state compactness is used correctly, the simplest 'pure dissipation defect' branch is excluded by the local energy inequality — zero local energy slack forces zero dissipation defect.
[document] MORP-05: Escape Reprofiling, Ancient Spatial-Tail Rigidity, Diffuse Minimal Carriers, and Cycle-VII Final Audit
MORP series round 5, Cycle VII final audit. Proves an atomic-escape reprofiling theorem and an ancient compact-tail Liouville reduction. Cycle VII's final survivor is a minimal, zero-tax, kernel-saturated diffuse carrier arising through spatial/scale/trace escape or a non-L³-compact ancient state — not a proof of global regularity, but explicitly handing off to NS-DCRP: Navier–Stokes Diffuse Carrier Rigidity Program.
[branch-hub] NTLA-O: Generalized Nested Topological Observer Theory
NTLA-O (Generalized Nested Topological Observer Theory) is the researcher's original nine-paper series: promotes 'are two structures different?' to 'relative to which observer, which reference domain, which judgment domain, are two structures the same or different?' Connects in sequence to set theory, point-set topology, sheaves/descent, groupoids/transport, inverse/pro systems, and canonical separation. All nine formal-series papers are live.
[document] Paper 1: NTLA 2.0: Nested Topological Learning Architecture
NTLA-O series Paper 1. Systematic revision of the earlier Nested Topological Learning Architecture: topological matching demoted to a structural-representation method, bottleneck distance demoted to one candidate loss component, adds a difference-sensitive connectivity structure — identical Betti numbers no longer automatically mean identical identity.
[document] Paper 2: NTLA-O I: Main, Internal, and External Observers
NTLA-O series Paper 2. Splits the observer, relative to a nested carrier domain, into main/internal/external roles, proves a single-crossing theorem for the role chain (external→main→internal, irreversible); key counterexample: infinite nesting does not equal infinite new observational difference.
[document] Paper 3: NTLA-O II: Set-Theoretic Observer Hierarchy
NTLA-O series Paper 3. Builds the set-theoretic foundation for observer theory: power-set representation of admissible distinction families, ordinal rank, set-boundedness, generalized to class-level observer towers.
[document] Paper 4: NTLA-O III: Observer Topology, Indistinguishability Kernels, and Quotient Spaces
NTLA-O series Paper 4. Proves any observational distinction family generates a unique weakest topology, and this topology's closure adds no new point-level distinguishability — finite intersections and arbitrary unions merely reorganize predicates that already existed.
[document] Paper 5: NTLA-O IV: Local–Global Observation, Presheaves, Sheaves, Stalks, and Descent
NTLA-O series Paper 5. Represents the internal observer as a local section on the observer topology, uses presheaf/sheaf language to study when local observational data can compatibly glue into a global state, and the reconstruction obstruction when gluing fails.
[document] Paper 6: NTLA-O V: Path Identity, Fundamental Groupoids, Coverings, Monodromy, and Holonomy
NTLA-O series Paper 6. Studies how observational states are transported, whether the same endpoints via different paths count as the same observation; distinguishes five levels of path identity (from Raw Path to Homological Information), connecting to fundamental groupoids, coverings, monodromy, and holonomy.
[document] Paper 7: NTLA-O VI: Inverse Systems, Observer Tower, Inverse Limit, and Pro-Observer Identity
NTLA-O series Paper 7. Builds Observer Tower Theory: a sequence of progressively refined kernels forms a standard inverse system, proves a natural injection from the quotient of the kernels' intersection to the inverse limit. Core thesis: limit identity does not imply tower identity.
[document] Paper 8: NTLA-O VII: Complete Separation, Canonical Invariants, Locally Finite Reconstruction, and the Continuous Separation Problem
NTLA-O series Paper 8. Poses the Complete Separation Problem: a complete separator genuinely exists for finite relational structures (canonical form equal iff isomorphic), but existence does not imply an efficient algorithm; the continuous version (Continuous Separation Problem) is explicitly left as an open problem.
[document] Paper 9 / 9: NTLA-O: Unification — Unified Axioms, Identity Hierarchies, Mathematical Interfaces, Completeness, and Research Boundaries
NTLA-O nine-paper series unifying closing paper. Consolidates into four axes — Role/Locality/Resolution/Transport — plus an Identity Specification control layer, mapped to mature mathematical interfaces from set theory to sheaf/descent to groupoid transport to inverse/pro systems to canonical separation. Explicitly does not claim to reinvent these existing tools, classifies every proposition into four credibility tiers, keeps the Continuous Separation Problem open. Includes a complete nine-paper dependency-chain table.
[branch-hub] Navier–Stokes Existence and Regularity
An AMRAL case: the global-regularity problem for the 3D incompressible Navier–Stokes equations, one of the Clay Millennium Prize's seven problems. The document opens by explicitly stating that it does not claim to have proven global regularity, and does not claim to have constructed a finite-time blow-up. Its core tool compresses the problem into two falsifiable claims: C1 (Chain Necessity — a blow-up must generate a source-traceable, scale-by-scale-legal X-legal UV chain) and C2 (Finite Obstruction — any such chain must be genuinely blocked by N–S structure at a finite scale) — if both are proved, then ¬Blowup. Currently: C1a/C1b (UV-escape necessity; causal provenance of the nonlinear replenishment) are CLOSED; C2 proves that scalar additive budgets are not sufficient to exclude blow-up (an abstract cascade-ledger counterexample); C3 through C6 (framework + C1/C2 + 25 + 9 + 13 + 17 = 67 rounds) are all now built and live. Global regularity remains fully OPEN throughout.
[document] 00: ETN–X Integration Refactor
The framework-founding document for the entire series: Section 0 opens with a
[document] 01: C1: High-Frequency Escape and the Nonlinear UV Replenishment Chain
Splits the previous integration framework's proposition $\mathrm{Blowup}(T_\ast)\Rightarrow\mathrm{XLegalUVChain}$ into three layers: C1a (high-frequency tail escape), C1b (nonlinear UV replenishment chain), C1c (persistent triadic genealogy). C1a's Theorem 4.1 proves directly: if $T_\ast$ is the maximal blow-up time, then for every fixed dyadic cutoff $J$, $\limsup_{t\uparrow T_\ast}\|P_{>J}u(t)\|_3=\infty$ — using only the Littlewood–Paley cutoff, the Bernstein inequality, and the known critical $L^3$ blow-up criterion. C1b (Theorem 11.1) is the paper's hardest result: it first proves that at a fixed time the high-frequency tail tends to zero as $J\to\infty$ (Littlewood–Paley approximation), then combines this with C1a, recursively selecting a scale–time sequence $t_n\uparrow T_\ast$, $J_n\uparrow\infty$ such that $\|P_{>J_n}u(t_{n-1})\|_3\le\varepsilon_n$ but $\|P_{>J_n}u(t_n)\|_3\ge A_n$; it uses the Duhamel identity to attribute this gap to the nonlinear term $\mathcal N_n$, then uses the contraction property of the heat semigroup on $L^3$ (linear evolution can only shrink, never amplify, the high-frequency tail) to prove $\|\mathcal N_n\|_3\ge A_n-\varepsilon_n$ — the document stresses that this
[document] 02: C2: Critical Toll, Dissipation-Wavenumber Spike-Packing, and the Scale-Blind Budget No-Go
Tests the Route B intuition raised at the end of the previous round:
[document] 03 / C3-A: The Conservation–Criticality–Positivity Trilemma and Divergence of Bihelical Pair Production
Having shown in C2 that a scalar, additive energy budget alone cannot rule out a critical geometric cascade, this round formally brings in finer structure from the true N–S nonlinearity. Starting from three natural quadratic quantities — kinetic energy $\|u\|_2^2$ (positive, subcritical, nonlinearly conserved), helicity $H$ (scale-critical, nonlinearly conserved, but of indefinite sign), and the critical quantity $\|u\|_{\dot H^{1/2}}^2$ (positive, scale-critical, but with no exact nonlinear conservation law) — it tabulates these and finds that the three properties (positive / critical / nonlinearly conserved) cannot all be obtained simultaneously from any one of these three most natural quantities, constituting the Conservation–Criticality–Positivity Trilemma. Using the helical projection $u=u^++u^-$, it defines the critical size of each sign sector $H_\pm=\|D^{1/2}u^\pm\|_2^2$, and derives from nonlinear helicity conservation that the two sectors' production rates must be equal, $\mathcal R_+=\mathcal R_-$; the common value $\mathcal R$ is called the critical helical pair-production rate. Main theorem (12.1): if $T_\ast$ is a finite blow-up time, then $\int_0^{T_\ast}[\mathcal R]_+\,dt=\infty$ — the proof needs only $\dot H^{1/2}\hookrightarrow L^3$ to convert C1's $L^3$ escape into divergence of a critical quadratic quantity, then uses the pair-production identity to rule out a finite budget. The document stresses that this is the first genuinely unavoidable condition to use the full structure of $B(u,u)$ rather than the energy identity alone — finer than C2's critical toll, since $\mathcal R$ is not an energy flux but a specific projection in helical coordinates. It cites Biferale–Titi's global-regularity result for sign-definite, helically decimated N–S as an external point of comparison: once the opposite-chirality degrees of freedom are removed, helicity becomes sign-definite and equal to the critical size, the trilemma is genuinely lifted, and global regularity can be proved — showing that the mixed-helicity degrees of freedom are not a decoration that can be dropped at will, but the genuine source of the difficulty. The document also proposes a candidate minority-factor estimate (bounding $\mathcal R$ by the smaller of the two sectors), but explicitly flags it as a CANDIDATE LEMMA, not to be used as a theorem.
[document] 04 / C3-B: Bihelical Critical-Energy Equalization, Heterochiral Triad Decomposition, and Unique-Sign UV Escape
Opens with an epistemic correction: for the $\mathcal E_+-\mathcal E_-=c_0$-type identity obtained in the previous round, C3-A, a literature check found that Lei–Lin–Zhou had already established the equivalent critical-helicity energy identity — it is not a new theorem of this paper. What this paper adds is connecting it to blow-up escape, Waleffe helical-triad algebra, the unique-chirality sign mode as the true source, and the multiscale legality chain of the X-Integration. Core result: from that external identity together with divergence of the critical size under blow-up, it derives that the two chirality sectors' accumulated critical energies $\mathcal E_\pm(t_n)$ must simultaneously tend to infinity along some sequence (Theorem 5.1), with ratio $\mathcal E_+/\mathcal E_-\to1$ (Corollary 6.1) — no matter how large the initial helicity bias $c_0$ is, as long as the critical energy genuinely escapes to infinity, the fixed initial difference eventually becomes negligible. Using Waleffe helical-triad algebra, it formally splits the heterochiral triads into Class II $(+--)$, III $(+-+)$, and IV $(++-)$, and proves that homochiral triads (Class I) make exactly zero contribution to positive critical absolute helicity (homochiral triads do not produce positive critical absolute helicity). Every heterochiral triad has a unique chirality-sign mode, and pair production can be rewritten entirely as
[document] 05 / C3-C: The Class-II Nonlocality Quadratic Tax, Radial-Drift Congestion, and the Class III/IV Forward-Surviving Family
C3-B compressed the hypothetical singular production core down to the High–High Heterochiral UV Pair-Production Chain. This round first tackles Class II $(+--)$, asking: if $k\ll p\sim q$, can Class II really serve as a high-efficiency UV generation mechanism? The answer is
[document] 06 / C3-D: The Cutoff-Flux Sign Theorem, the Helical-Kernel Nonlocality Exponent, and the Class-II Logarithmic Reversal
C3-C compressed nonlocal Class II down to
[document] 07 / C3-E: Viscous-Window Renewal, Phase Efficiency, and Zeno Compatibility for the Local Heterochiral Frontier
C3-D compressed the surviving core toward the local/moderately local heterochiral forward frontier (unless the nonlocal route pays an amplitude compensation or the scaling assumption breaks down). This round asks: once $k\sim p\sim q\sim\lambda$ and the nonlocal suppression vanishes, can these local triads keep sustaining consistent amplitude, phase, time window, and genealogy at ever-higher frequencies? It first establishes heat-semigroup spectral-gap decay for the high-frequency tail, then combines this with the Duhamel formula to prove the Viscous-Window Renewal Theorem (Theorem 4.1): if the high-frequency tail rises from $\varepsilon$ to $A$ over $M$ viscous windows, then at least one window's nonlinear source must itself reach the same order of magnitude — stronger than C1b's statement that
[document] 08 / C3-F: Phase-Space Quasi-Locality, the Ancestry Cone, and the Finite-Branching Reversal
C3-E compressed the local heterochiral survivor down to three simultaneously necessary conditions: rapid viscous renewal, phase/amplitude efficiency, and a provenance-preserving genealogy. This round, for the first time, brings physical space directly into the proof route. The core is the Off-Diagonal Critical Interaction Lemma (Theorem 3.1): the kernel of the annular Leray nonlinearity, at frequency scale $\lambda_q$, has Schwartz-class off-diagonal decay $(1+\lambda_qd)^{-N}$ — the farther apart the parents' spatial supports, the faster the direct interaction contribution decays; no turbulence-scaling assumption is used, this is pure Fourier geometry. Cutting space into admissible dyadic packets of side length $O(\lambda_q^{-1})$, it proves each output packet has only finitely many core parent tuples (Proposition 7.1), with the tail contribution controlled by Theorem 8.1's packet tail bound. Locality–Coherence Tradeoff (Theorem 10.1): if the phase efficiency $\eta_q$ is not too small, one can fix a radius $R_\ast$ independent of $q$ such that at least half of the actual positive production is attributable to the spatial parent core within this radius; as $\eta_q\to0$ the required radius grows, but as long as it does not collapse at superpolynomial speed, the radius remains far smaller than the macroscopic scale. Combining this with the viscous-window renewal from C3-E, it proves Ancestry Center Convergence and the Parabolic Ancestry Cone Theorem (Theorem 19.1): the coherent genealogy's spatial center converges to a single point $x_\ast$ and its time converges to $T_\ast$, with errors compressed to $O(\lambda_n^{-1})$ and $O((\nu\lambda_n^2)^{-1})$ respectively — geometrically compatible with Barker–Prange's Type-I concentration result, though the document explicitly states the two are independent theorems and must not be substituted for one another. The paper's most important course correction is in §22: the intuition that
[document] 09 / C3-G: The First-Crossing Causal Frontier, Critical Shell Ancestry, and the Monotone Depletion No-Go
The largest gap left by C3-F is that an instantaneous interaction is not the same as a strictly earlier causal parent. This round instead uses the dimensionless critical shell amplitude $a_q^\sigma=\|u_q^\sigma\|_\infty/(\nu\lambda_q)$ (scale-invariant, and directly connected to the dissipation-wavenumber framework), defining the first crossing time $\tau_{q,\sigma}$ for each shell-sign node. The core result is the Critical First-Crossing Parent Lemma (Theorem 9.1): under an
[document] 10 / C3-H: Ancestry Renormalization, the Unit-Shell Anchor, and the Critical Compactness Barrier
C3-G established a conditional causal genealogy under explicit assumptions. This round applies a viscosity-normalized critical rescaling to that genealogy, $v_n(y,s)=\nu^{-1}\lambda_n^{-1}u(x_n+y/\lambda_n,t_n+s/(\nu\lambda_n^2))$, and asks whether this directly yields a nontrivial ancient critical element to which existing backward-uniqueness/rigidity theorems can be applied. The verdict is explicit: not directly. Because of the first-crossing definition, the rescaled field retains a Persistent First-Crossing Trace (Theorem 5.1): for $s<0$ the unit-shell amplitude is strictly below the threshold, and at $s=0$ it exactly equals the threshold — a pure consequence of the scaling. Using a uniform Bernstein derivative bound plus an Arzelà–Ascoli diagonal extraction, it proves Unit-Shell Snapshot Compactness (Theorem 9.1): a nonzero, smooth, band-limited limit profile $w_\ast$ exists, satisfying the helical eigen-relation and carrying genuinely nonzero local critical mass. The backward lifespan extends to $(-\infty,0]$ because $\nu\lambda_n^2t_n\to\infty$. However, the document cites the external Seregin theorem (potential blow-up requires $\|u(t)\|_3\to\infty$, not merely $\limsup$) together with critical scale invariance to prove Renormalized global critical-norm divergence (Theorem 13.1): $\|v_n(0)\|_3\to\infty$, with the $\dot H^{1/2}$ norm likewise diverging — this is precisely the Critical Compactness Barrier (Theorem 15.1): the unit-shell anchor is compact, but the full rescaled field is unbounded in both $L^3$ and $\dot H^{1/2}$, so the Kenig–Koch or Gallagher–Koch–Planchon compactness/profile-decomposition theorems — which require a bounded critical sequence — cannot be applied directly. The document explicitly notes that amplitude normalization (dividing by the $L^3$ norm) is also not a legal N–S renormalization, since doing so would rewrite the equation itself. The remaining divergent part must be explicitly preserved as a critical background defect, not silently discarded (echoing the non-collapsing spirit of the X-Integration). A second no-go appears in the rescaling of the causal edge: the normalized time gap $\delta_n=\nu\lambda_n^2(t_n^c-t_n^p)$ is only known to satisfy $0<\delta_n\le\theta$, with no uniform positive lower bound, so $\delta_n\to0$ remains entirely possible — legality at every scale does not imply legality in the limit, and strict causality is not a property preserved under renormalization. The document closes with a Renormalization Trichotomy: Branch A (fully compact, but already proved impossible as a bounded global $L^3$ object), Branch B (background defect, requiring classification of where the divergence goes), and Branch C (causal collapse, requiring activation depth rather than physical time as the ordering parameter).
[document] 11 / C3-I: The Frontier UV Cap, the Critical-Defect Trichotomy, and One-Step Ancestry Decoupling
C3-H arrived at the obstruction that
[document] 12 / C3-J: The Moving-Gauge Re-entry Audit, Absolute-Shell Hysteresis, and the Flux-Variation No-Go
The question left by C3-I is: if a distant defect re-enters the moving genealogical core later on, must it pay a cost? This round first corrects the very notion of
[document] 13 / C3-K: The Absolute Occupancy Worldvolume, Subthreshold Flux Variation, and the One-Moment Critical Gap
C3-J proved that counting re-entries is gauge-dependent. This round switches entirely to the absolute shell identity $q$ and a fixed threshold $\beta$, independent of any moving frontier, defining $A_{q,\sigma}(\beta)=\{t:a_q^\sigma(t)\ge\beta\}$ — a definition that is completely gauge-invariant. The Absolute Active-Worldvolume Budget (Theorem 4.1): using an annular Bernstein lower bound together with the global energy inequality, it proves $\sum_{q,\sigma}\lambda_q|A_{q,\sigma}(\beta)|\le CE_0/(\nu^3\beta^2)$ — a genuinely gauge-invariant, finite weighted occupancy measure. But hypothetical blow-up still requires the support to escape to infinite frequency, so the C3-K congestion signature is
[document] 14 / C3-L: Critical Vorticity-Moment Escape, the Active-Occupancy Dichotomy, and the Strain-Geometry Debt
C3-K compressed the gap down to the One-Frequency-Moment Gap; this round's original question is: does hypothetical blow-up really have to push the next frequency moment to infinity? The answer is unambiguously YES — proved directly via the contrapositive of Cheskidov–Dai's frequency-localized regularity criterion (Critical Vorticity-Moment Divergence, Theorem 4.1): $\nu\int\sum_{q\le Q(t)}\lambda_q^2a_q\,dt=\infty$, which can be read as the divergence of the integral of the shells' absolute vorticity — not a conjecture but the direct consequence of an already-proved theorem. Splitting this condition by threshold $\beta$ into a subthreshold part and an active part, with the subthreshold part controlled by the dissipation wavenumber ($\Lambda\in L^2$), it obtains the Critical-Moment Carrier Dichotomy (Theorem 9.1): either $\Lambda\notin L^2$ (Branch A, borne directly by frontier spikes), or $\Lambda\in L^2$ but the active moment $M_{5/2}(\beta)$ must diverge for every fixed threshold (Branch B) — combined with C3-K's already-proved $M_1(\beta)<\infty$, this yields a very clear signal: a finite first-order occupancy moment together with a divergent order-5/2 moment. The most natural candidate for raising the moment is enstrophy, whose exact identity follows directly from the vorticity equation, but integrating it immediately shows that vortex stretching $\int\omega\cdot S\omega$ must also be controlled — the Moment-Raising Geometry Debt No-Go (Proposition 20.1): raising one differential/frequency moment creates a vortex-stretching geometry debt, which is a direct logical consequence of the exact identity, not a heuristic; a scaling audit confirms the enstrophy identity itself carries no hidden scaling advantage. It then brings in the external middle-strain-eigenvalue regularity criterion (Evan Miller's theorem, together with the 2025 Guo–O endpoint Besov result): hypothetical blow-up must force $\lambda_2^+\notin L_t^2L_x^3$, and even more strongly $\lambda_2^+\notin L_t^2\dot B^{-1}_{\infty,\infty}$ — a parallel pair of necessary conditions (Spectral–Geometric Double Escape, Theorem 26.1). The document explicitly states that it has not yet been proved that spectral-moment escape implies strain-geometry escape, or the reverse implication, and this must not be smuggled in as a causal equivalence. The research frontier shifts to C3-M: can these two channels, both known to have to diverge simultaneously, be forced by genuine N–S geometry into a jointly impossible state?
[document] 15 / C3-M: Vorticity–Strain Coupling, Betchov Global Collapse, and the Directional-Geometry Debt
C3-L left two parallel channels that must diverge: spectral-moment escape and middle-strain escape. This round asks: can the two be forced to couple through genuine vortex-stretching geometry? The answer is not the simple claim that
[document] 16 / C3-N: Localized Betchov Boundary Current and the Local Balance of Strain Self-Amplification
C3-M established only that the local Betchov surplus must be compensated outside the core. This round formally closes that gap: it first uses the purely kinematic identity $\operatorname{tr}(A^3)=3\det S+\frac34\omega\cdot S\omega$ to define $b_B=\omega\cdot S\omega+4\det S=\frac43\operatorname{tr}(A^3)$, then invokes the Carbone–Wilczek result $\operatorname{tr}(A^3)=\nabla\cdot F_B$ (where $F_B=(A^2-\frac12\operatorname{tr}(A^2)I)u$) — a purely kinematic identity with no time evolution involved. The Localized Betchov Boundary Theorem (Theorem 4.1): $\int\chi b_B=-\frac43\int\nabla\chi\cdot F_B$, which for a ball can be written as a boundary surface integral — the local Betchov mismatch is exactly a precise spatial divergence flux, which must cross the localization boundary rather than being an arbitrary far-field bookkeeping entry. The document also supplies a second, companion identity (Theorem 10.1, corresponding to $|S|^2-\frac12|\omega|^2=\nabla\cdot(Au)$). The core result is the Exact Local Strain Self-Amplification Balance (Theorem 17.1): taking the inner product of the strain equation with $\chi S$ gives, exactly, $\frac d{dt}E_S^\chi+\nu\int\chi|\nabla S|^2=-2\int\chi\det S+\mathcal C_\chi$ — the only cubic generation term retained inside the bulk is $-2\int\chi\det S$ (bulk self-amplification); vorticity mismatch, advection, the pressure Hessian, the viscous localization correction, and the moving-core gauge term all fall into the boundary/gauge correction package $\mathcal C_\chi$. The paper's most important NO-GO appears in the scaling audit (§25-28): it proves that $\int\chi_{R_\lambda}b_{B,\lambda}\,dx=\lambda^3\int\chi_Rb_B\,dx$ carries exactly the same instantaneous scaling $\lambda^3$ as the bulk self-amplification term — so $R\to0$ by itself does not make the boundary contribution negligible. §28 is stronger still: global kinetic energy controls only $\nu\int\|\nabla u\|_2^2dt$, with no uniform control on the boundary term's integral over the shrinking radius, so an exact boundary representation does not amount to a finite boundary budget — one of this round's most important no-gos. The document also carefully notes that $F_B$ is the kinematic spatial flux that makes the identity hold; it is not an energy flux, not a signed conserved quantity, and not an irreversible expenditure, so it cannot be treated directly as
[document] 17 / C3-O: Adjoint Core Balance, the Cancellation Corridor, and Balance–Dynamics Separation
C3-N left open whether the gauge/advection/diffusion terms generated by the cutoff function itself can be stripped away entirely. This round uses a backward-parabolic adjoint cutoff (setting $\partial_t\chi+u\cdot\nabla\chi+\nu\Delta\chi=0$ and solving backward from a terminal condition) to absorb exactly these three terms, arriving at the Adjoint Core Balance Theorem (Theorem 4.1): $E_\chi'+D_\chi=A_\chi+B_\chi$, where $A_\chi=-2\int\chi\det S$ is the bulk self-amplification and $B_\chi=\int\nabla\chi\cdot(\frac13F_B+F_p)$ is a clean boundary correction flux. Defining the ratio $\rho_I=B_I/A_I$, the Hard Depletion Barrier (Theorem 10.1) states: if $\rho_I\le-1$, the window in question cannot be a window of positive local strain growth — this is a genuine hard exclusion zone. $\rho_I\to-1^+$ survives, but must pay a
[document] 18 / C3-P: Operator Escape, the Far-Pressure Harmonic Matrix, and the Finite-Dimensionalization No-Go
C3-O already proved that an energy balance which looks like the simplified model does not mean the dynamics are actually close to that model. This round formally escalates to the operator level. The core is the Exact Two-Model Gap (Theorem 5.1): reorganizing the full strain equation relative to both the
[document] 19 / C3-Q: Pressure–Projection Orthogonality, Operator-Escape Localization, and the Harmonic-Matrix Compensation Debt
C3-P produced two independent channels: operator escape and far-field pressure. This round asks: can the two channels be forced into mutual rigidity? The core is the Pressure–Projection Complement Theorem (Theorem 3.1): the orthogonal projection $P_{st}$ onto the strain-constraint subspace $L^2_{st}$ splits the full nonlinear term exactly into two complementary channels, the
[document] 20 / C3-R: Multi-Core Packing, Pressure-Horizon Congestion, and the Five-Dimensional Strain-Convexity Debt
C3-Q compressed the survivor into three mutually non-interchangeable interfaces — operator escape, ancestry-core geometry, and the far-field pressure matrix — and proved that operator escape and far-field pressure have no simple contradiction. This round instead asks: if the singular debt is not concentrated in a single core but spread across multiple same-scale spatial cores, how do finite energy, rescaled enstrophy, and the pressure horizon jointly constrain the multi-core geometry? The core is the Frontier Multi-Core Energy Packing Theorem (Theorem 6.1): using pointwise amplitude persistence (an annular Bernstein argument), it proves every near-saturated core carries at least $O(R)$ energy; summing over disjoint ball packings then yields the core-count bound $m_R\lesssim R^{-1}$ — a counterintuitive inverse-scaling packing law: not $O(R^{-3})$, because each critical high-frequency packet needs only $O(R)$ of ordinary kinetic energy, so critical objects can proliferate much faster than energy-density intuition suggests. Multi-Core Enstrophy Amplification (Theorem 9.1): the number of cores directly forces the rescaled enstrophy $\mathfrak E_R\gtrsim m_R\beta_\ast^2$. The document introduces the notion of a Certified Pressure Horizon (§13), explicitly distinguishing
[document] 21 / C3-S: Strain-Cone Margin, Cross-Scale Separator Compactness, and Merger Rigidity
C3-R answered only a binary question: whether a common far-field matrix exists at all. This round upgrades it to a quantitative one. The core definition is the margin $\gamma(V):=\operatorname{dist}(0,\operatorname{conv}V)$ — the distance from the origin to the convex hull of the local mean-strain set $V$; $\gamma(V)>0$ is exactly equivalent to C3-R's positive-support criterion holding, but now how far it holds by is also quantified. The core is the Uniform Margin Compactness Theorem (Theorem 6.1): if the margin has a uniform lower bound $\gamma(V_R)\ge\gamma_0>0$ across all scales, then, by compactness of the unit sphere in $\operatorname{Sym}_0(3)$, there exists a single fixed cross-scale separating matrix $K^\ast$ that simultaneously witnesses positive support for the core set at every scale — there is no need to hunt for a new separating matrix scale by scale; a uniform margin directly yields one universal witness. Merger Inheritance (Theorem 14.1) then proves: when two core clusters merge, as long as each retains its own lower bound $\gamma_0$, the margin of the merged set does not collapse arbitrarily — it shrinks only within an explicit factor controlled by the angular geometry — merging does not destroy uniformity, though it does exact a computable cost. The degenerate branch treats the case $\gamma\to0$: the document proves this corresponds exactly to C3-R's Carathéodory obstruction becoming tight — the Six-Core Near-Balance Witness (Proposition 21.1) shows that as the margin tends to zero, six-core configurations approach a critical arrangement in which the origin lands exactly on the boundary of the convex hull — precisely the configuration at which Carathéodory's bound saturates, no more and no less. This round's strongest quantitative result is a refined far-field pressure enstrophy debt (Theorem 27.1): $\mathfrak E_R\gtrsim\kappa^2\gamma^{-2/3}$ — the smaller the margin, the higher the rescaled-enstrophy cost required to sustain decoupling, further refining C3-P/C3-Q's $\kappa^2$ debt by the margin. The document explicitly flags NG-S1: this bound does not exclude $\gamma\to0$; it merely attaches a diverging price tag to it — if the rescaled enstrophy really can grow without bound, a vanishing margin remains algebraically permissible on its own, and a genuine obstruction must come from an independent upper bound on $\mathfrak E_R$ found elsewhere, which remains OPEN.
[document] 22 / C3-T: Pressure Diversification, Cone-Eigenvalue Non-Rigidity, and the Heredity Gap
C3-S drove margin uniformity all the way to cross-scale rigidity. This round turns back to examine two inferences that look natural but do not hold, honestly flagging the type-level gaps. The first is Half-Space Signature Non-Rigidity (Proposition 5.1): a fixed 5-dimensional mean-strain half-space (C3-P's $H_0$, or the common support matrix of C3-R/S) cannot pin down the sign of the middle eigenvalue $\lambda_2$ — the document gives an explicit two-matrix counterexample in which both matrices lie in the same half-space yet have opposite $\lambda_2$ signs. Only when the half-space narrows to a cone carrying an eigenvalue gap can Weyl's inequality (Theorem 8.1) lock down the sign. But even once the sign is locked, the Mean-to-Pointwise Middle-Eigenvalue No-Go (Proposition 11.1) proves that
[document] 23 / C3-U: Pressure-Poor Heredity Decomposition, Adjoint Mean-Strain Transport, and Mean-to-Pointwise Rigidity
C3-T left two transport gaps: the uniform-cone branch has $K_\ast:v_{n,i}\ge\gamma_0>0$, but the mean-strain cone does not imply pointwise $\lambda_2^+$ geometry; the cone-degeneration branch has a pressure-poor six-core witness at every scale, but a scale-by-scale witness does not imply a pressure-poor causal ray. This round converts both gaps into computable PDE conditions. The core is the Exact Pressure-Heredity Decomposition (Theorem 4.1): the parent-to-child change in the far-field pressure matrix splits exactly into three terms — spatial center displacement $\Delta H_{\rm space}$, near/far reclassification $\Delta H_{\rm recl}$, and time-source handover $\Delta H_{\rm time}$ — the spatial displacement costs only $O(\kappa^{-4}\mathfrak E_p)$ and can be driven small by a large $\kappa$; the genuine difficulty lies in reclassification ($\kappa^{-3}\mathfrak E_{pc}^{ann}$) and the time-source handover ($\kappa^{-3}\mathfrak T_{pc}^{far}$), and it is explicitly proved that the energy inequality itself does not control $\|\nabla\partial_tu\|_2$, so the time handover is not budgeted at the energy level. Using the adjoint cutoff ($\partial_t\chi+u\cdot\nabla\chi+\nu\Delta\chi=0$), it obtains the Exact Adjoint Mean-Strain Transport Identity for the local mean strain (Theorem 14.1), writing the directional rotation exactly as a strain/vorticity quadratic term plus an integral debt from the pressure Hessian. Combining these gives the Conditional Pressure-Poor Heredity Theorem (Theorem 18.1): as long as the turnover of both the far-field matrix direction and the mean-strain direction is small enough, the pressure-poor property transfers from parent to child — heredity is no longer a vague OPEN question but a conditional theorem with explicit sufficient conditions. On the mean-to-pointwise side, the Mean-to-Pointwise Middle-Eigenvalue Theorem (Theorem 24.1) uses Morrey–Poincaré to lift the averaged eigenvalue sign to the pointwise level when $p>3$, but $p=3$ is exactly the genuine endpoint obstruction where $W^{1,3}$ fails to embed into $L^\infty$ (NG-U5); an alternate route via a band-limited shell eigenvalue gap plus remainder smallness is also given (Theorem 30.1). This round's most important honest conclusion comes in §34-36: even if the pointwise middle-strain event is fully closed off, a coherent positive-sign event of amplitude $R^{-2}$, volume $R^3$, and duration $R^2$ pays only an $O(1)$ critical $L_t^2L_x^3$ cost — the sum over infinitely many such parabolic Zeno events diverges, which is exactly the scenario a hypothetical blow-up would allow. So pointwise middle-strain rigidity does not amount to a proof of regularity; a genuinely finite budget, or an incompatible geometry, is still needed elsewhere.
[document] 24 / C3-V: Turnover Packing, the Pressure-Heredity Failure Trichotomy, and Strain-Fluctuation Escape
C3-U split pressure-poor heredity into three terms — spatial displacement, reclassification, and time handover — and gave an exact adjoint transport identity for the local mean strain. This round asks the real question: can these turnover/fluctuation debts stay large across infinitely many viscous ancestry generations? The core is the Endpoint Pressure-Turnover Bound (Theorem 3.1): the time-source handover in fact admits an endpoint enstrophy bound that does not require $\partial_tf$ to be integrable, which yields the Bounded-Enstrophy Far-Pressure Direction Stability (Theorem 10.1) — as long as the parent/child rescaled enstrophy is bounded and the far-field matrix is nondegenerate, the far-field pressure direction itself can be transported stably for a sufficiently large $\kappa$, no longer a vague OPEN question. So if pressure-poor heredity genuinely fails on this branch, the blame must shift to the rotation of the local mean-strain direction (Theorem 14.1: Pressure-Efficiency Recovery Requires Mean-Rotation Toll). Mean rotation further splits into two carriers — quadratic strain/vorticity-term rotation and local pressure-Hessian rotation (the dichotomy of Theorem 16). The quadratic-term rotation obeys Weighted Quadratic-Turnover Packing (Theorem 18.1): $\sum_nR_n\mathfrak R_n^Q\le C\|u_0\|_2^2/\nu^2$ — but this is $R$-weighted, not unweighted-finite; under geometric-series scaling $R_n=2^{-n}R_0$ one has $\sum R_n<\infty$, so every generation can still spend an $O(1)$ normalized rotation without violating the kinetic-energy dissipation budget at all. This gives this round's most important result, the Turnover Zeno No-Go (§20): finite kinetic-energy dissipation does not imply finite total mean-direction variation — energy alone cannot force directional convergence, and energy-only Pressure-Poor Heredity is formally ruled a NO-GO (§43). On the other side, mean-to-pointwise failure is compressed, via the Fluctuation–Intermittency Identity (Theorem 31.1), into a single exact algebraic equality, yielding the Strain-Fluctuation Escape Dichotomy (Theorem 32.1): a large Morrey obstruction must be carried by either a higher-derivative stock $\mathfrak H_R$ or a shrinking, intermittent active volume $\phi_{p,R}\to0$ — not by unstructured
[document] 25 / C3-W: Critical Pressure Rotation, Strain Active-Volume Sparseness, and the Analyticity-Scale Barrier
C3-V compressed the hypothetical singular survivor into two concentration channels: pressure rotation and strain fluctuation. This round advances both by one step. On the pressure side, the core is the Critical Pressure Mean-Forcing Bound (Theorem 4.1): the pressure forcing of the mean strain, $P_{\chi,R}=\int\chi_R\nabla^2p$, is a signed tensor, so there is no need to control $\int\chi|\nabla^2p|$; two integrations by parts (subtracting an arbitrary constant $c$) reduce it exactly to the scale-critical $L^{3/2}$ pressure oscillation $\Pi_R$. From the global bound $\int\|p\|_{3/2}^2dt\le C\|u_0\|_2^4/\nu$ (Theorem 7.1, a standard Riesz-plus-interpolation estimate), one obtains $R^2$-Weighted Pressure-Rotation Packing (Theorem 8.1) — but this is still only weighted-finite; under geometric-series scaling every generation can still have $\mathfrak R_n^P\sim1$, so the Zeno escape of pressure rotation still survives (§9). There is also Pressure-Active Core Packing (Theorems 11.1, 12.1): both the number of $b$-pressure-active cores and their time-$L_t^{4/3}$ multiplier admit a scale-independent global budget, connecting directly to Constantin's pressure-regularity theorem — a hypothetical blow-up must escape the uniform integrability of $|p|^{3/2}$ over a shrinking set; pressure-rotation escape is, in essence, a critical pressure-concentration branch. The genuinely new geometry is on the strain side: the Volume-to-One-Dimensional-Sparseness Lemma (Theorem 20.1, a purely geometric lemma) proves that a volume smaller than $\delta^3|B_r|$ already guarantees a direction along which the set is one-dimensionally $\delta$-sparse at that scale, from which follows the Strain-Intermittency-to-Sparseness Theorem (Theorem 22.1): once the effective active volume $\phi_{p,R}$ is small enough, the high-gradient region is automatically one-dimensionally, linearly sparse at scale $r_{\rm sp}\sim\phi_{p,R}^{1/3}R$ — and it is proved that $|\nabla S|\asymp|D^2u|$ pointwise (§23), which places this route on the same derivative order as the Grujić–Xu higher-derivative sparseness-regularity framework. So extreme intermittency is not a free escape: if the sparseness scale does not exceed the relevant analytic radius $\rho_{\rm an}$, a known geometric regularity mechanism may be triggered; to keep functioning as a singular survivor, the analytic scale must shrink faster than $\phi^{1/3}R$ (the Analyticity-Scale Escape Debt), or the component/sign/time interfaces must fail to match.
[document] 26 / C3-X: Joint Pressure–Strain Concentration, Finite-$k$ Gap Closure, and Analyticity-Scale Escape
C3-W already compressed the hypothetical singular survivor into two channels: pressure concentration and strain intermittency. This round asks the real question: can both escape without limit at the same time? The core is the Critical Pressure-Mass Certificate (Theorem 4.1): replacing C3-W's constant subtraction with an affine-function subtraction in the oscillation bound, the $b$-pressure-active core is thereby shown to carry a scale-independent critical pressure mass containing no $R$ at all, $\int_{B_{2R}}|p|^{3/2}\ge cb^{3/2}\nu^3$. Multi-core shrinkage (Theorem 6.1: the Small-Volume Pressure Concentration Certificate) directly yields a certificate of non-vanishing pressure mass on a small-volume set, connecting to Constantin's uniform-integrability pressure-regularity criterion — but it is explicitly flagged as merely a sufficient mechanism, not a contradiction. This round's most important no-go is in §13-32: pressure concentration does not imply pointwise overlap with strain-gradient concentration — because pressure is a nonlocal quadratic transform, a far-field source can generate local pressure in a region of low $D^2u$; the co-located case ($\Theta_{P/S}\ge\theta_0$) and the segregated case ($\Theta_{P/S}\to0$) must be tracked separately and must not be automatically merged. This round's strongest new structure is the Finite-$k$ Volume Gap-Closure Lemma (Theorem 17.1): it bridges the algebraic gap, within the Grujić–Xu higher-derivative hierarchy, between the
[document] 27 / C3-Y: Derivative-Chain / Intermittency Tradeoff, Direct-vs-Chain Gap Closure, and Joint-Concentration Routing
The final round of the C3 series opens with a Source Audit Correction (§0): re-anchoring the external theorem to its formal journal version — Grujić & Xu, Asymptotic Criticality of the Navier–Stokes Regularity Problem, Journal of Mathematical Fluid Mechanics 26, Article 53 (2024-07-27) — explicitly listing the theorem numbers cited (3.5 the direct criterion, 3.7 the energy a priori, 3.8/3.9 the ascending/descending chain, 3.14 chain-assisted). It re-derives three scales: the energy-a-priori scale $R_{\rm apr}^{(k)}\sim A_k^{-1/(k+3/2)}$, the direct finite-$k$ regularity scale $R_{\rm dir}^{(k)}\sim A_k^{-3/2/(k+3/2)}$, and the chain-assisted scale $R_{\rm chain}^{(k)}\sim A_k^{-1/(k+1)}$, with $R_{\rm dir}<R_{\rm chain}<R_{\rm apr}$. The core is the Derivative-Chain / Intermittency Tradeoff Identity (Theorem 12.1): the ratio between the active-volume exponent required by the direct route, $\theta_k^{\rm dir}=3/[2(k+3/2)]$, and that required by the chain-assisted route, $\theta_k^{\rm chain}=3/[2(k+1)(k+3/2)]$, is exactly $k+1$ — the derivative-chain dynamics reduce the power-law burden of the required spatial intermittency by precisely a factor of $k+1$. This round's most important honest moment comes in §15-18 and §35: at $k=2$, the theorem-ready direct exponent is $\theta_2^{\rm dir}=3/7$, not the $1/7$ flagged in the previous round, C3-X — $1/7$ is now formally repositioned as merely the weaker, chain-assisted formal exponent, one that requires an additional chain-ascension gate condition and cannot stand alone as a $k=2$ regularity bridge; this is the paper's own direct correction of the status label it attached to its previous round's result. Another key distinction is No-Go 19.1: a small local effective volume at a single ancestry core, $\phi_{p,R}(x_{\rm ancestry})\ll1$, does not imply that the uniform-local active-volume factor $\Phi_{k,c}$ genuinely required by the external theorem is small at every spatial point — this is an essential separation between an
[document] 28 / C4-A: Unified Survivor State, Synchronization Debt, and Transition Closure
The round opens by formally closing C3 (§0): the main task of C3-A through C3-Y was not to prove global regularity, but to compress the enormous space of possibilities for a hypothetical blow-up down to a small number of survivor channels that can no longer be excluded by any single scalar budget (UV escape, helical pair production, first-crossing causal ancestry, gauge-invariant occupancy, strain self-amplification geometry, Betchov localization, operator escape, near/far-field pressure compression, multi-core stacking, pressure heredity, strain intermittency, critical pressure concentration, derivative-chain tradeoffs). C4 therefore no longer asks what further necessary conditions there might be, but instead asks: can all currently known necessary channels simultaneously and legally coexist within one genuine singular state-transition chain? The core correction, in §1-3, is that the intersection of global necessary conditions is not the same as the intersection of pointwise synchronized events — even if the critical vorticity toll, positive middle strain, Miller operator escape, pressure concentration, and derivative-geometry gate failure are all marginal necessary conditions for a hypothetical blow-up, they may still be paid off separately, at different times, on different scales, in different spatial cores, and along different causal branches. The Marginal Divergence Synchronization No-Go (Theorem 13.1) proves by explicit construction that even when the integrals of two nonnegative channel densities both diverge, this in no way implies that their supports intersect: cutting each divergent window into two non-overlapping halves leaves the product identically zero everywhere. This yields the hard guard G-SYNC: it forbids the illegal inference that A diverging plus B diverging implies A and B are simultaneously large, and any claim of intersection must additionally supply evidence of persistence, overlap, heredity, or transition cost. The positive result is the Persistence-to-Synchronization Lemma (Theorem 16.1): if the sum of the inactive fractions of every necessary channel is less than 1, a union bound directly guarantees the existence of a jointly active moment — disguising a persistence estimate as a synchronization theorem. Conversely this yields the Temporal Desynchronization Debt: a permanently asynchronous singular path must force the sum of inactive fractions to satisfy $\ge1$, and the Recurrent Desynchronizer Lemma (Theorem 19.1) uses a pigeonhole argument over the finite channel family to prove that any permanently asynchronous path must contain at least one channel that repeatedly desynchronizes — formally converting the C4 problem into a turnover problem: not a search for a new static inequality, but Synchronization-by-Turnover Rigidity. The document builds a five-level synchronization hierarchy (Sync-0 marginal through Sync-4 causal), defines the Unified Survivor State $\mathfrak S_n=\langle\Gamma_n,\mathbf L_n,\mathbf C_n,\mathbf G_n,\mathbf D_n\rangle$ (the load, carrier, gate, and defect four-vectors), and lays down the No-Deletion Rule: any channel debt not locally absorbed must flow into the defect vector — it may not simply vanish. Among the legal-transition definitions (T1-T8), the most important is T8, Gate Termination: as soon as any sufficient regularity gate genuinely closes, the singular chain must terminate — the state machine may not silently ignore regularity that has already been proved. The round's most important honesty correction, in §41, is that the correct form of blow-up is not a same-time, same-place pointwise intersection, but rather a bundle of asynchronous marginal debts, together with enough transition structure to keep them all payable all the way up to $T_\ast$ — and C4's task is precisely to prove that such an asynchronous bundle cannot forever evade synchronization or regularity closure.
[document] 29 / C4-B: Temporal Synchronization, Pulse-Capacity, and Carrier-Relay No-Go
C4-A already proved that if a necessary channel remains persistently active within the same viscous window (the sum of inactive fractions less than 1), it is forced to synchronize; conversely, a permanently asynchronous path must force the sum of inactive fractions to satisfy $\ge1$, and the finite channel family guarantees the existence of at least one recurrent desynchronizer. C4-B originally set out to attack the question: can this recurrent desynchronizer shut down and restart infinitely many times within the transition-cost budget already proved in C3, without ever going over budget? This round's answer is no — generic turnover rigidity is not enough to force synchronization — and the reasons split precisely into four kinds. The Pulse-to-Persistence Lemma (Theorem 3.1) proves that a lower bound on duty cycle requires the total integral together with an upper bound on peak amplitude to hold simultaneously — divergence of the integral alone is not enough: if the peak $M_n\to\infty$ faster than the average load, the duty cycle can still tend to zero. This is Pulse-Capacity Escape, and it also happens to explain the mechanism behind C4-A's own construction of two separately-divergent channels with zero overlap. The Finite-Variation Switching Lemma (Theorem 9.1) looks as if it could defeat the recurrent desynchronizer — completing one full $\alpha\to\beta$ hysteresis cycle on a fixed scalar carrier requires at least a fixed variation, and finite total variation permits only finitely many complete switches — but the Carrier-Relay Construction (§12) supplies a decisive counterexample: the same channel type need not keep reusing the same absolute carrier (shell, location, packet) — each generation can instead activate a brand-new carrier, pulse once, and never use it again, so that a finite-variation-per-carrier bound never touches it at all. The document checks this directly against C3-K's own weighted hysteresis count $\sum w_qN_q^{up}<\infty$ and confirms that infinitely many geometric shells each crossing upward exactly once ($N_q^{up}=1$) is fully compatible with that budget. Stronger still is the Generation Desynchronization No-Go (§15-16): two channels each recurring infinitely often in no way implies the existence of infinitely many shared generations (an explicit odd/even generation-separation counterexample) — what is needed is block-density persistence, not mere infinite recurrence. The round's central verdict is the Summable-Weight No-Go (Theorem 20.1) together with a geometric-ancestry-scale audit (§21-22): for every $\alpha>0$, $\sum R_n^\alpha<\infty$ — meaning that every summable transition-cost budget C3 has so far proved (quadratic strain rotation, average pressure rotation, fixed-shell hysteresis, sustained-cone-degeneration pressure debt) is synchronization-subcritical: not one of them can by itself forbid one $O(1)$ switching/rotation/activation event per generation — while the genuinely critical costs that must diverge (middle strain, critical helicity) are themselves exactly the divergence that blow-up requires, and so likewise cannot serve as a finite synchronization budget. The document adds four hard guards (G-RELAY, G-PULSE, G-GEN, G-WEIGHT) to block lazy versions of these arguments, and makes a key strategic pivot (§34-39): C4 should no longer rely on generic arguments of the form that switching every generation contradicts total variation, but should instead go looking for a genuinely N–S-specific event — some nonlinear event that itself simultaneously produces two or more necessary loads, so that they simply cannot freely stagger in time, change generation, or change carrier. The document already lists candidate pairings (UV replenishment paired with helical pair production, strain self-amplification paired with Miller operator escape, pressure rotation paired with strain growth — currently the most synchronized pairing, though pressure can support or oppose it and need not be positive, strain intermittency paired with the derivative-geometry gate), and the next round formally attacks Shared-Event Coupling.
[document] 30 / C4-C: Carrier Relay, Shared-Event Coupling, and the Amplitude-to-Flux Barrier
C4-B proved that generic turnover cost is not enough to force synchronization. This round's strategy formally pivots to Shared-Event Synchronization: rather than asking whether A and B can recur separately, it asks whether there exists some genuine N–S event whose single source, single balance, single triad algebra already forces A and B to be paid simultaneously. The core tool is helical-triad algebra (§4-9): for a single Fourier triad $k\le p\le q$, combining energy conservation with helicity conservation directly locks the derivative vector into a fixed form, splitting into four helical classes (I same-handed, II-IV opposite-handed). C4-C.2 proves that for every opposite-handed class, whenever the highest mode's energy gain $\dot e_q>0$, there is positive critical pair production $\mathcal R_\tau>0$ — Class IV is even an exact perfect coupling, $\mathcal R_{IV}=G_{IV}^q$. The coupling constants for Classes II/III degenerate to zero as the radial gap $q-p\to0$, but within the robust regime of locally comparable triads plus a non-degenerate radial gap, a genuine positive lower-bound coupling constant can be obtained (Theorem 12.1). This yields the High-Mode Energy Gain branching edge: high-mode energy gain forces same-handed carriers, or radial-gap degeneration, or net positive helicity production, or helical cancellation — the first genuine N–S helical shared-event branching edge in C4. But the round's most important guard is in §19: the C1/C3-G UV anchor is an amplitude/norm event, not an energy-gain/flux event, and the two cannot simply be equated. The Phase-Rearrangement Norm–Flux No-Go (Theorem 20.1) confirms by explicit construction that this distinction is real: fixing every mode's amplitude $|a_m|$ and changing only the phases leaves $\|u_\theta\|_2$ unchanged by Parseval's theorem, but $\|u_\theta\|_\infty$ can swing dramatically as phases align or cancel — there exists a smooth phase path along which the $L^2$-norm derivative is zero while the $L^\infty$-norm keeps increasing, proving that amplitude information alone cannot algebraically determine the sign of shell energy flux; this is the Amplitude-to-Flux Barrier. The positive, compensating result is that although UV amplitude cannot control flux, it can, via the Bernstein inequality, precisely control the critical stock at that same instant — UV Amplitude to Critical Helical Stock (Theorem 23.1) and to Strain/Vorticity Stock (Theorem 24.1) — C4's first genuinely non-asynchronous shared edge, though it is stock synchronization, not production synchronization. On the strain side, the Local Strain-Growth trichotomy edge (Theorem 28.1, a pigeonhole argument over an exact three-term sum) proves that a local strain-growth event forces pressure, or Betchov boundary flux, or positive vorticity stretching; chaining this to C3-N's exact local Betchov identity and the pointwise vorticity-stretching geometric decomposition expands it into a four-way exact edge (pressure, or Betchov, or middle-strain-weighted vorticity, or principal-stretching-aligned weighted vorticity) — currently C4's cleanest multi-step exact local edge. On the operator side, the Miller Operator-Source trichotomy edge (Theorem 37.1, a triangle inequality) proves that operator escape forces the advection term, or strain-squared, or the vorticity quadratic term to bear it simultaneously — it cannot be swapped via carrier relay for no source at all; but it also flags the Operator Cancellation Debt (§39): when the vorticity-quadratic source is large but the full Miller operator is small, the shortfall must be absorbed as cancellation by the remaining two terms. The document assembles C4's first-version shared-event closure graph (§41) and four genuinely minimal synchronization subsets (§48), and honestly lists five explicit no-gos (amplitude does not imply energy gain; energy gain does not imply net helicity production; critical stock does not imply critical production; strain growth does not imply Miller escape; a large local vorticity-quadratic source does not imply a large full operator). The next round formally locks onto the two most critical remaining gaps: the Amplitude-to-Flux Bridge and Helical-Cancellation Rigidity.
[document] 31 / C4-D: Amplitude-to-Flux Branching Bridge, Local Work Cancellation, and Helical-Cancellation Rigidity
C4-C leaves the Amplitude-to-Flux Barrier: amplitude information alone cannot determine the sign of flux. This round no longer pursues the false direct implication, and instead proves a branching bridge on the genuine N–S shell evolution. The core is the Persistence-or-Fast-Crossing Dichotomy (Theorem 5.1): for any first crossing $\beta_0\to\beta_1$ of a critical shell, either the entire preceding viscous window maintains $a>\beta_0$ (which can be routed straight back to C4-A's persistence-synchronization mechanism), or the crossing is completed as a fast crossing within a single viscous time — so this round only needs to handle fast crossings. Positive Amplitude Variation Requires Positive Nonlinear Source (Theorem C4-D.2) uses a standard max-envelope argument to prove that, at the amplitude maximum, the viscous term $e\cdot\Delta f\le0$ cannot contribute a positive variation, so any positive $M'(t)$ must be supplied by the nonlinear source, $-e\cdot N\ge M'>0$ — this is an exact same-instant amplitude/source coupling. A fast crossing must pay a fixed positive-variation budget; splitting by source efficiency $\eta$ into good and bad regions, the bad region yields the Nonlinear Source-Overcapacity Impulse (Theorem 14.1), while the good region, via the Band-Limited Local Positive-Work Ball (Theorem 17.1, using Bernstein continuity to expand a pointwise source into a shell-scale positive-work ball), yields the Integrated Local Work Toll (Theorem 19.1) — a genuinely scale-invariant local nonlinear-work cost. The Local-to-Global Work Cancellation Identity (Theorem 22.1) proves that local positive work cannot simply vanish: if it does not become net shell input, it must leave a corresponding spatial negative work behind. Combining the three yields the round's core result, the Amplitude-to-Work Branching Bridge (Theorem 23.1): every fast crossing must pay at least one of a source-overcapacity impulse, positive shell nonlinear work, or spatial work cancellation — a scaling audit (§40-41) shows that both of these new branches are scale-critical $O(1)$, which explains why an ordinary finite energy budget likewise cannot shut them off, but this time it is genuinely hung on N–S structure rather than a generic pulse. If the positive-work branch is taken, it is further expanded by triad rank and helical class (rank deficiency, same-handed, radial-gap degeneration, robust opposite-handed). The round's single most important new theorem is Helical Cancellation Forces High-Mode Work Cancellation (§31, Theorem C4-D.7): it proves that the robust opposite-handed coupling ratio $\kappa_\tau=\mathcal R_\tau/(q_\tau\dot e_{q_\tau})\in[c_\ast,1]$ holds for either sign, so that if helical pair production is reversed and cancelled (the cancellation branch of C4-C), this necessarily produces, in the same instant, a negative high-mode energy work of comparable magnitude — helical cancellation is no longer an independent hidden escape channel; it is merely the critically weighted projection of energy-work cancellation, a stronger result than C4-C's own. The document assembles the complete amplitude-crossing branch tree (§34, eight named branches A through H), and announces the partial closure of the Amplitude-to-Flux Barrier (§35): the direct implication is still false, but the branching implication — that amplitude crossing implies a finite, structured branch set — is now proved. The document also confirms (§39) that most branches are already connected to the existing C3 dependency graph and are not isolated new open problems, and uses a pigeonhole argument to obtain the Recurrent Escape-Branch Reduction (Theorem 38.1): infinitely many critical crossings within a finite branch family force some branch to recur — so the next round can attack the rigidity of each branch one at a time, rather than handling every crossing-escape simultaneously.
[document] 32 / C4-E: Recurrent Escape-Branch Rigidity, Transport-Free Source Routing, and UV Motif Compression
C4-D compressed critical-shell crossings into eight branches. This round's task is not to add yet more branches, but to compress the mutually-reducible branches into a finite number of recurrent structural motifs. The core tool is transport-free source routing: define $R_q^\sigma=N_q^\sigma-v_q\cdot\nabla f$ (subtracting off the low-mode pure-transport velocity field $v_q$), and prove two exact identities — Pure Transport Does Not Drive the Sup-Norm Maximum (Theorem C4-E.1: at the amplitude maximum, $\nabla|f|=0$, so the transport term vanishes exactly) and Pure Transport Does Not Drive Global Shell Energy Work (Theorem C4-E.2: because $v_q$ is divergence-free, $\int f\cdot(v_q\cdot\nabla f)=0$ holds exactly) — so amplitude sources and shell energy work are in fact both driven by the same transport-free deformation/cross-scale remainder, sharper than C4-D's direct use of the full $N_q^\sigma$. A Bony/commutator decomposition (Theorem 9.1) splits $\|R_q^\sigma\|_\infty$ into a low-mode deformation load times a comparable shell envelope, plus a high-high frequency congestion term. In the regime combining front-side safety, a fixed hysteresis ratio, and a sufficiently small threshold, the Source-Overcapacity Routing Theorem (Theorem 13.1) proves that source overcapacity must route to either the low-mode shear branch (E-SHEAR, a genuine $O(1)$ critical vorticity event at the same derivative level as BKM/Cheskidov–Dai) or the high-high-frequency branch (E-HH). The Small-Threshold Far-Relay Theorem (Theorem 17.1) further proves that under a small threshold, the nearby high-high-frequency capacity is only $O(\beta_1^2)$, not enough to pay for an $O(\beta_1)$ crossing impulse, so high-high-frequency congestion must draw on a strictly higher frequency $p\ge q+L$ — this unifies C4-D's rank deficiency with this round's source overcapacity into a single structural motif: Higher-Frequency Relay (§20), the round's first genuine motif merger. On same-handed triads, exact algebra proves $-\dot e_p=\dot e_k+\dot e_q$ (§22-23): same-handed high-mode gain is not a one-way UV transfer — the smallest mode $k$ gains simultaneously within the same event. The Homochiral Gap-or-Reverse-Co-Gain Lemma (Theorem 24.1) proves that local same-handed gain must lead either to radial-gap degeneration or to comparable-magnitude low-mode co-gain (a Bidirectional Critical Work Split) — same-handedness is therefore absorbed into spectral-geometry degeneration or critical work variation, and is no longer an independent branch. The document unifies Class II nonlocal gap collapse, Class III near-equilateral radial concentration, and same-handed gap collapse into the Spectral-Geometry Degeneration Motif (§29); and unifies spatial work cancellation, the robust helical cancellation already proved in C4-D (which forces negative high-mode work), and same-handed bidirectional splitting into the Critical Work-Variation Motif (§31) — again noting that this matches the same honesty limitation seen repeatedly across C3/C4: an ordinary energy balance controls only the net value $W^+-W^-$, not the total $W^++W^-$, and there is currently no finite unweighted budget for it. The round's core result is the UV Recurrent Motif Compression Theorem (Theorem 37.1, under explicitly flagged front-side hypotheses): every critical UV shell crossing must fall into one of six motifs — three closure-friendly motifs (persistence, UV–low-strain synchronization, UV–helicity-production synchronization, all three already synchronization successes rather than escapes) and three genuinely unresolved escape motifs (Higher-Frequency Relay, Critical Work Variation, Spectral-Geometry Degeneration). The next round formally attacks the trilemma formed by these three.
[document] 33 / C4-F: Higher-Frequency Relay, Work-Variation Operator Bridge, and the Spectral-Congestion Trilemma
C4-E left three genuinely un-synchronized escape motifs: $M_4$ higher-frequency relay, $M_5$ critical work variation, $M_6$ spectral-geometry degeneration. This round asks whether these three can still achieve free escape with no additional structure. The answer is no. On Relay ($M_4$), the Low-Output High-High Energy-Tail Bound (Theorem 4.1, a standard Littlewood-Paley kernel estimate) proves that a far-field high-high-frequency source is controlled by a far-field kinetic-energy tail, yielding the Relay-to-Critical-Tail-Stock Theorem (Theorem C4-F.2): a recurring relay event must co-occur with a genuine far-field critical $\dot H^{1/2}$ Sobolev-tail stock — not merely the weaker statement that some higher modes participated in the source. The Subcritical Parent Multiplicity Bound (Theorem C4-F.3) further proves that if all these higher-frequency parents remain front-side subcritical, then bearing the critical relay source forces a large amount of effective shell-cell multiplicity, or delocalization. So $M_4$ is no longer free relay — it forces a far-field critical tail stock plus effective parent multiplicity, already a form of phase-space congestion. On Work Variation ($M_5$), continuing to use C4-E's transport-free remainder, the document first proves Work Variation Forces a Nonlinear Source Impulse (§16), then uses a Korn-type identity together with the spectral-support facts to obtain the Fixed Deformation-Forcing Impulse (Theorem C4-F.5) — a genuinely fixed-size, non-Zeno-weighted same-window strain/deformation-driving impulse. Chaining this to C3-Q's exact operator identity ($\mathcal N_{\rm proj}=\mathcal Q_{SV}-\frac12P_{st}(\omega\otimes\omega)$) gives the Work-Variation Operator-Source Trichotomy (Theorem C4-F.6): work variation must co-occur with the Miller operator, the vorticity-quadratic operator source, or low-mode transport deformation — $M_5$ is no longer a free UV escape but a genuine UV-to-strain/operator-source synchronization, only with three possible carriers. On Spectral Geometry Degeneration ($M_6$), the document converts triad geometry into a measure-concentration problem on the normalized radial simplex, and computes the measure exponent for each degeneration type exactly (strongly nonlocal, Class II upper-gap, and same-handed gap degeneration are all $O(\varepsilon)$; Class III near-equilateral concentration is the stronger $O(\varepsilon^2)$). The Radial Work-Concentration Lemma (Theorem C4-F.7, a Cauchy–Schwarz argument) proves that if a fixed proportion of critical triad work keeps being packed into a shrinking degenerating radial set, the radial work-density measure cannot remain uniformly absolutely continuous and must diverge as $\varepsilon_n^{-m}$ — so $M_6$ is no longer silent geometry with a vanishing coupling coefficient; it forces either non-summable nonlocality or a concentration of radial interaction work. Combining the three yields the round's core result, the UV Congestion Trilemma (Theorem 37.1): the three escape motifs are formally compressed into three forms of congestion — tail/wrap congestion, deformation/operator congestion, and radial-interaction congestion. The document honestly flags (§39) that congestion is not yet contradiction: none of the three currently has a known finite global budget (the critical $\dot H^{1/2}$ tail could genuinely diverge under a hypothetical blow-up; the deformation forcing has no known global $L^1_tL^2_x$ budget; the radial measure has no known uniform absolute-continuity theorem) — but synchronization genuinely has advanced (§40): even though UV has escaped persistence, low strain, and helicity production synchronization, it can no longer remain a single-channel asynchronous object. The next round formally asks whether these three forms of congestion can still coexist independently, or whether they too will be forced to synchronize with each other.
[document] 34 / C4-G: Cross-Congestion Synchronization, Operator Funnel, and UV Phase-Space Closure
C4-F left three forms of congestion: $C_{TP}$ tail/wrap, $C_{DO}$ deformation/operator, $C_{RI}$ radial-interaction. This round asks whether these three forms of congestion can be fully independent of one another. The answer is no. The document first traces each motif's origin: higher-frequency relay ($M_4$) has two sources — Relay-S (from source overcapacity) and Relay-W (from rank-deficient positive work). The Source-Impulse to Growing Deformation-Impulse Theorem (Theorem 7.1, via an annular Bernstein lower bound combined with a symmetric-gradient Korn-type lower bound) proves that source overcapacity must co-occur with a genuine $L^1_tL^2_x$ deformation-driving impulse whose lower bound grows like $\lambda_q^{1/2}$ — strong evidence of congestion, though Leray energy theory currently supplies no corresponding finite global budget for it. This gives that both Relay-S and Relay-W automatically imply deformation/operator congestion (Theorems C4-G.2, C4-G.3), while spectral-geometry degeneration ($M_6$) was, from the outset, itself a sub-case of the positive-work branch, and so likewise automatically implies it (Theorem C4-G.4). Combining the three yields the round's core result, the Cross-Congestion Funnel (§15): $M_4\subset C_{TP}\cap C_{DO}$, $M_5\subset C_{DO}$, $M_6\subset C_{RI}\cap C_{DO}$, so $M_4\vee M_5\vee M_6\Rightarrow C_{DO}$ — $C_{DO}$ is the universal forcing funnel; $C_{TP}$ and $C_{RI}$ are no longer independent exits running parallel to it, but merely phase-space coordinates attached to the same deformation/operator event. The document additionally proves that far-field relay carries an exact near-anti-parallel Fourier geometry (Theorem 18.1, via the reverse triangle inequality plus the law of cosines): the far-field parents' kinetic-energy magnitudes must be comparable and their directions must be close to anti-parallel, with the angular aperture shrinking as $O(2^{-L})$ as the relay gap $L$ grows — relay is itself a form of angular/radial interaction concentration. The round's most important achievement is the Universal Deformation-Funnel Theorem (Theorem C4-G.6): every critical UV crossing must fall into one of four synchronization channels — persistence, low strain/vorticity, positive helicity production, or deformation/operator driving — compressing the entire UV side further, from eight branches to six motifs to three congestions, down to four synchronization channels. The document then uses C3-P/Q's exact operator identities to split the fourth channel further: G-O1 Miller-operator impulse, G-O2 vorticity-quadratic impulse, G-O3 advection/sweep-deformation impulse. G-O1 in turn yields the Operator-Ratio or Higher-Derivative Impulse dichotomy (Theorem C4-G.7): either the genuine Miller-escape ratio stays elevated for a comparable proportion of time (a genuine necessary condition approaching Miller-style blow-up), or the impulse must instead be paid by $\int\|\Delta S\|_2dt$, feeding directly into the higher-derivative/derivative-chain geometry of C3-W/X/Y. The document also honestly retains the sweep warning of §35: a purely spatial-translation-style sweep can make the advection operator large without directly producing local strain growth, so C3-O's guard that an equilibrium fixed point is not the same as a dynamical fixed point must be kept, and must never be silently treated as positive strain-energy production. The UV side finally reaches a clean phase closure (§39): UV crossing no longer has a genuinely isolated recurrent escape; the frontier formally shifts from splitting UV branches to Operator-to-Gate Closure — whether this forced deformation/operator event can genuinely approach some regularity gate.
[document] 35 / C4-I: Middle–Operator Gate Overlap, Angle Depletion, and Local Pressure Re-entry
This paper opens by picking up from C4-H, which already synchronized UV, middle strain, and the growth-aligned operator onto the same sequence of contracting record windows $J_j=(\tau_j,\tau_{j+1})$, each window carrying a middle-load integral lower bound $A_j$ and an operator-load integral lower bound $B_j$ — but had not yet proved same-instant overlap. C4-I attacks only two questions: what exactly is missing from genuine middle/operator same-window overlap, and when must pressure re-enter within the local adjoint core. The core is the Middle–Operator Capacity-to-Overlap Theorem (Theorem 5.1, pure measure inclusion–exclusion, $|E\cap F|\ge|E|+|F|-|J|$): it converts two independent integral lower bounds into a genuine overlap lower bound, provided the peak capacity (essential suprema $M$, $O$) is controlled. The document explicitly points out (§9, §11) that what is truly missing is not another marginally-divergent condition, but rather control of peak capacity and persistence — without an independent upper bound on the peak-to-average capacity ratio, integral information alone cannot force same-instant overlap; this is the Middle–Operator Peak-Capacity Desynchronization Debt. On the operator-angle side, defining $g=\zeta r_\nu$ as the operator's growth-aligned component, the Large-Ratio Non-Growth Routing theorem (Theorem C4-I.3) proves that a large Miller ratio without genuine growth ($g\le1$) must be either strongly anti-aligned ($g<-1$) or must carry a large orthogonal operator component $\|Q_\perp\|\ge\sqrt{R^2-1}$ — a far finer angular-dissipation classification than the plain difference $1-\zeta$. Citing Miller's own exact orthogonality result from 2026, $\langle P_{st}(\omega\otimes\omega),-\Delta S\rangle=0$, the document proves that the vorticity-quadratic term falls exactly within the growth-orthogonal subspace, so orthogonal congestion can only be borne by the vorticity-quadratic term or by orthogonal advection/strain-squared components (Theorem 18.1); while positive $\dot H^1$ growth itself can only be driven by advection alignment or strain-squared alignment (Theorem C4-I.4) — because of Miller orthogonality, the vorticity-quadratic term can never directly drive growth. The document also supplies a pure matrix-algebra counterexample (§22): taking the diagonal matrix $S=\operatorname{diag}(-2,-1,3)$, even though $\lambda_2=-1<0$, the local integrand can still be positive, proving that strain-squared-aligned $\dot H^1$ growth does not imply a pointwise positive middle eigenvalue $\lambda_2^+>0$. On pressure: exact whole-space orthogonality ($\langle\nabla^2p,-\Delta S\rangle=0$) means a growth-aligned operator cannot directly lower-bound pressure; but within the local adjoint core, C3-U's exact identity $M_\chi'=-B_\chi-P_\chi$ yields the Adjoint Mean-Rotation / Pressure Dichotomy (Theorem C4-I.5, a simple triangle inequality): a non-degenerate local quadratic mean driving force must be borne by either mean rotation or pressure; chaining this to C3-X's Hessian-sensitive pressure-oscillation bound gives Mean-Stability Forces Pressure Re-entry (Theorem C4-I.6). The round's core result is the Quadratic Forcing Three-Way Re-entry Theorem (Theorem C4-I.7): a large-magnitude local quadratic intensity must lead to one of matrix/spatial cancellation, mean rotation, or pressure concentration — pressure is not a universal consequence of the operator; pressure must re-enter only when the local quadratic driving force is coherent enough (not cancelled) and mean rotation has been sufficiently depleted. The document honestly lists a complete no-go catalogue (NG-I1 through NG-I5), confirming that C4's remaining genuine asynchronous degrees of freedom are no longer new physical channels, but two compensation mechanisms: temporal pulse separation, and pressure evasion via mean rotation or quadratic cancellation.
[document] 36 / C4-J: Compensation Rigidity, Final Synchronization Audit, and C4 Phase Closure
C4-I left two compensation mechanisms: temporal pulse separation, and pressure evasion via mean rotation/quadratic cancellation. C4-J's task is to determine whether these two can be directly excluded by the existing budget, and if not, whether they can be compressed into a finite number of recurrent motifs; it also performs a final synchronization audit across all six major channels — UV, helicity, strain, operator, pressure, derivative geometry — to judge whether C4 should be closed. The Bounded-Peakiness Pulse-Separation No-Go (Theorem 5.1) gives a genuine no-go by explicit construction: cut the record window into two halves, pack all the middle-strain load into the left half and all the operator load into the right half, so the product is zero everywhere, while still letting the peak-to-average ratio $K_m=K_o=2$ hold for every window — proving that the contracting window itself, even paired with a uniformly bounded peak-to-average ratio, still cannot force same-instant middle/operator overlap: C4-I's sufficient condition $1/K_m+1/K_o>1$ is exactly tight at the symmetric point $K_m=K_o=2$ — a genuine no-go at the level of pure measure theory, not merely a result not yet proved. But an anti-aligned pulse is not free: the Exact Positive/Negative Growth Compensation Identity (Theorem 8.1) is an exact identity, not an inequality, $P_j-N_j=\Delta E_{1,j}$ — any episode of anti-aligned operator pulsing, or of excess viscous dissipation, precisely increases the positive growth-aligned operator variation that must subsequently be paid — it cannot be depleted for free. On pressure evasion, the Integrated Mean-Variation / Pressure Compensation Theorem (Theorem 15.1) proves that if pressure is suppressed, a consistent local quadratic mean driving force must be paid for by a fixed total variation of normalized mean strain; but the scale-weighted packaging already known from C3-V still permits this to survive repeatedly, Zeno-style, along a geometric-ancestry sequence. The round's most elegant new result is the Seven-Point Quadratic Cancellation Witness (Theorem 20.1): it re-understands quadratic-term cancellation, not as an unstructured scalar loss, but as a collapse of the directional barycenter within the six-dimensional space of symmetric traceless matrices ($\operatorname{Sym}(3)\simeq\mathbb R^6$) — by Carathéodory's theorem, any given cancellation ratio $\kappa$ can be witnessed by at most seven local normalized quadratic-tensor directions. As $\kappa_n\to0$, a genuine metadata limit $\sum_{i=1}^7\alpha_i^\ast U_i^\ast=0$ can be extracted within a compact metric space (the unit sphere times a seven-point simplex) — the document explicitly stresses that this is only metadata compactness, not compactness of the full field, and does not violate C3-H's hard no-go that the norm of a rescaled critical field may diverge. The document completes a final six-channel audit table (§37: UV as a conditional causal-ancestry backbone, strain as record-window synchronization, the middle eigenvalue as record-window synchronization, the operator as record-window growth-aligned synchronization, helicity as conditional stock-synchronized production, pressure as conditional local re-entry, derivative geometry as a conditional stock-synchronized gate), reaching the round's core result, the C4 Phase Closure Theorem (Theorem 40.1): every recurring UV singular event can now be routed either to already-synchronized structure, or to one of the six-element finite compensation-motif family $\mathcal C=\{T,O,M,Q,P,D\}$ (temporal pulse, operator angle, mean variation, quadratic cancellation, pressure concentration, derivative-gate defect) — C4's branching/synchronization phase is now formally, structurally closed, though the document repeatedly stresses that this is research-program phase closure, not a regularity theorem: global regularity for Navier–Stokes remains OPEN. The document also explicitly warns what C5 must not do (§41, invoking C3-H's own hard no-go: the norm of a rescaled critical field may diverge, so standard critical-element compactness may not be assumed), and lays out the four levels C5 should prioritize compactifying (finite-dimensional metadata, then probability/defect measures, then packet/core local trajectories, then the full PDE field, with the last level attempted only after an additional uniform critical bound is proved) — handing off to C5, Recurrent Motif Limits, Defect Measures, and Compensation Compactness, opening with C5-A.
[document] 37 / C5-A: Record-Window Renormalization, Compensation-Motif State Space, and Metadata Compactness
C4 has already compressed blow-up's asynchronous survival space into the six-element finite compensation-motif family $\mathcal C=\{T,O,M,Q,P,D\}$ (temporal pulse, operator angle, mean variation, seven-point quadratic cancellation, pressure concentration, derivative-gate defect). C5 no longer asks which branch can still be split off, but instead asks whether these motifs, after record-window renormalization, can admit a compatible recurrent limit. The document first lays down a hard rule: Seregin's necessary condition proves that under a hypothetical blow-up, $\|u(t)\|_{L^3}\to\infty$ and $\|u(t)\|_{\dot H^{1/2}}\to\infty$, so within the singular-lineage rescaling, no uniform upper bound currently exists to which the standard Gallagher–Koch–Planchon critical-element compactness machinery could be applied — C5 explicitly forbids assuming compactness of the full critical field directly, and instead adopts metadata/probability-measure/defect-measure compactification. The record window is first given a unit-time renormalization ($s=(t-\tau_j)/L_j\in(0,1)$), but its relative viscous scale $\Theta_j^{time}=\nu\lambda_{q_j}^2L_j$ must additionally be retained — unit-time normalization is not the same as parabolic-time normalization. The six motifs are then each converted into genuinely compact objects: the middle-strain load becomes a probability measure on $\mathcal P([0,1])$; operator positive/negative growth becomes sub-probability measures, with a compensation offset $\beta_j^{op}=(P_j-N_j)/(P_j+N_j)\in(0,1]$ attached (guaranteed by C4-J's exact identity $P_j-N_j=\Delta E_{1,j}$); operator angle uses a bounded coordinate change so that even a ratio $r_\nu\to\infty$ still lands in a compact space; mean variation becomes a vector measure of bounded total variation; C4-J's seven-point Carathéodory witnesses become the compact space $\Delta_7\times(S^5)^7$; pressure concentration becomes a probability measure on the sphere; and the derivative defect uses a one-point compactification $\mathbb N_\infty=\mathbb N\cup\{\infty\}$, allowing the derivative order itself to diverge as a legitimate boundary value. The round's core result is the Compensation-Motif Sequential Compactness Theorem (Theorem 14.1, relying on finite-dimensional compact factors, weak compactness of probability measures on a compact metric space, weak-star compactness of bounded vector measures, and stitching together the finite discrete motif states one by one): every infinite C4-J record sequence has a subsequence along which every component converges, in its own topology, to a unified state $\Theta_\ast^{C5}$. The document immediately draws a sharp line around what this does not prove (§15): it does not prove that the rescaled field itself converges in $L^3$, $\dot H^{1/2}$, or any full critical topology, nor does it prove that this limiting state is actually produced by some genuine N-S limit field — it is only a necessary motif-compatibility limit state. C5-A.2 is the round's most important new no-go: an explicit construction proves that weak limits can erase microscopic pulse separation — cutting $[0,1]$ into rapidly alternating equal-length cells, with $m_j$ taking its value on even cells and $o_j$ on odd cells, so that $m_j(s)o_j(s)=0$ holds everywhere for every $j$ (completely disjoint at every finite scale), yet the weak limits of both converge to the very same Lebesgue measure — proving that weak-limit overlap is not the same as microscopic same-instant synchronization, which forces the next step to introduce temporal Young / two-scale defects. The document also provides a scale-dependent overlap spectrum $\mathfrak O_{j,n}$ (using a triangular kernel $K_n$) as a partial remedy, capable of preserving overlap information at each fixed scale $n$ without misreading it as genuine synchronization. The round closes with five explicit no-gos (§27): motif compactness does not imply field compactness; pairwise disjointness at every $j$ does not imply disjointness of the limit; equal limiting measures do not imply finite-scale simultaneous overlap; a seven-point cancellation coefficient tending to zero does not imply that seven spatial points are genuinely cancelling exactly; and a pressure limiting measure being an atomic measure does not imply that a genuine N-S singularity actually occurs. It formally hands off to C5-B, Temporal Young Defects and Pulse-Phase Compatibility, whose task is to recover, via a colored temporal Young measure, the microscopic phase information deliberately discarded here.
[document] 38 / C5-B: Temporal Young Defects, Pulse-Phase Compatibility, and the Concentration/Oscillation Trichotomy
C5-A caught a hard no-go: separately compactifying the middle-load measure $\mu_j^{mid}$ and the operator-growth measure $\mu_j^{op,+}$, even when the two are disjoint at every finite scale, can still let the weak limits homogenize into full overlap. C5-B's fix is to stop compactifying separately, and instead use a jointly colored temporal micro-state. Defining normalized load densities $f_j^M,f_j^+,f_j^-$ (each integrating to 1), it first lays down the most basic exact constraint: pointwise $[h_j]_+[-h_j]_+=0$ gives $f_j^+f_j^-=0$ almost everywhere — operator positive and negative growth are exactly mutually exclusive. Fixing a rational threshold $\vartheta=(a,b,c)$, the three loads are thresholded into a binary phase vector $X_j^\vartheta=(\chi_M,\chi_+,\chi_-)$; because positive and negative growth are mutually exclusive, the phase can only fall into a six-state alphabet $\mathcal A=\{000,100,010,001,110,101\}$, forbidding $011,111$. Pushing $(s,X_j^\vartheta(s))$ forward together gives a colored temporal Young measure $Y_j^\vartheta\in\mathcal P([0,1]\times\mathcal A)$, and proves Colored Temporal Young Compactness (Theorem 10.1): a subsequence converges weakly to $Y_\ast^\vartheta$, and because the rational thresholds are countable, a diagonal argument extracts a Temporal Phase Spectrum that holds simultaneously for all thresholds. Because $\mathcal A$ is finite and discrete, forbidden combinations (such as operator positive and negative both active, $F_{+-}$) are preserved exactly as measure zero in the weak limit — this is C5-B.2, Operator Sign-Exclusion Preservation. The round's key repair is C5-B.3 (Theorem 15.1): if the limiting co-active phase mass $C_{\ast,M+}^\vartheta>0$, then for sufficiently large $j$ this coefficient genuinely converges to a positive value — co-activation in the Young limit is not a weak-homogenization illusion; it corresponds to genuine finite-scale simultaneous overlap. Conversely (§16), if finite-scale separation is exact, then for every rational threshold the co-active mass is exactly zero, correctly repairing C5-A's alternating-lattice example: it correctly converges to a 50/50 mixture $\tfrac12\delta_{100}+\tfrac12\delta_{010}$, rather than the spurious $\delta_{110}$. But the Young measure is still not enough: if the load becomes ever more concentrated on measure-vanishing spikes (duty cycle tending to zero, while the total load integral remains 1), a Lebesgue-time Young state only sees the process as almost everywhere inactive. Borrowing, by structural analogy, DiPerna–Majda's oscillation-plus-concentration framework for weak limits of incompressible flow (explicitly stating that this is not building a DiPerna–Majda measure-valued solution for the velocity field $u$ itself, only borrowing the idea at the level of the record-window normalized time-compensation variable), the document defines the load-concentration modulus $\mathfrak c_f^\infty=\lim_{K\to\infty}\limsup_j\int_{\{f_j>K\}}f_j\in[0,1]$, and proves that uniform integrability gives a positive duty-cycle lower bound (Theorem 28.1, a clean three-step estimate), as well as Vanishing Duty Forces Full Concentration (Theorem 30.1: if the duty cycle tends to zero for every positive threshold, the concentration mass must be exactly, not merely approximately, equal to 1). The round's core result is the Temporal Coactivation–Oscillation–Concentration Trichotomy (Theorem 33.1): the normalized middle/operator load sequence must fall into at least one of three classes — B-COACT (genuine co-activation, finite-scale overlap genuinely present), B-OSC (both loads have zero concentration mass and positive duty cycle, yet microscopic separation is sustained by a nontrivial mixture of Young phases), or B-CONC (at least one load has positive mass entering a vanishing-duty-cycle high-amplitude spike). If co-activation is excluded, C4's temporal pulse separation is formally compressed into just two classical weak-limit defects: Oscillation or Concentration. The document also constructs a tagged Young measure binding the phase color to C5-A's operator-angle compact coordinate, proving the Phase–Angle Compatibility Theorem (the closed support of the positive-growth phase must satisfy $\gamma\ge1/2$; the reversed phase must satisfy $\gamma\le1/2$) — color and angle cannot be arbitrarily reassigned in the limit. Finally, the document honestly draws this stage's boundary (§40-41): the Young measure preserves only local phase proportions, not the order of the pulses — the sequences $M,+,M,+,\ldots$ and $M,M,+,+,M,M,+,+,\ldots$ are completely different microscopic arrangements, yet can converge to exactly the same Young measure as the microscale tends to zero; a fixed-lag correlation spectrum is introduced as a first attempt, but the document explicitly acknowledges that it still cannot capture a lag of the same order as the microscale itself. It formally hands off to C5-C, Temporal Correlation Defects, Transition Measures, and Causal Pulse Ordering, listing 8 specific proof targets (transition-pair measures, intrinsic microscale, two-scale Young states, operator compensation period, middle/operator causal order, concentration-state transition, pressure phase, and limit-cycle compatibility).
[document] 39 / C5-C: Temporal Correlation Defects, Cross-Curvature Transition Measures, and Causal Pulse Ordering
C5-B left a clear gap: the Young measure knows phase proportions but not their order — $M,+,M,+,\ldots$ and $M,M,+,+,\ldots$ can share the same local Young distribution. C5-C no longer works with fixed-lag statistics alone, and returns directly to the genuine strain energies $E_0=\tfrac12\|S\|_2^2$, $E_1=\tfrac12\|S\|_{\dot H^1}^2$. The strain identity $E_0'+2\nu E_1=a(t)$ ($a=-2\int\det S\,dx$), combined with C4-H's pointwise matrix inequality $a\le m$ (the middle-strain load), defines the middle slack $q=m-a\ge0$, giving the exact identity $m=E_0'+2\nu E_1+q$. Along record-window normalized time, four cumulative paths are defined — supply $C_j(s)$, strain-dissipation demand $D_j(s)$, middle slack $Q_j(s)$, and $E_0$-record displacement $R_j(s)$ — and the document proves the exact middle cumulative ledger (Theorem 7.1): $C_j=R_j+D_j+Q_j$ holds for all $s$, all four paths are monotone and bounded, and Helly selection gives compactness. C5-C.2, the Middle Supply-Deficit Budget (Theorem 13.1), proves that the portion by which demand exceeds supply has a hard budget upper bound, $\int[d_j-c_j]_+ds\le1-\alpha_j^{mid}$ — demand cannot stay ahead of supply for long without paying for it via a negative change in $E_0$; the total deficit budget is exactly the share of the middle load that failed to become recorded $E_0$ growth. On the operator positive/negative growth side, an exact BV record path $G_j(s)=C_j^+(s)-C_j^-(s)$ is built, proving Operator BV Compactness (Theorem 22.1) and defining the Operator Variation-Cancellation Defect, which quantifies the microscopic variation that cancels itself out within the BV limit. The round's core result is the Cross-Curvature Variation Identity (Theorem 27.1): differentiating the demand rate $d_j(s)$ gives exactly $Dd_j=\kappa_j^{MO}(\mu_j^{op,+}-\mu_j^{op,-})$, and remarkably $\kappa_j^{MO}=\operatorname{Var}_{[0,1]}d_j$ holds exactly — the operator's positive/negative growth phase is not an arbitrary temporal label; it is exactly the source of convexity/concavity of the normalized strain-dissipation demand rate: $O^+$ is exactly the source of $d_j$'s convexity, $O^-$ exactly the source of its concavity. Taking a subsequence of the cross-curvature number $\kappa_j^{MO}$ can only land in one of three states: C-K0 (vanishing, the demand rate weakens to a constant), C-KF (finite and nonzero, giving a bounded-variation transition closure, though it may still leave a positive curvature-variation defect, meaning finite-scale rapid switching that cancels itself out in the limiting rate), or C-K∞ (curvature congestion, variation diverging — precisely the normalized curvature profile of C5-B's operator-phase measure under this state). Fixing an upper bound on the number of amplitude crossings $N_j^{a\uparrow b}\le\kappa_j^{MO}/(b-a)$ further quantifies the number of transitions under bounded curvature. Combining the supply/demand/operator-sign tri-tagged measure, the document proves Anti-Phase Growth Causes Negative Enstrophy Drift (Theorem 40.1): if positive operator growth occurs while the middle supply is clearly below the dissipation demand, this forces $E_0'<0$ exactly. But the round's most important honest conclusion is a no-go (§45-48, the Scalar Temporal Ordering No-Go): the document explicitly constructs an abstract scalar ledger (a piecewise-linear demand rate $d(s)$, with supply $c(s)$ completely separated into the first and second halves) that simultaneously satisfies a positive final $E_0$ record drift, positive operator-demand acceleration, exact middle/operator temporal separation, and the exact cumulative ledger — proving that relying solely on the scalar $E_0$/$E_1$ identities still fully permits a separated compensation cycle $O^+\to M$, or in reverse $M\to O^+$; it explicitly states that this does not prove N-S genuinely realizes such a pattern, only that the scalar temporal identities by themselves are not enough to exclude it. The document therefore formally declares that the returns on the purely temporal, purely scalar level have been exhausted, and hands off to C5-D, Spatial–Matrix Motif Compatibility: Strain Cones, Quadratic Barycenters, and Pressure Defects, whose task is to place the strain cone, the quadratic-tensor barycenter, the pressure-matrix direction, the seven-point witnesses, and the temporal phase all into the same recurrent limit.
[document] 40 / C5-D: Spatial–Matrix Motif Compatibility, Strong-Middle Cones, and Quadratic/Pressure Convex-Hull Obstructions
C5-C proved that the scalar $E_0/E_1$ identities alone are not enough to exclude temporal compensation cycles. C5-D formally leaves the purely temporal, purely scalar route, and places the positive middle-strain direction, the local quadratic tensor $Q=S^2+\tfrac14\omega\otimes\omega-\tfrac14|\omega|^2I$, C4-J's seven-point cancellation witnesses, the local adjoint-core pressure mean, the shared far-field harmonic pressure matrix, and C3-S's convex-hull pressure geometry, all into the same finite-dimensional spatial-matrix problem. For a normalized (trace-free, Frobenius norm 1) strain direction $K$ with middle eigenvalue $k_2>0$, it defines the strong-middle shape parameter $\theta_K=k_2k_3=k_1^2-\tfrac12>0$, and the compressive-axis test tensor $H_K=e_1\otimes e_1-\tfrac{1+\theta_K}2I$ ($e_1$ being the eigenvector of the most negative eigenvalue $k_1$). The core result is C5-D.1, the Positive-Middle Cone to Quadratic Half-Space Theorem (Theorem 10.1): if the pointwise normalized strain direction lies within a strong-middle pointwise strain cone $\mathcal C_K$ of radius set by $\theta_K$ around $K$, then for any vorticity $\omega$ whatsoever (no vorticity-alignment assumption, no vorticity upper bound, no helicity-sign assumption needed), $H_K:Q\ge\tfrac{\theta_K}4(|S|^2+|\omega|^2)$ holds — so all normalized quadratic directions $Q/|Q|$ fall entirely into the same strict matrix half-space, with margin $\gamma_K=\theta_K/(4|H_K|)>0$. The round's most important result is C5-D.3, Seven-Point Zero-Barycenter Incompatibility: if the seven witness directions $U_i^\ast$ all lie simultaneously within this half-space, their convex combination cannot possibly equal zero — a direct contradiction. So a strong-middle pointwise cone and seven-point zero-barycenter cancellation cannot coexist within the same recurrent limit; the document explicitly stresses that this is the C5 series' first genuine finite-dimensional algebraic incompatibility: not a divergent norm, not an integral budget, not a temporal arrangement, but a purely finite-dimensional convex-geometric obstruction. A quantitative version (C5-D.4) further proves that even allowing some strain directions to leak outside the cone, as long as the leaking mass is not too large, the coefficient $\kappa_\chi^Q$ still has a positive lower bound; conversely, if the cancellation coefficient stays small, the leaking mass must have a positive lower bound — so for quadratic cancellation to survive, either the middle gap $\theta_K\to0$ must degenerate, or the strain direction must keep leaking out of the strong-middle cone. The document carefully distinguishes C3-S's average strain cone from the pointwise normalized strain cone used here — they are not the same object — and a bridge between them requires the relative perturbation $\eta_R^S$ to stay below a critical threshold (C5-D.5: average coherence plus small perturbation implies that seven-point cancellation is impossible on that core); if the perturbation is too large, combined with a Morrey-type estimate, cancellation instead forces a genuine higher-derivative strain-perturbation debt, connecting directly back to the derivative geometry of C3-V/W/X/Y. On pressure: once a strong-middle core holds, it excludes the cancellation branch, and C4-I's original trichotomy of cancellation, mean rotation, or pressure collapses here to just mean rotation or pressure concentration (C5-D.6/7, Oriented Pressure Re-entry). If multiple cores share the same harmonic far-field pressure matrix $F_\ast$, the test direction simplifies to the compressive-axis projection $G(e)=e\otimes e-\tfrac13I$, and C5-D.8, the Compressive-Axis Convex-Hull Pressure Obstruction (Theorem 40.1, an exact Carathéodory argument), proves that if zero lies within the convex hull of $\{G(e_i)\}$, then no single common $F_\ast$ can compensate all the cores simultaneously — because $\dim\operatorname{Sym}_0(3)=5$, at most six cores are needed to witness this; more simply, three mutually orthogonal compressive axes already directly give a zero barycenter (the Orthogonal-Triplet Pressure Obstruction, C5-D.9). The round concludes with a bidirectional cycle: a strong-middle cone implies a quadratic half-space, which excludes seven-point cancellation, which forces mean rotation or pressure re-entry, which, if a far-field pressure is shared, brings in compressive-axis convex-hull constraints; conversely, quadratic cancellation implies either middle-gap degeneration or directional dispersion. It formally hands off to C5-E, Strain-Direction Defect Measures, Middle-Gap Degeneration, and Derivative-Intermittency Closure, with 8 proof targets focused on the exact compactification of the strain-direction measure, middle-gap mass, directional-dispersion defect, and the interface with the derivative gate.
[document] 41 / C5-E: Strain-Direction Defect Measures, Middle-Gap Degeneration, and Derivative-Intermittency Closure
C5-D compressed seven-point cancellation into two escape routes: middle-gap degeneration, or strain-direction dispersion. C5-E is not content to leave these as mere names, and instead asks what measurable derivative/intermittency debt each actually corresponds to. C5-E.1, Middle-Gap Equivalence, first proves that the normalized gap variable $\vartheta(S)=\lambda_2^+\lambda_3/|S|^2$ and the normalized middle eigenvalue $\xi_2=\lambda_2^+/|S|$ are quantitatively equivalent ($\sqrt2\,\vartheta\le\xi_2\le\sqrt6\,\vartheta$) — middle-gap degeneration is genuine degeneration of the middle eigenvalue, not an arbitrary statistic. C5-E.2 proves that if $\vartheta(S)\ge\delta$, then pointwise $|Q|\gtrsim_\delta|S|^2+|\omega|^2$ — a Q-weighted gap concentration is a genuinely physical concentration of quadratic activity, not an artifact of matrix normalization. Building a compactification of the joint strain-direction/gap state, C5-E.3 proves that if the seven-point barycenter tends to zero, the limit cannot be a point mass concentrated on a single non-degenerate strong-middle direction (a direct contradiction from C5-D's cone theorem). C5-E.4, Quantitative Direction Anti-Concentration, gives a further quantitative statement: if the middle-gap mass is small, cancellation forces the strain-direction probability to be unable to concentrate within any single strong-middle cone, giving a genuine lower bound on directional variance. To convert direction leakage into a physical stock, C5-E splits the leaking region exactly into a strain-borne branch and a vorticity-dominant branch (according to the relative size of $|S|^2$ versus $\eta|Q|$); C5-E.5, the Leakage to Derivative or Vorticity Dichotomy, proves that the strain-borne branch, via a weighted Poincaré inequality, forces a genuine strain-derivative $L^2$ stock $\mathfrak H_R\gtrsim a_R^Q$, while the vorticity-dominant branch forces a genuine critical vorticity stock $\mathfrak W_R\gtrsim a_R^Q$ — C5-E.6, the Q-Cancellation Spatial Debt Trichotomy: under non-degenerate local quadratic intensity, sustained small-barycenter cancellation must take at least one of middle-gap defect, strain-derivative fluctuation, or vorticity-dominant leakage. The middle-gap route is likewise not free: C5-E.7, Middle-Gap Load Forces Cubic Strain, proves that if the gap set bears a non-degenerate middle load $M_\delta$, then $\int|S|^3\gtrsim M_\delta/\delta$ — as $\delta\downarrow0$, the cubic strain norm must diverge. Combined with the interpolation inequality $\|S\|_3\le C\|S\|_2^{1/2}\|\nabla S\|_2^{1/2}$, this yields a genuine derivative lower bound. C5-E.8, the Effective Active-Set Lemma (a Chebyshev argument), defines an effective cubic amplitude and effective volume, proving that a large $\|S\|_3^3/\|S\|_2^2$ guarantees the existence of a small-volume set carrying at least a $1-c$ fraction of the cubic strain activity — this is exactly strain-amplitude intermittency; C5-E.9 further proves that if the middle gap continues to bear a non-degenerate load while the strain $L^2$ stock stays bounded, the effective volume fraction must collapse to zero, connecting back to C3-W's volume-to-line geometric lemma and pushing the active set toward finer sparse scales. The round's single most important honest boundary is C5-E.10, the Derivative-Intermittency Pre-Gate: the document explicitly points out that the published Grujić–Xu theorem (2024, J. Math. Fluid Mech.) requires sparseness of the component/sign superlevel sets of the raw derivatives $D^ku$ or $D^k\omega$, whereas what C5-E currently produces is intermittency of strain amplitude/derivatives — a genuine field-conversion interface gap still separates the two (§37 explicitly warns that a sparse set of high strain values does not automatically imply sparseness of every related raw derivative component/sign high-value set; vorticity is the antisymmetric part of $\nabla u$ and must be handled separately). Five outstanding interface items (field conversion, threshold alignment, global/local set scope, temporal gating, derivative-chain hypotheses) are listed as an open interface, not as a closed regularity gap. The round closes by noting that C4-J's originally free seven-point cancellation motif, after C5-D and C5-E, has now been fully converted into a genuine PDE field defect — Q implies middle-gap/cubic-intermittency, strain-derivative fluctuation, or vorticity leakage, no longer a free compensation motif. It formally hands off to C5-F, Strain/Vorticity Defect Coupling, Axis Locking, and Derivative-Gate Escalation, with 8 proof targets addressing the coupling of gap degeneration with compressive-axis locking, the interface between vorticity leakage and Miller orthogonality, and whether the derivative order is forced to escalate.
[document] 42 / C5-F: Compressive-Axis Robustness, Pressure-Signature Locking, and Derivative-Gate Escalation
C5-E has already translated seven-point cancellation entirely into three PDE field-defect routes. C5-F asks a more refined question: does middle-gap degeneration also wipe out C5-D's compressive-axis pressure geometry along with it? Does the direction dispersion that cancellation genuinely requires only need the other two eigenvectors to rotate, leaving the most-compressive axis fixed? And can a shared far-field pressure instead lock the compressive axis in place, forming a second finite-dimensional incompatibility with cancellation? C5-F.1, Uniform Compressive Spectral Gap, first proves that the normalized strain in the entire positive-middle sector (including the gap boundary) has a uniform spectral gap $k_2-k_1\ge1/\sqrt2$ — the most-compressive eigenvalue is everywhere simple, so a standard finite-dimensional spectral-perturbation estimate then gives C5-F.2, the Middle-Gap Limit Preserves the Compressive Axis: gap degeneration only pushes the strain shape toward the degenerate boundary $(-1/\sqrt2,0,1/\sqrt2)$, and does not erase the compressive-axis projection $G(e_1)$ — the middle-gap route therefore remains coupled to the pressure-axis geometry. It then proves the quadratic half-space theorem in both a fixed-axis version (C5-F.3) and an axis-cap version (C5-F.4): as long as the gap is non-degenerate and the compressive axis lies within a projection cap of radius set by the gap, even allowing the other two eigenvectors to rotate arbitrarily, all quadratic directions still fall into the same strict half-space. C5-F.5, Nondegenerate Q Cancellation Forces Axis Anti-Concentration, is therefore stronger than C5-E's result: what seven-point cancellation genuinely requires is dispersion of the compressive axis itself, not merely dispersion of the full strain direction — letting only the other two eigenvectors rotate freely while holding the most-compressive axis fixed can never produce a zero barycenter. On pressure: a harmonic far-field pressure matrix admits only two non-degenerate inertia types — a single negative eigenvalue $(-,+,+)$ or a double negative eigenvalue $(-,-,+)$. The round's headline result, C5-F.6: if the shared far-field pressure signature is $(-,+,+)$ and the negative-direction compensation margin is strong enough, it locks the compressive axis into a projection cap; if this cap is narrower than the scale of dispersion that cancellation requires, the two cannot coexist within the same recurrent limit — this is the C5 series' second finite-dimensional algebraic incompatibility, finer than C5-D's original result, because it does not need to lock the full strain direction, only the compressive axis itself, and it supplies an explicit marginal criterion threshold. Conversely, the double-negative signature $(-,-,+)$ does not force a single axis-cap lock (the negative eigenspace is two-dimensional, so the axis can still disperse significantly within it) — so a pressure survivor that is to coexist with non-degenerate-gap cancellation must escape toward a weak margin, a double-negative signature, a degenerate signature boundary, a split pressure source, or mean rotation. On vorticity-dominant leakage, a Hölder argument forces a genuine $\omega\otimes\omega$ $L^2$-congestion lower bound, which an orthogonal projection then splits into either Miller-operator orthogonal congestion (connecting back to the growth-direction orthogonality) or constrained-complement congestion (explicitly stated to not be the true pressure Hessian, only a provisional placeholder that will need to be jointly analyzed in future work alongside strain-squared, advection, and the genuine pressure). Strain-derivative leakage gives a genuine critical pointwise second-derivative-amplitude lower bound, $R^3\|D^2u\|_\infty/\nu\gtrsim1$, but amplitude is not the same as sparseness of component/sign superlevel sets — this hard rule is retained. The document compares the spatial sparseness exponent of middle-gap cubic intermittency ($2/3$) against Grujić–Xu's fixed-$k=1$ direct regularity scaling exponent ($3/5$); since $2/3>3/5$, this is formally favorable — but it immediately warns that $\nabla u$ contains vorticity, so the raw high-derivative-value set must be covered by the union of the high-strain-value set and a vorticity high-value defect set (C5-F.9, the Field-Conversion Dichotomy), so this is only a scale-favorable conditional interface, not a theorem application. C5-F.10, Fixed-Order Recurrence or Derivative-Order Escape (a pure natural-number-subsequence dichotomy), explicitly states that repeated failure at a fixed order does not by itself imply that the derivative order must escape to infinity — only once every fixed-order recurrent defect has been separately excluded is the research line entitled to formally advance to the asymptotic critical boundary $k\to\infty$, and even that boundary is itself not a contradiction — every generation may still fail on component/sign conversion, late-time analyticity, the derivative chain, or a spatial-support mismatch. It formally hands off to C5-G, Pressure-Signature Defects, Vorticity Constraint Complements, and Fixed-Order Derivative-Gate Closure, with 8 proof targets.
[document] 43 / C5-G: Pressure-Signature Defects, Vorticity Constraint Complements, and Fixed-Order Derivative-Gate Closure
C5-F compressed the residual network into four items: pressure-signature defects, vorticity-constraint-complement defects, fixed-order derivative-gate defects, and asymptotic-critical-order escape. C5-G prioritizes killing the fixed-order direct gate first, making a cleaner move: instead of routing through strain/shell transforms, it puts a global volume upper bound directly on the super-level sets of all components/signs of the raw $D^ku$. **C5-G.1 Direct Component-Volume Bound** (Chebyshev) proves $|V_{\lambda,k}^{\zeta,i,\pm}|\le\lambda^{-2}L_k^2/A_k^2$ holds uniformly for all component/sign combinations, with no strain/rotation decomposition, no shell-to-full-field conversion, and no need to guess which component first. Combined with C3-W's volume-to-line geometry lemma, this yields a theorem-ready 1D sparseness scale $r_{vol,k}\sim L_k^{2/3}A_k^{-2/3}$, which is compared directly against the true direct scale $r_{GX,k}$ of the published Grujić–Xu (2024, J. Math. Fluid Mech.) Theorem 3.5, defining the ratio $\mathfrak G_k^{dir}=r_{vol,k}/r_{GX,k}$. **The round's headline result, C5-G.3 Fixed-Order Direct Gate Closure Theorem**: if $\mathfrak G_k^{dir}(s)\le1$ at the theorem's admissible later time $s(t)$, then Theorem 3.5's spatial hypothesis genuinely holds, and $T_\ast$ is not a blow-up time — this is not a pre-gate; it is the first genuinely theorem-ready closure interface in the entire NS series. The old COMPSIGN (component/sign guessing) and SHELLFULL (shell-to-full-field) defect labels are thus formally bypassed along this direct-volume route, leaving only two items in the fixed-order residual: effective-volume (multiplicity) diffuseness and later-time misalignment. The exact $k=1$ form gives a gate between strain enstrophy and the raw gradient peak, $\|S\|_2^2\le C\|Du\|_\infty^{1/5}$, but the exponent $1/15$ is small, showing that although $k=1$ is already theorem-ready, genuinely closing it still needs very strong peak concentration; the general fixed-$k$ amplitude exponent $(4k-3)/(3(2k+3))$ approaches $2/3$ as $k$ grows, showing that higher derivative orders carry stronger leverage, but $L_k$ may grow in step as well, so this is not an automatic order-escalation closure. On the pressure-signature side: **C5-G.4/5** prove that if the joint far-field pressure-matrix signature (one-negative/two-negative) keeps switching while strong heredity holds (the relative change between adjacent matrices tends to zero), it must force the zero-determinant boundary $d_{\rm sig}\to0$ — giving a clean pressure-signature trichotomy (signature fixed ∨ signature-boundary defect ∨ pressure flip/source splitting). On the vorticity-dominant-leakage side: using the exact pressure-Poisson identity $\Delta p=-|S|^2+\tfrac12|\omega|^2$, **C5-G.6** proves that on the vorticity-dominant leakage set, pointwise $\Delta p>0$ — a genuine
[document] 44 / C5-H: All-Order Effective-Volume Defects, Spectral–Multiplicity Ladders, and Asymptotic-Critical Compatibility
C5-G obtained the first theorem-ready fixed-order direct gate. C5-H asks: if a hypothetical survivor keeps $\mathfrak G_k^{dir}>1$ at every fixed $k$, can a purely volume-based argument push this all the way to $k\to\infty$ to force a contradiction? The answer is no — and not only does the fixed-order direct route fail, so does the asymptotically favorable chain route, on pure volume alone. First, an honest theorem audit: the spatial scale in Grujić–Xu's (2024) Theorem 3.5 carries a $2^{-k}$ factor, and the admissible later-time window carries a $4^{-k}$ factor — this is an exponential penalty built into the published theorem itself, not a product of C5's methodology. An explicit purely illustrative smooth single-scale analytic wave-packet model is constructed (explicitly stated to be not an N–S counterexample, only an illustrative no-go): **C5-H.1 All-Order Direct-Gate No-Go** proves that even for the most favorable smooth, single-scale data, the coarse volume certificate still forces $\mathfrak G_k^{dir}$ to diverge exponentially in $k$; §8 further proves the admissible time window itself undergoes exponential Zeno-type contraction, which cannot be made to vanish simply by raising the order. To study the all-order spectral ladder, the $L^2$ Fourier moment $M_k=\||\xi|^ku\|_2^2$ is introduced, and **C5-H.2** (Cauchy–Schwarz) proves $M_k^2\le M_{k-1}M_{k+1}$, forcing the spectral frequency $\Lambda_k$ to be monotonically increasing. But then comes the round's central no-go: using the Agmon inequality to decompose the effective volume exactly into
[document] 45 / C5-I: Derivative Sign-Geometry Defects, Chain Sections, and Harmonic-Measure Compatibility
C5-H formally declared the static all-order effective-volume closure scheme dead; C5-I is the first round to treat component/sign one-dimensional micro-geometry as the primary object, rather than an appendage of volume geometry. It faithfully encodes the exponentially separated derivative sections of Grujić–Xu's Definition 3.15, the section maxima $m_i$, and Type-$\mathcal A$/Type-$\mathcal B$ strings. It defines the exact 1D chord occupancy rate $b_E(x_0,r,[\nu])$ and the best directional occupancy $\beta_E=\inf_{[\nu]}b_E$ — Theorem 3.14's spatial passage condition is precisely
[document] 46 / C5-J: Line-Section Sign Processes, Order-Sandwich Coupling, and Harmonic Critical Saturation
C5-I preserved only the chord occupancy rate $b_k([\nu])$, without knowing whether the sign-thick set is actually one long interval, a few islands, or heavily fragmented. C5-J's question: can fragmentation itself create a new harmonic escape? The answer is no. **C5-J.1 Fragmentation-Neutral Harmonic Lower Bound** proves that Solynin's extremal theorem needs only the total measure of the chord complement — whether the active set is one interval, finitely many pieces, or a highly fragmented measurable set, as long as the complement measure stays $\ge2(1-\beta)$, the harmonic-measure lower bound $h(\beta)$ holds — fragmentation cannot make the harmonic-measure lower bound any worse than the pure-occupancy bound. **C5-J.2** likewise proves that C5-I's descent estimate depends only on the total length of the same-sign high-value set, so fragmentation position does not affect the descent cost. But fragmentation is not free: it forces repeated threshold crossings along the chord, and such crossings are exactly the variation of the next-order derivative. Using dual-threshold hysteresis counting ($\lambda_0<\lambda_1$, to avoid threshold-noise artifacts) to define a robust high-value island count $N_k$, each interior gap costs at least a fixed total variation $2(\lambda_1-\lambda_0)A_k$, and since total variation is bounded above by $|f_k'|\le C_DA_{k+1}$, **C5-J.3** forces $A_{k+1}\ge\frac{(\lambda_1-\lambda_0)(N_k-1)}{C_Dr_k}A_k$ — fragmentation genuinely pays upward to the next order. The round's most elegant result is multiplying this upper-order cost by C5-I's lower-order cost $A_{k-1}\ge\kappa_{\lambda,\delta}r_kA_k$: the chain-scale radius $r_k$ cancels exactly, giving a dimensionless three-order derivative sandwich inequality $A_{k-1}A_{k+1}/A_k^2\ge c_{\lambda_0,\lambda_1,\delta}(N_k-1)$ (**C5-J.4**), which converts into Grujić–Xu's own normalized chain-root notation (the normalization constants likewise cancel exactly, **C5-J.5**). Defining the log chain curvature $Y_k=(k+1)\log\mathcal R_k$, **C5-J.6** proves that if the fragmentation count $N_k\to\infty$, the discrete second difference $\Delta^2Y_k\to+\infty$ — unbounded fragmentation cannot coexist with a locally flat/affine chain-root log profile, and must force a sharp order-space convexity event. Separately, defining the dimensionless line roughness $\mathfrak U_k=r_kA_{k+1}/A_k$, it is shown that the fragmentation count is bounded by the roughness bound: **C5-J.7**, if $\sup_k\mathfrak U_k<\infty$, the normalized line profile $\psi_k$ is equi-Lipschitz, and Arzelà–Ascoli gives a genuinely continuous limiting profile, generalized to the full angular chord process $\Psi_k(\nu,s)$ compactifying likewise on $S^2\times[-1,1]$ (**C5-J.9**). C5-J.10 Bad-Core Line-Process Dichotomy closes the round: every recurrent chain-scale sign-thick bad core, after passing to a subsequence, can only be one of a compact hysteretic sign core (bounded roughness) or upper-order-derivative roughness ($\mathfrak U_k\to\infty$) — fragmentation is thus completely absorbed into the derivative-chain metadata, and is formally removed from C5's survivor list; it is no longer an independent category. Line micro-geometry ultimately compresses to just four states: harmonic passage, compact critical core, upper-order roughness, and strong sign-thickness. The most important honest boundary (§49–55) continues and sharpens C5-I's rule: all the new inequalities (descent, fragmentation's upper-order cost, the three-order sandwich) are same-time, but the published theorem uses different admissible later times at different derivative orders, so same-time sandwiches cannot be directly stitched across orders — explicitly defining a
[document] 47 / C5-K: Chain-Time Stitching, Window-Persistent Sign Defects, and Dynamic-Interpolation Closure Audit
C5-I/J left one hard rule: different derivative orders use different admissible later times in the theorem, and same-time inequalities cannot be multiplied across orders unconditionally. C5-K re-audits Grujić–Xu's Theorem 3.14 and Lemma 3.16/3.17 faithfully, and arrives at the round's most important self-correction:
[document] 48 / C5-L: Persistent Bad-Window Rigidity, Chain-Clock Defect Measures, and Root-Turnover Compression
C5-K compressed the genuine high-order spatial survivors into four categories: window-persistent sign defects, chain-clock separation, in-window root reversal, and theorem-setup defects. C5-L attacks them one by one, killing off most of the freedom in three of the four. **C5-L.1 Carrier-Relay Quotient Theorem**: for an arbitrarily chosen bad carrier $x_k(s)$ at every moment inside the window (no assumption of a continuous selection), the right-hand side of C5-I's descent bound $A_{k-1}(s)\ge\kappa_{\lambda,\delta}r_k(s)A_k(s)$ does not contain $x_k(s)$ at all — no arbitrary bad-carrier transfer can remove the descent strip; carrier identity can be quotiented out at the amplitude-chain level (though it still matters for questions like spatial compactness, causal lineage, or shared-core pressure geometry — C5-L does not invent a new
[document] 49 / C5-M: Unified Defect-State Closure, Compatibility Graph Audit, and C5 Phase Boundary
C5's task was never to find yet another magic inequality, but to turn C4's recurrent compensation motifs into compact recurrent states, and then route the apparently different escapes into debts. This round performs only a phase-closure audit and introduces no new estimates. Core conclusion: C5 should close as a research phase, but Navier–Stokes global regularity remains open. After listing the external theorem gates used throughout C5 (Miller's middle-eigenvalue gate, Miller's strain–vorticity operator gate $\langle-\Delta S,\omega\otimes\omega\rangle=0$, Grujić–Xu's fixed-order direct gate Theorem 3.5, Grujić–Xu's chain gate Theorem 3.14, and the Bradshaw–Tsai/Constantin pressure gate), all the recurrent survivor states encountered across C5-A through L are encoded into a six-letter residual alphabet $\mathfrak D_{C5}=\{\mathsf A,\mathsf T,\mathsf G,\mathsf P,\mathsf H,\mathsf F\}$: $\mathsf A$ legality/lineage/theorem-setup (explicitly stated to be a proof-entry legality defect, not a physical singular mechanism); $\mathsf T$ temporal-phase defects (Young oscillation, load concentration, separated scalar compensation periods); $\mathsf G$ field-geometry degeneracy (middle gap, compression-axis dispersion, strain-derivative fluctuation, vorticity leakage, cubic intermittency); $\mathsf P$ pressure compensation/provenance (mean rotation, pressure concentration, far-field signature, zero-determinant boundary, source splitting/flipping, axis locking); $\mathsf H$ high-order harmonic/theorem-window defects (fixed-order gate failure, window-persistent sign defect, harmonic–temporal critical saturation, persistent bad clusters); $\mathsf F$ forcing/order-variation debt (viscous/projected-nonlinear reversal, order curvature, chain-clock variation, theorem-constant drift). Nine pseudo-defects are formally struck from the list of independent nodes: free seven-point cancellation, generic line fragmentation, generic Type-A/B switching, generic root reversal, generic clock mismatch, amplitude-level carrier transfer, isolated large operator norm, isolated vorticity-constraint complement, and static all-order effective-volume escalation — all now routed into the six classes or into an external regularity gate. A certified compatibility graph is built, tagged (unconditional U, conditional C, external-theorem closure E), detailing the routing relations among the six classes (e.g. $\mathsf H\to\mathrm{REG}$ via the published theorem, $\mathsf F\to\mathsf H$ via viscous congestion pushing activity to higher order, $\mathsf G\to\mathsf P$ via strong middle coherence forcing pressure return). Finite Recurrence Principle: since the residual alphabet is finite, any infinite sequence of hypothetical survivor labels must have some class recur infinitely — a purely combinatorial but genuine pigeonhole argument, resting on the substantive result that the alphabet really is finite. If the compatibility graph is complete for some survivor path, its condensation graph of strongly connected components is finite and acyclic, so any infinite path must eventually fall into some sink SCC after a finite transient — C6's genuine object is the recurrent sink SCC/minimal recurrent defect cycle, not a new isolated defect node. Three unexcluded candidate recurrent cycles are flagged: the high-order forcing cycle $\mathsf H\leftrightarrow\mathsf F$ (persistent bad theorem window → descent/load cost → viscous/nonlinear/clock debt → activity pushed to higher derivative order → the new window fails again — C5 currently has no finite all-order budget to exclude this, possibly the hardest candidate sink); the geometry–pressure cycle $\mathsf G\leftrightarrow\mathsf P$; and a possibly isolated temporal cycle $\mathsf T$ (removing this candidate SCC would need a generic theorem for a common $\mathsf T\to\mathsf G/\mathsf P/\mathsf H$ source, currently open). The most important honest boundary: a finite defect graph does not imply global regularity — the graph may still contain directed cycles, compactness does not eliminate cycles, and debt routing without a finite-additivity theorem does not itself yield a contradiction. Six-Class Closure Theorem: under the current C3/C4/C5 rules and the conditional-lineage framework, every recurrent survivor state encountered in C5-A through L can be encoded into these six classes plus compact metadata within each class, with no mechanism requiring a seventh independent residual class — C5's state-space/motif-compactification task is structurally complete; this is the closure of a research phase, not the closure of a PDE proof. Formally declares C5 — Recurrent Motif Limits, Defect Measures, and Compensation Compactness status PHASE CLOSED, PDE status GLOBAL REGULARITY OPEN, and hands off to C6 — Minimal Recurrent Defect Cycles, Sink-SCC Extraction, and Cross-Domain Closure, opening with C6-A, whose task is to extract the genuine sink strongly connected components and determine whether their debt can be paid indefinitely.
[document] 50 / C6-A: Certified Defect Graph, Typed Cycle Composition, and Minimal Survivor Candidates
C6 formally launches, with its task shifting from C5's state construction + compactification + debt routing to cycle extraction + cycle compatibility + cycle elimination. This round's first goal looks simple — performing SCC extraction on C5-M's finite defect graph — but an important correction surfaces immediately: an ordinary label-level SCC does not by itself prove a PDE recurrent cycle, because a coarse edge may hold only for a subtype, an edge may carry extra metadata, two individually valid edges need not actually connect end to end, a
[document] 51 / C6-B: High-Order Forcing Re-entry, Bad-Window Regeneration, and the H/F Cycle Test
C6-A's conclusion was that a projected SCC does not imply a composable PDE recurrent cycle; for the $H\leftrightarrow F$ that appears to exist on C5-M's coarse may-graph, C6-B formally tests the reverse edge $F\overset{?}{\Rightarrow}H$. The first step splits C5's forcing class into $F_{\rm visc}^{\downarrow}$ (viscous/decay-side reversal) and $F_{\rm NL}^{\pm}$ (projected nonlinear forcing that may either stabilize or amplify a chosen peak) — C6-B.1 (applying the maximum principle $\Delta f(x_\ast,t)\le0$ at the signed spatial maximum) proves $D^+A_k\le\mathcal N_k^{proj}$, so viscosity by itself cannot be the engine of forward derivative-peak regeneration, and C6-B.2 Viscous Half-Cycle Elimination therefore removes $F_{\rm visc}^{\downarrow}$ from the list of forward $H$ re-entry engines, leaving only $F_{\rm NL}^{+}$ as a possibility. But even if the Duhamel capacity $\mathfrak C_\ell^{Duh}$ of the projected nonlinear forcing is large, C6-B.3 Duhamel-Capacity No-Go (via a construction using a compactly supported abstract test field vanishing at both endpoints) proves that capacity alone cannot logically lower-bound the genuine response — an explicit Duhamel coherence coefficient $\Gamma_\ell^{Duh}=\|Z_\ell\|_\infty/\mathfrak C_\ell^{Duh}\in[0,1]$ must be kept, and it can equal $0$ even while capacity is $>0$. Even if the response peak genuinely is large, C6-B.4 Amplitude-to-Sign-Thickness No-Go (using a fixed bump function rescaled as $\phi_N(x)=\phi(Nx)$ as a witness) proves that peak amplitude alone does not determine the component/sign chain-scale thickness geometry — the same sup norm can carry arbitrarily different sparse/thick geometries. The coarse edge $F_{\rm NL}\to H$ must therefore be refined into a six-link chain: $F_{\rm NL}\to R_{\rm amp}\to R_{\rm select}\to R_{\rm sign}\to R_{\rm setup}\to R_{\rm persist}\to H$. The positive half: C6-B.5 One-Time Sign-Reentry Lemma proves that if the response itself genuinely is sign-thick on some set, the inherited heat part $\|Y_\ell\|_\infty\le\epsilon A_Z$ is small enough, and the threshold margin is strict ($\lambda_Z-\epsilon>\lambda(1+\epsilon)$), then the genuine derivative field really does inherit the same thick set at that instant; C6-B.6 Sign-Thickness Persistence Lemma proves that as long as the temporal perturbation $\Theta_\ell(s,t_\ast)$ is small enough relative to the margin $m$ ($(1+\lambda)\Theta_\ell<m$), this thick set survives into nearby moments; combined with component-selection coherence ($m_{\rm sel}>0$, ensuring the theorem still selects the same component), theorem-setup legality, and persistence over the whole admissible window, C6-B.7 Conditional Nonlinear Re-entry Theorem proves that the genuinely valid edge is $F_{\rm NL}^{coh}\overset{C}{\to}H$, a conditional implication with six premises, not a coarse $F\to H$ — no current C5/C6 result can automatically supply these six premises from scalar forcing metadata alone. Net result: the coarse generic $H\leftrightarrow F$ cycle flagged by C6-A is formally ruled dead (not merely
[document] 52 / C6-C: Nonlinear Duhamel Coherence, Sign-Reentry Efficiency, and Cycle-Critical Saturation
C6-B cut the coarse $H\leftrightarrow F$ down to $H_{\rm force}\to F_{\rm NL}^{+}\overset{\text{coherence+sign+setup+persistence}}{\dashrightarrow}H_{\rm force}$; C6-C formally opens up that middle dashed edge, asking whether these re-entry coherence gates can stay non-degenerate simultaneously over infinitely many generations. The first exact result (C6-C.1) exactly factors the Duhamel coherence: $\Gamma_\ell^{Duh}=\chi_\ast^{target}\gamma_\ast^{time}$ — future-target concentration (how much of the forcing capacity genuinely targets the same future component/location) times temporal sign coherence (whether it keeps the same sign along that target's history). A large capacity can fail along either path: missing the same future target, or reaching it with alternating signs. Pushing the response peak forward as a probability measure $\nu_\ell^{coh}\in\mathcal P([-1,1])$, C6-C.2 High-Coherence Concentration Lemma proves that high-coherence forcing aligns most of its normalized forcing capacity with a single future direction. C6-C.3 Growth Efficiency Is Bounded by Duhamel Coherence proves $\eta_\ell^{grow}\le\Gamma_\ell^{Duh}$ — genuine forward peak regeneration automatically requires non-degenerate Duhamel coherence, and arbitrarily small coherence cannot produce genuine growth. Further, if the response is required to be generated across the entire chain-scale sign-thick set $E$ (rather than cheating at a single point), C6-C.4 Thick-Target Source Coherence Theorem proves $\chi_E\gamma_E\ge\lambda_Z\Gamma^{Duh}$, hence $\chi_E,\gamma_E\ge\lambda_Z\Gamma^{Duh}$ individually — sign-thick re-entry must therefore be supported by an entire
[document] 53 / C6-D: Geometry–Pressure Cycle Composition, Provenance Compatibility, and Signature-Return Tests
C6-A's second-ranked candidate $G\leftrightarrow P$ now undergoes the same cycle-composition audit, and it immediately turns out to need even more semantic correction than $H/F$: many arrows written in C5-D/F as $G\to P$ or $P\to G$ in fact all occur at the same moment, the same spatial core, the same compression axis, and the same local/far pressure decomposition — they are not sequential edges $G_n\to P_n\to G_{n+1}$, but a same-event compatibility relation $(G,P)_n\in\mathcal C_{GP}$. A genuine recurrent cycle would still need a separate temporal return map $\Phi_{GP}:\mathcal C_{GP,n}\dashrightarrow\mathcal C_{GP,n+1}$, which C5-D/F never proved. To this end, beyond C6-A's proof-status tags (I/C/N/E), a further edge dimension $\tau_e\in\{S,D,E\}$ is added (Static same-event relation, Dynamic cross-generation transition, External closure), and C6-D.1 Static-Edge Collapse Principle proves that same-event compatibility loops should be quotiented out before SCC extraction, and cannot be treated directly as cycle edges. Tracing what $G\to P$ actually produces: strong-middle geometry (via mean-strain evolution and the mean-stability gate) gives only the total localized mean pressure Hessian $P_\chi=\int\chi\nabla^2p$, not directly a far-field pressure — a much weaker premise than the old coarse $P\to G$ axis-locking route assumed. C6-D.2 Pressure-Provenance Split Lemma uses the Bradshaw–Tsai local pressure expansion to split it into $P_\chi^{loc}+P_\chi^{far}$; an oriented response guarantees only the disjunction $P_{\rm local}^{+}\vee P_{\rm far}^{+}$ — a cycle must first choose a provenance branch, and only the far branch is entitled to use the harmonic STF-matrix signature/axis-locking mechanism; the local branch cannot borrow the far-pressure obstruction mechanism. If the far branch genuinely dominates, C6-D.3 Far-Pressure Axis-Margin Theorem gives an exact negative-quadratic-form margin on the same core's compression axis; the signature trichotomy: one-negative $(-,+,+)$ produces narrow projective-cone axis-locking (C6-D.4 proves this is incompatible at the same event with Q-zero-barycenter/seven-point cancellation — but this is only same-event incompatibility, not a
[document] 54 / C6-E: Temporal-to-Spatial Shared-Source Coupling, Isolation No-Go Tests, and the Fate of the T Trap
Of C6-A's three candidates, $H\leftrightarrow F$ has already been cut down by C6-B/C to $H_{\rm force}\to F_{\rm NL}^{+}\dashrightarrow H_{\rm force}$, and $G\leftrightarrow P$ has already been rewritten by C6-D into the hereditary joint state $(G,P)_{\rm joint}\dashrightarrow(G,P)_{\rm joint}$; C6-E formally audits the last one: $T$. C5-B/C already proved that a purely scalar temporal argument cannot by itself force same-time overlap; C6-E's question is no longer this old one, but rather: is the middle/operator temporal debt itself already the marginal of some spatial source measure? C6-E.1 Canonical Middle Spacetime Lift gives a precise, affirmative answer: the middle debt $m(t)=\int\lambda_2^+|S|^2dx$ itself naturally carries a spacetime probability measure $\Pi^M$ whose time marginal is exactly the middle-debt probability C5 already uses — the middle temporal state is itself already the marginal of a spatial source measure. C6-E.2 repeats the same construction for the operator's forward $H^1$-growth debt, using the local positive-growth capacity as the spatial density. Defining the temporal overlap $\Omega_T$ (between two time marginals) and the spacetime shared overlap $\Omega_{ST}$ (between two full spacetime measures), C6-E.4 Temporal Projection Contraction Theorem (total variation contracts under pushforward) proves $\Omega_{ST}\le\Omega_T$ — spacetime shared source is a strictly stronger condition than simultaneous occurrence in time. C6-E.5 uses an explicit abstract construction (identical time densities but spatial conditional distributions with disjoint supports) to prove that $\Omega_T=1$ can hold simultaneously with $\Omega_{ST}=0$ — a purely temporal marginal cannot logically prove a genuinely shared spatial source. If $\Omega_{ST}>0$ genuinely holds, one can build a shared middle–operator spacetime source probability $\Pi^\cap$, whose support has, at almost every point, both positive middle strain activity and positive local $H^1$ growth capacity simultaneously — strictly stronger than mere temporal overlap. Tracking the middle-gap variable $\vartheta(S)$ on the shared source, if non-degenerate mass survives, C6-E.6 Shared Directional-Cone Extraction Lemma (using compactness of the normalized strain-direction sphere together with a finite cover) forces some fixed-width directional cone to genuinely carry nonzero spacetime mass — a genuine shared strong-middle directional source. But the paper explicitly draws a boundary: this still does not give a pointwise core, mean-rotation depletion, pressure provenance, or Grujić–Xu sign geometry — it still needs additional core-scale localization (meaningful only relative to a legitimate reference scale, otherwise it routes into the legality class $\mathsf A$) and cross-generation heredity, neither of which yet exists. C6-E.7 Pure-Temporal State Completeness No-Go therefore proves: two entirely different spacetime source pairs can have identical time marginals, yet differ completely in spatial overlap, middle-gap geometry, directional concentration, core localization, and heredity — $T$ by itself does not contain enough state information to determine the physical source-coupling state; it is only a marginal label, not a complete physical state. Hence $T\overset{N}{\looparrowright}T$ as a complete physical self-cycle is formally ruled dead — the same shape of verdict as H/F and G/P — but it is not a global exclusion: the correct object becomes $TS_n\overset{\text{spacetime source heredity}}{\dashrightarrow}TS_{n+1}$. C6-E.8 Finite Temporal–Spatial Coupling Bottleneck Theorem gives a dichotomy of exactly the same type as C6-C/D: any infinite candidate must be either uniformly shared-source coherent, or approaching one of seven named boundaries (temporal-phase separation, spatial-source separation, operator-capacity cancellation/inflation, shared-middle-gap collapse — routed directly into the existing $G$ class — core-scale diffusion/multiplicity, source-heredity collapse, and scale/setup exit — routed into class $\mathsf A$). The round's most important overall conclusion: at this point all three of C6-A's original coarse candidates — $H/F$, $G/P$, $T$ — have been refined to the same form: $HF_{\rm coherent}$, $GP_{\rm hereditary}$, $TS_{\rm hereditary}$; after five rounds, no nontrivial recurrent PDE defect cycle has yet been genuinely certified, but the entire problem has been rewritten precisely into a finite number of well-defined combinatorial problems. Since all three are now individually typed into the same shape, the natural next step is no longer to keep subdividing each separately, but to try to build genuine cross-domain edges: can uniform TS coherence genuinely route into $GP$ or $HF$? Formally hands off to C6-F — Shared-Source Core Extraction, Spatiotemporal Heredity, and Cross-Domain Routing to GP/HF, with eight composition obligations (F1 reference-scale shared concentration through F8 recomputing the candidate graph).
[document] 55 / C6-F: Shared-Source Core Extraction, Spatiotemporal Heredity, and Cross-Domain Routing to GP/HF
C6-B–E have refined C6-A's three candidates into $HF_{\rm coherent}$, $GP_{\rm hereditary}$, $TS_{\rm hereditary}$; the key new object left by C6-E is the shared spacetime source probability measure $\Pi^\cap$, but temporal overlap $\Omega_T$ alone does not guarantee a genuinely shared spatial source — that needs $\Omega_{ST}>0$. C6-F's central question: if this TS shared source genuinely is uniformly non-degenerate, can it forever remain pure temporal bookkeeping, or must it genuinely enter $GP$, $HF$, or high-order forcing? C6-F.1 Shared Density Physical Domination Theorem gives a precise pointwise bridge: the same normalized shared-source density is simultaneously pointwise dominated by both the middle physical strain density and the positive local operator-growth capacity — no longer merely abstract probabilistic bookkeeping. But probability normalization by itself forgets absolute load $M_J,P_J$, so explicit absolute-load reserves $\rho_M,\rho_P$ are introduced. Via Fubini/an averaging principle, C6-F.2/3 genuinely extract the same instant $t_\ast$ and the same spatial region $E_\ast$ from the shared-core cylinder, at which both the middle strain density and the operator's positive growth capacity have simultaneous lower bounds —
[document] 56 / C6-G: Typed Cross-Domain Graph Rebuild, Joint-Node SCC Audit, and Minimal Boundary-Saturated Survivor Cycles
Once C5-M's coarse residual graph $\{A,T,G,P,H,F\}$ is projected into an ordinary directed graph, one can easily read off an apparently large $\{G,P,H,F\}$ SCC — but this is only the first layer of compression; C6-A already pointed out that a projected label SCC does not imply a composable PDE recurrent cycle. C6-B/C compressed $H\leftrightarrow F$ into the nonlinearly coherent re-entry node $HF_{\rm coherent}$, C6-D proved $G\leftrightarrow P$ is mostly same-event compatibility and quotiented it into the joint node $GP_{\rm hereditary}$, and C6-E/F proved $T$ is only the time marginal of a genuine spacetime source state, promoted it to $TS_{\rm hereditary}$, and built the first batch of typed cross-domain bridges $TS\to GP$, $TS\to HF/F/H/\mathrm{REG}$. C6-G now formally rebuilds the whole graph and redoes the SCC audit. The central tool: every edge now carries two labels — a proof status ($I/C/N/E$) and a temporal semantics ($S$ same-event static, $D$ genuinely cross-generation dynamic, $E$ external closure) — only $D$ edges can compose a dynamical recurrent SCC, and static mutual relations must first be quotiented out. The refined interior node set is $V_{\rm int}=\{TS^\circ,GP^\circ,HF^\circ\}$ (the superscript $\circ$ meaning every reserve defining that interior region is strictly positive). The currently certified/conditional cross-domain edges are only: $TS^\circ_X\overset{C,D}{\to}GP^\circ$ (given source-to-field capture + mean-rotation depletion + legitimate pressure provenance) and $TS^\circ_X\to F_{\rm OP}\vee F_{\rm DER}\to\{HF^\circ,H\vee\mathrm{REG}\}$ — but no reverse cross-domain edge is certified: $GP\not\Rightarrow TS$, $GP\not\Rightarrow HF$, $HF\not\Rightarrow TS$, $HF\not\Rightarrow GP$ — these intuitively
[document] 57 / C6-H: Critical Boundary-Face Transition Graph, Debt-Coercivity Audit, and Boundary-Cycle Elimination
C6-G compressed C6's interior graph to $\{TS,GP,HF\}$ and proved there is no certified interior SCC at all; any infinite survivor must belong to one of uniform GP, uniform HF, approaching some boundary superclass $B_\ast\in\mathfrak B$ (C6-G roughly listed ten), or the legality exit. C6-H's original task was to treat these ten boundary faces as nodes, search for $B_i\to B_j$ edges and a global finite debt, and try to eliminate a boundary SCC — but it begins with two key corrections. First: not every
[document] 58 / C6-I: Scale-Normalized Critical Debt, Capacity-at-Infinity Compactification, and Barrier-Accumulation Cycles
C6-H left behind two negative results — not every reserve going to zero qualifies as a physical node, and a finite kinetic-energy budget is structurally unable to supply a consistent cost for a scale-invariant boundary event — and proposed switching to a
[document] 59 / C6-J: Log-Scale Renormalized Defect Flow, Telescoping Potentials, and Critical-Cycle Closure Tests
C6-I proved that a fixed critical cost cannot by itself force a finite-time contradiction — it only corrected the scaling type, without providing any cross-scale directionality. C6-J formally promotes $s=-\log r$ (equivalently, the standard backward Leray time $s=-\log(T^\ast-t)$) to a genuine dynamical time, reconnecting to the Navier–Stokes equations themselves. Using the standard backward Leray coordinates ($y=(x-x^\ast)/\sqrt{T^\ast-t}$, $U=\sqrt{T^\ast-t}\,u$, $P=(T^\ast-t)p$), C6-J.1 gives the exact autonomous equation $\partial_sU+\frac12U+\frac12(y\cdot\nabla)U+(U\cdot\nabla)U+\nabla P=\nu\Delta U$ — the finite-time blow-up horizon $t\uparrow T^\ast$ becomes exactly $s\to+\infty$, so the finite-time Zeno problem in physical coordinates turns into an infinite-time dynamical-systems problem in renormalized-scale time. A fixed point $U(y,s)=U_\ast(y)$ corresponds exactly to a backward self-similar blow-up profile, while a periodic orbit corresponds to a backward discretely self-similar (DSS) scenario (scaling factor $\lambda=e^{L/2}$). Already-published Liouville-type theorems (Seregin, Chae, Chae–Wolf, Nečas–Růžička–Šverák, Tsai) do rule out a broad class of nontrivial backward self-similar profiles and locally asymptotic DSS blow-up — but the document draws a clear line: these theorems require field-level profile hypotheses, and do not automatically apply to a periodic orbit that carries only C6 defect metadata; it likewise flags explicitly that forward DSS solutions genuinely exist, so
[document] 60 / C6-K: Critical Fiber Escape, Defect-Fiber Compactness, and Profile-Splitting Closure
The Critical Fiber Escape that C6-J left behind is only a general condition — that any compact defect set visited infinitely often by a hypothetical blow-up must have an infinite critical fiber. C6-K gives the first real answer to how exactly this fiber escapes. It begins with a key methodological correction: C6-K.1 Unbounded-Fiber Profile Guard points out that the standard bounded profile-decomposition theorems cannot be applied directly to the raw blow-up sequence $U_n$, because $\|U_n\|_3,\|U_n\|_{\dot H^{1/2}}\to\infty$ — one must first extract a bounded physical critical fragment, or instead switch to a dimensionless auxiliary shape sequence; the two carry entirely different dynamical meanings. It defines a normalized critical $L^3$ probability measure $d\mu_n=|U_n|^3/M_n\,dx$ (separating the absolute mass $M_n=\|U_n\|_3^3\to\infty$ from the question of
[document] 61 / C6-L: Singular Carrier Profiles, Spectator Decoupling, and Secondary-Scale Defect Rebinding
The hardest gap C6-K left behind is: are the recurrence cores tracked by $TS$, $GP$, and $HF$ actually genuine carriers of the singular critical mass? C6-L is the first round to put singular critical mass and defect labels into the same measure-theoretic object. It defines the critical-mass probability measure $d\mu_n=|U_n|^3/\|U_n\|_3^3\,dx$, together with each defect label's own normalized carrier probability measure $\eta_n$ (constructed separately: TS from C6-F's shared-source density, GP from Q-weighted geometry, HF from the high component/sign set), and defines the visibility $\Omega_{D3,n}=1-d_{TV}(\mu_n,\eta_n)\in[0,1]$. C6-L.1 Singular-Carrier Extraction Theorem proves that if $\Omega_{D3,n}\ge\omega_0>0$, one can build a joint measure $\xi_n=(\mu_n\wedge\eta_n)/\Omega_{D3,n}$ such that any $\xi_n(B)\ge\vartheta$ simultaneously and exactly implies $\mu_n(B),\eta_n(B)\ge\omega_0\vartheta$ — the first time
[document] 62 / C6-M: Carrier Completeness, Spectral/Pressure Visibility, and Nested-Rebinding Rigidity
The question C6-L handed off was: is low carrier visibility only because the current three labels ($TS$, $GP$, $HF$) are not enough, rather than the singular mass genuinely being uncapturable? C6-M is the first round to prove that $L^3$ is not the only carrier channel. Using a Littlewood–Paley decomposition, it builds the critical spectral phase-space probability measure $d\Sigma_n(q,x)=2^q|\Delta_qU_n|^2/\sum_j2^j\|\Delta_jU_n\|_2^2\,dx$, whose spatial marginal $\sigma_n$ is the $\dot H^{1/2}$ analogue of C6-L's mass measure $\mu_n$, and defines the spectral visibility $\Omega_{DH,n}=1-d_{TV}(\sigma_n,\eta_n)$. The Spectral Singular-Carrier Extraction Theorem (C6-M.1) proves that when $\Omega_{DH,n}\ge\omega_H>0$, one can extract a carrier that simultaneously carries a defect label and a fixed fraction of the diverging $\dot H^{1/2}$ critical energy, so an $L^3$-spectator profile can still be a $\dot H^{1/2}$-visible carrier — the Labeled Spectral-Carrier Trichotomy (C6-M.2) splits each label into four classes: V33 (visible in both channels), V3 ($L^3$ only), VH (spectral only), and V0 (Strong Spectator). It then also promotes pressure to a formal carrier channel: using the Calderón–Zygmund pressure kernel it builds a directional far-field source functional, defines the pressure capacity $C_P=\int|a_P|$ and coherence $\Gamma_P=R_P/C_P$, the Pressure Alignment Identity (C6-M.3) and the aligned-source probability $\pi_P^+$, and then, taking the overlap $\Omega_{3P}^+$ with $\mu_3$, the Pressure-Coherent Singular-Carrier Theorem (C6-M.4) is the series' first pressure-channel singular-carrier extraction theorem. But the pressure side is not unlimited: the Separated Far-Pressure Capacity Bound (C6-M.5) proves $C_P^{far}\lesssim d^{-5}\|v\|_2^2$, giving quantitative pressure decoupling for a profile that is sufficiently far away (distance $d$) and $L^2$-bounded — narrowing the spectator loophole down to profiles that are near the core, insufficiently separated, or carry high-weight pressure capacity. The other half of the round attacks the sub-scale-rebinding problem left by C6-L: it proves the exact retention identity $\beta_m=\beta_0\prod_{j<m}a_j$; the Finite Loss-Count Theorem (C6-M.6) proves that the number of levels with a fixed loss rate $a_j\le1-\varepsilon$ must be finite, $N_\varepsilon\le\log(1/\beta_\ast)/(-\log(1-\varepsilon))$, and therefore, by the Asymptotically Lossless Nesting Principle (C6-M.7): an infinitely deep carrier-complete nested rebinding must be asymptotically lossless — explicitly warning that
[document] 63 / C6-N: Near-Lossless Carrier Concentration, Ancient-Profile Extraction, and Defect-Complete Rigidity
C6-M left
[document] 64 / C6-O: Peak-Scale Defect Inheritance, Type-II Ancient Carriers, and Mass–Peak Two-Scale Closure
C6-N proved that a relative-dominant Type-II carrier must split into two layers, with the mass scale $\ell_n$ far larger than the peak-amplitude scale $a_n$. C6-O formally asks: if the entire global critical mass runs off to spatial infinity in the ancient peak frame, can the TS/GP/HF defect labels still remain in the bounded peak core? In other words, critical mass inheritance ≠ defect inheritance. C6-O.1 Peak Relative-Mass Escape Theorem uses a simple volume estimate under record normalization to prove directly that $\mu_{3,n}^{peak}(B_R)\to0$ holds for every fixed $R$ — the peak-tightness coefficient $\Theta_3^{peak}=0$: the global relative $L^3$ carrier is completely non-compact in the ancient peak frame. C6-O.2 Peak-Tight Defect / Relative-Mass Decoupling further proves: if the defect carrier genuinely remains compact in the peak frame ($\Theta_D^{peak}=1$), it must be a global relative $L^3$ spectator — so
[document] 65 / C6-P: Ancient Defect-State Classification, Record-Peak Derivative Rigidity, and Peak-Local Pressure Closure
C6-O left behind a three-scale picture: mass scale $\gg$ peak scale $\gg$ derivative scale, with a Derivative-Tower Restart triggered whenever some derivative order's amplitude diverges under peak normalization. C6-P gives a clean correction: record-peak boundedness by itself already eliminates every fixed-order derivative tower. Citing the Koch–Nadirashvili–Seregin–Šverák bounded-mild-N–S parabolic-smoothing theorem, C6-P.1 Fixed-Order Record-Peak Derivative Rigidity proves that for every fixed $k$ there is a constant $C_k$, depending only on $k,\nu$, such that $\|D^kv_n(0)\|_\infty\le C_k$, which in the original variables reads $A_{k,n}\le C_kA_n^{k+1}$. C6-P.2 Fixed-Order Derivative-Tower No-Go therefore directly overturns C6-O's hypothesis: $\widehat A_{k,n}^{peak}\to\infty$ at fixed $k$ simply cannot happen at the record peak, and C6-P.3 No Fixed-Order Subpeak Scale further gives the uniform lower bound $b_{k,n}/a_n\ge C_k^{-1/(k+1)}>0$ — no fixed order can ever produce a physical scale smaller than the peak. The only escape route still standing is the order-index itself diverging ($k_n\to\infty$), but citing the spatial-analyticity theorems of Xu and of Wang–Gao–Xue, C6-P.4 Raw High-Order Growth Is Not a Physical Tower proves that record-peak boundedness by itself already gives a uniform positive radius of analyticity, so the factorial growth of raw high-order derivatives is just an ordinary analytic baseline and cannot be read as a new physical concentration scale — a genuine high-order escape must instead use a factorially normalized root (reusing C5-H's all-order no-go technique). C6-O's three-layer tower
[document] 66 / C6-Q: Ancient Defect Rigidity, Local Growth Lift, Strain-Projection Tail Reduction, and Spatial Carrier Rebinding
The final difficulty C6-P left behind seemed to be the nonlocal tail of TS's operator channel $P_{st}$. C6-Q discovers a major correction: for the temporal $H^1$ strain-growth ledger that TS actually uses, $P_{st}$ is simply not an intrinsic spatial-carrier object at all. Using Miller's exact identity $\langle-\Delta S,\omega\otimes\omega\rangle=0$ together with $-\Delta S\in L^2_{st}$, $P_{st}$ can be removed entirely from the growth pairing; C6-Q.1 Projection-Free $H^1$ Growth Identity therefore proves that $E_1'=-\nu\|\Delta S\|_2^2-\langle(u\cdot\nabla)S+S^2,-\Delta S\rangle$ has a fully local exact spatial-density representative $g_O^{loc}$ — containing no $P_{st}$ and no singular pressure integral. C6-Q.2 Operator-Lift Nonuniqueness Guard corrects the
[branch-hub] NS-RFP
AMRAL's NS-RFP (Navier–Stokes Reverse Formation Program) sub-line: Cycle I, the earliest starting point of the whole research lineage (RFP through RKAP, eleven segments), all 12 rounds live. Defines the State/Edge/Guard/Escape/Closure formal architecture and the two ultimate obligations Chain Necessity and Finite Obstruction, formally integrates NS_O's own C3-J through C3-O series as a guard library, closes by reducing the dangerous core to a triple-divergent-action intersection, hands off to NS-CSP (Cycle II). Global regularity remains fully OPEN.
[document] RFP-01: Singularity Formation Ancestry, Legal Multiscale Chains, and Finite Obstruction Architecture
RFP series round 1, opening Cycle I. Defines the State/Edge/Guard/Escape/Closure formal architecture and the two ultimate obligations Chain Necessity and Finite Obstruction, reorganizes prior NS_O research (especially C3-O) into a guard library.
[document] RFP-02: Critical UV First-Passage Skeleton, Shell Carrier/Bypass Dichotomy, and Nonlinear Source Debt
RFP series round 2. Proves critical UV escape produces a regular nearby-scale first-passage skeleton, producing equation-level nonlinear source debt on every non-synchronous edge - Chain Necessity's first bridge.
[document] RFP-03: Dual-Witness Parent Ledger, Exact Triadic Provenance, and Carrier-Depth Escape
RFP series round 3. Uses dual normalized witnesses to construct an exact signed dyadic parent-output ledger, proves parent-cancellation/multiplicity debt and Fourier-support ancestry guards, classifies subsequence parent-gap/carrier-depth concentration escape.
[document] RFP-04: Adjoint Spacetime Tube Ledger, Pressure-Compatible Localization, and Quantitative Uniform Parent Tightness
RFP series round 4. Builds an adjoint spacetime tube refinement for the parent ledger, proves a pressure-compatible band-passed Leray commutator estimate, derives a scale-invariant quantitative tail bound, upgrades parent tightness whenever the dissipation-output budget is bounded.
[document] RFP-05: Witness Persistence, Finite Branching, Survivor Recursion, and Infinite Ancestry Path Extraction
RFP series round 5. Proves a finite-branching path-extraction theorem for thresholded witness graphs, gives an exact backward survivor recursion and a finite-horizon obstruction certificate, separates persistent infinite ancestry from bottleneck-collapse escape. Graph theory side is exact, the PDE bridge remains open.
[document] RFP-06: Inter-Edge Bridge Realization, Source–Stock Propagation, and Persistence Bottleneck Decomposition
RFP series round 6. Upgrades C3-O's adjoint cutoff into a formal formation-transport tool, constructs exact field-value splice packets, proves bounded Littlewood-Paley projection visibility, derives a realized PDE-bridge ledger.
[document] RFP-07: Synchronous Plateau Compression, Carrier-Depth Propagation, and Fast-Front Source Debt
RFP series round 7. Proves fixed-threshold synchronous edges form only a finite plateau, with every maximal plateau ending in a source-paying breaking edge and the plateau interior an exact spectral gap; classifies fast-front time sequences into congestion, parabolic, or long-reservoir mechanisms.
[document] RFP-08: Memory-Depth, Time-Lag Resolution, Packet-Complete Closure, and Plateau-Crossing Bridges
RFP series round 8. Builds a generation-age decomposition for plateau-compressed edges, proves conditional finite-memory closure, upgrades to a field-packet-complete bridging criterion, derives a plateau-crossing depth debt. Formally integrates the C3-J through C3-N guard results.
[document] RFP-09: Pressure/Far-Field, Adjoint Distortion, Interaction Efficiency, and Unified Tax Ledger
RFP series round 9. Defines a finite scale-invariant core tax vector for surviving escape mechanisms, compresses a dozen-plus prior escape mechanisms into adjoint-distortion/interaction-efficiency tax, proves a conditional bounded-tax-certificate compactness theorem.
[document] RFP-10: Guard Library Consolidation, Tax-Boundary Escape Census, and Finite-Obstruction Audit
RFP series round 10. Consolidates the guard library, classifies the nine core tax boundary faces by dynamical meaning, proves a pure-boundary NO-GO. Audit conclusion: the nine-tax family is certificate-compactness-complete, but not yet a dynamically complete finite-obstruction family.
[document] RFP-11: Pathwise Coercive Actions, Dangerous-Core Filtering, and Dynamical Guard Coverage
RFP series round 11. Introduces pathwise coercive actions, integrates Miller strain-vorticity action with Bradshaw-Grujic frequency-window action into a dynamical-necessity filter, reduces the ten-channel RFP frontier to the intersection of a triple-divergent-action core.
[document] RFP-12: Dangerous-Core Realizability, Coercive-Intersection Analysis, and Standard PDE Recompilation
RFP series round 12, Cycle I final audit. Adds an approximate-Laplacian-eigenfunction coercive action, proves mid-strain critical intermittency forces UV strain intermittency, proves two synchronization NO-GO results. Recompiles Cycle I into standard PDE language, hands off to Cycle II (NS-CSP).
[branch-hub] NS-RKAP
AMRAL's NS-RKAP (Navier–Stokes Residual Kernel and Amplitude Program) sub-line: Cycle XI, currently the newest frontier of the ten-part relay running CSP through RKAP. Only RKAP-01 is written so far, proving covariance-transport transversality and a two-sided PSD lift-tax theorem; a planned RKAP-02 has not been written yet, honestly flagged as the research frontier rather than an omission. Global regularity remains fully OPEN.
[document] RKAP-01: Hyperbolic Mismatch Fiber, Covariance-Transport Transversality, Two-Sided PSD Lift Tax, Critical Amplitude Lift, and Residual Recurrence
RKAP series round 1, opening Cycle XI, currently the newest round in this entire research line. Continues TSKR Cycle X's 'two-sided residual phantom,' proving covariance-transport transversality (Hu = |u|²w, quantitatively injective on |u| ≥ m) and an exact two-sided PSD lift-tax theorem (a sign-changing stress written as the difference of two positive-semidefinite covariance packets, lift cost exactly ‖H‖_*). Proves a conditional linear-amplitude lift compiler and a logarithmic-series threshold s ≤ 1/3, but also proves the lift tax has no free lunch — it is not automatic telescoping.
[branch-hub] NS-RMRM
AMRAL's NS-RMRM sub-line: not an independent research line, but the raw research-process journal for Cycle VIII (NS-DCRP) — 52 versioned checkpoints (v3 to v55, missing v15), each version corresponding one-to-one to a DCRP round as it was drafted in real time. Part III of the journal defines the RMRM (Reverse Mathematician Research Matrix) framework itself, an independent methodological contribution built as this page's one formal entry; the rest overlaps heavily with the already-published Cycle I-VIII rounds and is honestly disclosed rather than rebuilt version by version.
[document] RMRM-01: Reverse Mathematician Research Matrix as a Research Router
The definitional section of the RMRM framework itself, excerpted from Part III of version 55 (v55) of the 52-version checkpoint process document. Decomposes exceptional mathematical research methods into 11 cognitive primitives, 38 operators, and 28 dynamics, plus 10 phase-aware mathematician-fingerprint modes (Tao/Grothendieck/Ramanujan/Erdős/Thurston/Mirzakhani/Gowers/Bourgain/Perelman/Noether), proposing a research-action value function J(a|S_t) as a dynamic routing selection rule rather than a static blend of several mathematicians' personas.
[branch-hub] NS-TSKR
AMRAL's NS-TSKR (Navier–Stokes Tangent Singular Kernel Rigidity Program) sub-line: Cycle X, all 4 rounds live. Continues NS-IDRP's (Cycle IX) 'tangential singular-impulse phantom'; the final audit in TSKR-04 compresses the surviving obstruction to a 'two-sided residual phantom' (an at-most-one-dimensional hyperbolic mismatch fiber), formally handing off to NS-RKAP (Cycle XI). Global regularity remains fully OPEN.
[document] TSKR-01: Tangent Source Geometry, Complementary Channel Recovery, Sign-Changing Stress Kernels, Adjoint Synchronization Compatibility, and Residual Rigidity
TSKR series round 1, opening Cycle X. Attacks tangential source-burst geometry and the singular residual kernel directly. Proves an operator-level NO-GO: a smooth Fourier-localized symmetric source tensor can have zero pressure-source symbol yet nonzero Leray-projected divergence — active pressure alone cannot universally recover the forcing-relevant source direction. Defines the tangential-reproduction principle.
[document] TSKR-02: Quadratic Source Tangency, Velocity Reproduction Rigidity, Flux/Energy Response, Sign Fibers, and Coarse-Graining Fixed-Point Classification
TSKR series round 2, Cycle X. Replaces an arbitrary source tensor with the actual quadratic source geometry F^act = ηu⊗u and F^mod = η(U⊗U+R). Proves a pointwise 'rank-one decay rigidity' theorem and a global coarse-grained fixed-point rigidity theorem: a whole-space tensor pinned by a single convolution scale, under a non-degenerate probability mollifier, must be zero.
[document] TSKR-03: Localized Quadratic Fixed Points, Harmonic Rank-One Rigidity, Nodal Sign Fibers, One-Sided Covariance Tangents, and Residual Fixed-Orbit Classification
TSKR series round 3, Cycle X. After TSKR-02's global quadratic fixed-point rigidity, the remaining question is local. Shows the naive localization of the global fixed-point theorem is wrong — for radial spatially-averaged kernels, every component-wise harmonic tensor is an exact local fixed point — and proves an analytic nodal-sign rigidity theorem.
[document] TSKR-04: Two-Sided Mismatch Stress, Second-Order Zero-Base Recovery, Harmonic-Pressure Tail Rigidity, Adjoint Compatibility, Amplitude Tax, and Cycle-X Closure Audit
TSKR series round 4, Cycle X final audit. Linearizes the exact quadratic tangency constraint at a reproduced zero-covariance nonzero basis, proving the energy-invisible two-sided mismatch stress has the special traceless hyperbolic form H = u⊗w+w⊗u (w ⊥ u), with nonzero eigenvalues exactly ±|u||w|. Flux-invisibility further forces w ⊥ Su, so the entire two-sided mismatch kernel is at most one-dimensional. Reduces TRSK to a 'two-sided residual phantom' (TSRP).
[branch-hub] NS-X72
AMRAL's NS-X72 sub-line: a "pure-continuous proof-route" campaign against the Navier–Stokes global-regularity problem, using the Generalized Structural Continuum Hypothesis (GSCH) as its methodology — before a discrete index is proven essentially discrete, first assume it can be losslessly re-integrated continuously, banning discrete time steps, finite partitions, subsequence closure, and countable induction as tools. 69 of 71 rounds are built (rounds 11 and 14 missing, confirmed absent from the source folder and every archive checked); each round tests one pure-continuous route until the first strictly locatable STOP/TRANSITION/ILLEGAL node, then hands off to the next, accumulating 75 numbered STOP-C nodes so far. Round 71 is the current frontier, itself listing nine concrete to-dos — not a halted route.
[document] X72-01: Pure-Continuous Energy Route
Opens the series and sets the Pure-Continuous experimental rules: discrete time steps, finite partitions as a core step, subsequences as a closure mechanism, and countable induction are all forbidden; only continuous time/space/scale, PDE/distributions, and Lebesgue/Sobolev/Lorentz-type continuous function spaces are allowed as tools, and the sole object of study is the maximal smooth solution generated by smooth, rapidly decaying initial data on R^3. Advances along the most direct, energy-first continuous closure route and proves two STOPs: STOP-C01 (a gap between the energy and the critical scaling — standard energy estimates cannot deliver critical control) and STOP-C02 (vortex stretching lacks coercivity — the pure-energy framework cannot see the sign structure of the stretching term). Together the two STOPs point to the next step: attack the scale-critical continuous carrier instead, handing off to the next round's Critical Continuous Carrier Route.
[document] X72-55: Adjoint Minimal Floquet Modes and Symmetry-Pairing Reduction
Building on the two localized adjoint-compatible modes and nonzero target defect stably exhibited by Round 54's physical finite truncation, this round finds the exact reflection symmetry and antilinear symmetry of the source–adjoint problem, builds a regularized localized adjoint basis, and compresses the full target pairing into a single question of the sign of a central coefficient. Proves that on both source fibers, the two coefficients in the target pairing always share the same sign, so proving that this central coefficient is positive alone suffices to close the second-order source cancellation; the finite-truncation numerics already stabilize, from a very shallow truncation depth onward, at very high precision showing it to be positive. Route halts at STOP-C59 (adjoint central positivity / rigorous tail-bound gap): the finite-truncation positivity has still not been upgraded to a rigorous infinite-dimensional theorem, handed to the next round to rigorously construct the bound on the adjoint tail; this round also includes a numerical-verification script.
[document] X72-65: Banded A Posteriori Validated Viscosity Extension
Continuing from the half-line theorem a₃,±(ν)>0 (ν≥10⁻⁴) proved in Round 64, this round replaces dense interval matrix inversion with banded a posteriori certificates and incorporates an IEEE-754 rounding-error model, lowering the verification cost from O(N²), thereby closing two further decades ([10⁻⁵,10⁻⁴] and [10⁻⁶,10⁻⁵]). This gives a₃,±(ν)>0 for all ν≥10⁻⁶; combined with the same-sign Fredholm pairing from Round 55, the full second-order analytic hidden remedy of the two √17 hidden source circles is ruled out within this range. The remaining singular band narrows to 0<ν<10⁻⁶, and the bottleneck shifts from residual verification to the storage cost of the dense approximate inverse matrix, left for the next round to handle with fixed-size block-Riccati certificates; this round includes numerical verification scripts and CSV data.
[document] X72-48: Beltrami-Normal Non-Coercivity and Hidden Directions
Building on Round 47's visibility normal operator obtained near a constant-amplitude circular Beltrami background, this round set out to check its quotient coercivity, but instead computed the complete single-mode Floquet normal symbol outright and proved that quotient coercivity is false: the operator has infinite-dimensional, genuinely non-Beltrami hidden directions — some of which are not redetected by visibility until the quadratic term, plus a further family of continuous helical directions whose quadratic lift vanishes exactly — and constructs a finite-amplitude family of purely invisible 'golden mixed-Beltrami' states, proving that the purely invisible manifold is strictly larger than the single Beltrami manifold. Route halts at STOP-C52 (Beltrami-normal non-coercivity / hidden-invisible-manifold dynamics gap): state-level hidden directions do not imply that the NS dynamics will remain invisible — the next round still needs to examine their source-level cancellation.
[document] X72-47: Beltrami Tension-Cancellation Dynamics and Source-Lock
Building on Round 46's scalarization of visibility into a single scalar carrier, this round derives the carrier's complete dynamics: writing the exact equations for the amplitude source, the tension source, and the total visibility gap (built from three channels — vorticity stretching, gradient stress, and the transport commutator), distinguishing a 'state-level cancellation' from the stronger 'source-level cancellation,' and, near a constant-amplitude Beltrami background, obtaining the linearized visibility normal operator, proving that its tangential kernel corresponds exactly to the symmetric tangent directions. Proves that the Beltrami-invariant branch satisfies cancellation at every level simultaneously, but in general only source-level cancellation determines the true contact order of visibility. Route halts at STOP-C51 (state–source cancellation / Beltrami-normal-coercivity gap): the coercivity of this normal operator on the quotient space is not yet proved, nor has an unconditional source-cancellation mechanism been found, left to the next round to examine the operator's kernel.
[document] X72-34: Cancellation-Budget Dynamics
Picks up Round 33's accounting framework that splits signed sources into net, total variation, and cancellation coefficient (STOP-C37), and studies the evolution of the cancellation reserve itself. Proves that diffusion only erodes the reserve (the Kato Equal-Removal Law), so sustained cancellation must be continually replenished from the minority-sign side. For determinant sources, the nonnegative vorticity-stretching term in the net-positive dangerous branch likewise drains the negative reserve, and genuine replenishment can only come from the pressure and tensor-diffusion curvature channels; for the renormalized pair source, replenishment comes from the source's second-order difference and the transport commutator. STOP-C38 (Cancellation-Reserve/Sign-Selective Replenishment Gap) hands to the next round the task of auditing whether these replenishment channels are free resources.
[document] X72-35: Cancellation-Replenishment Closure
Picks up Round 34's proof that sustained cancellation needs minority-sign replenishment (STOP-C38), and audits the two supply lines feeding the determinant's net-positive branch — viscous interface dissipation -ν∫_{d<0}𝒢_det and the cofactor–pressure coupling -∫_{d<0}cof S:H_p — splitting the pressure into isotropic/anisotropic cofactor coherence and folding the tensor-diffusion curvature back into the higher-gradient budget. Proves that neither supply line is a free resource: viscous interface dissipation cannot absorb the global curvature in general (universal Kato absorption is false), and the anisotropic pressure supply needs quartic amplitude and signed tensor coherence to sustain phase locking. STOP-C39 (Replenishment-Closure/Cofactor–Pressure Coherence Gap) hands the problem to the next round's cofactor–pressure coherence dynamics.
[document] X72-68: Central Sign-Cone Coarse Bridge Target
Continuing from Round 67's approach of compressing the final bridge into a total-variation estimate for the scattering derivative Σ(ν) (STOP-C71), this round uses the exact central identity at n=1 to convert the minimal quantity to be proved, u₃=-a₃, into a sign problem for two O(1) neighboring quantities e₁=u₂ and o₂=u₅/ν: the large fiber requires only e₁<0∧o₂>0, and the small fiber requires only the very loose conditions e₁≤-0.1, 0≤o₂≤100 to guarantee u₃<0. Rigorous endpoint intervals show both fibers sit deep inside this sign cone, so only the extremely crude derivative bounds |e₁'|<10⁵ and |o₂'|<10⁶ are needed to close the entire segment 0<ν≤10⁻⁶; the actual fixed-size tangent diagnostic values are only about O(1)–O(10²), leaving three to five orders of magnitude of margin. This round does not prove this uniform coarse derivative bound; the gap shifts to STOP-C72, left for the next round; this round includes numerical verification scripts and CSV data.
[document] X72-36: Cofactor–Pressure Coherence Dynamics
Picks up Round 35's compression of the anisotropic pressure supply into the cofactor–pressure coherence ρ_p⁻ (STOP-C39), and derives the exact material-derivative equations for the trace-free cofactor tensor and the anisotropic pressure Hessian on a moving sign-domain, testing whether the replenishment coherence must necessarily dephase. Constructs an explicit witness from the static affine strain u=S_0x, p=-½x^⊤S_0²x, obtaining H_p^0=-C_S^0 and ρ_p⁻=1 — directly refuting
[document] X72-27: Coherence Dynamics and Angular Phase Locking
Continuing from Round 26's result that 'the signed kernel has zero mean and finite variance, but no universal synchronization bias' (STOP-C30), this round converts the static-sign question into a dynamical one: it derives exact angular evolution equations for the strain eigenframe rotation, vorticity direction, quotient direction, and the pairwise line-of-sight direction, proving that the self-amplification term -S² makes no direct rotational contribution to the eigenframe (it only reshapes the strain, without rotating the frame). It establishes a non-stationary angular cancellation lemma — when the phase velocity |θ'|≥Ω>0, the accumulated signed coupling is suppressed unless the amplitude or phase-velocity modulation is strong enough — and also gives an exact locking condition and a pairwise Biot–Savart phase-decomposition formula. The route halts at STOP-C31 (angular-phase-locking / coherence-persistence gap): unconditional control of either a phase-velocity lower bound or a locking-duration upper bound is still missing, passing the baton to the next round to test whether this phase-locking manifold is itself stable.
[document] X72-23: Confluence-Feedback Spectral-Gap Leakage
Continuing from Round 22's tilt-covariance law, this round substitutes Round 19's middle-strain/determinant confluence into it, testing the pointwise self-closure conjecture that 'a dangerous self-amplification source automatically generates a spatial Fisher penalty.' The result is that the pointwise version is refuted — a positive self-amplification source can locally coexist with ∇logK=0; but a workable global version is established: if the critical-mass measure μ_0 has a finite Poincaré constant C_P<∞, then the Spectral-Gap Trapping Theorem follows (𝔍-1≤4C_P𝔍I₄, conditionally closed); it also constructs an example of two disconnected smooth gauge blobs, proving that the nonlinear gauge does not by itself automatically yield a spectral gap (in that example C_P=+∞). The route halts at STOP-C27 (critical-mass spectral-gap / source-variance leakage gap): C_P and the source variance still lack unconditional control, passing the baton to the next round to study directly the connectivity/conductance dynamics of the critical mass itself.
[document] X72-06: Continuous Hierarchy and Spectral Covariance
Continuing from Round 05's STOP-C09, this round attempts to differentiate α_ν directly for dynamic control, but immediately pulls in the next-order derivative (‖Λ³S‖²), showing that order-by-order tracking does not close automatically. Rather than treating this as a transition toward the discrete, this round lifts the entire derivative hierarchy into fields M_s, α_s, κ_s over a continuous real coordinate s ∈ [0,∞), and proves that under the spectral probability measure μ_s, viscous dissipation equals exactly the damping of the spectral variance (−2ν Var_{μ_s}(|ξ|²)), establishing a continuous stacking criterion that uses no dyadic shells. This round stops at STOP-C10 (the continuous-hierarchy-slope/spectral-covariance gap): the infinite hierarchy has been represented, but not yet forced to close, handing off to the next round's attempt to re-integrate the entire hierarchy at once with a Gevrey generating carrier.
[document] X72-19: Coupled Confluence of Middle-Strain and Quotient Amplitude
Continuing from Round 18's obstruction confluence loop, this round opens no new representation, instead directly coupling the critical quotient amplitude r=|v| with the middle-strain/determinant geometry λ₂⁺, (-det S)₊. It proves that the dangerous determinant-production rate is two-sided equivalent to λ₂⁺|S|², and that λ₂⁺≤|Sn| holds for all directions, so dangerous middle-strain cannot escape by choice of direction; it then defines the confluence ratio χ_C=λ₂⁺/|v| and proves the overlap–degeneracy inequality P₊²≲E_M·I₀, showing that dangerous activity has only two options: 'overlap with the quotient amplitude' or 'escape into low-amplitude degeneracy.' The route halts at STOP-C23 (confluence-ratio / low-amplitude-degeneracy gap), passing the baton to the next round to dissect directly the one remaining escape channel, |v|≈0.
[document] X72-52: Coupled Floquet Rescue and Source-Debt Export
Building on Round 51's central viscous-curvature obstruction, this round directly tests whether it lies within the source range of the hidden kernel. The result proves that a compact hidden block occupying just two vertical sidebands already gives a nonzero central-source projection that exactly cancels that central curvature, so Round 51's 'central obstruction' is reclassified: a rescue does exist; but that same rescue block necessarily exports source debt to adjacent and higher sidebands (same-layer export at order O(ν), cross-parity viscous export at order O(ν²)), so the rescue is not in fact closed. Route halts at STOP-C56 (source-debt cascade / Floquet-tail convergence gap), handed to the next round to study the asymptotic behavior of source transfer for general hidden blocks at large sideband depth; this round also includes a numerical-verification script.
[document] X72-02: Pure-Critical Continuous Carrier Barrier
Continuing from Round 01, where the energy route stalled at STOP-C01 (the energy/critical-scaling gap) and STOP-C02 (the vortex-stretching coercivity gap) because of its subcritical scaling, this round instead tests three purely continuous, scale-critical carriers: H^{1/2}, L^∞_tL^3_x, and the Kato/Duhamel critical fixed point. Proves that 'critical-carrier formation' is not the same as 'global critical-carrier control': the H^{1/2} route closes only for small data, and critical scale-invariance proves that the Navier–Stokes scaling cannot repair large data into small data (STOP-C03); pure energy estimates give only L^4_tL^3_x, not the L^∞_tL^3_x needed for closure (STOP-C04); and the Kato contraction method contracts globally only for small critical data (STOP-C05). The three barriers together point to one candidate transition — the next step may occur first on the observational axis rather than the underlying continuous/discrete axis — handing off to the next round's relational-geometry route.
[document] X72-12: Critical-Dual Cancellation Trade-Off
Continuing from Round 11 (the exact contraction, in L², of the dual generating functional and the backward dual equation), this round tests whether the critical dual spaces L^{3/2} and H^{-1/2} likewise admit an exact contraction. Proves that the L² contraction depends simultaneously on two structures — projection compatibility and transport antisymmetry: L^{3/2} retains the transport chain-rule cancellation but loses Leray-projection compatibility, while H^{-1/2} retains projection compatibility but loses transport commutativity; and, within two restricted classes — locally isotropic integral metrics and radial Hilbert-multiplier metrics — proves that L² is the unique metric retaining both, yet L² is not scale-critical. This round accordingly establishes a 'criticality/cancellation trade-off' and stops at STOP-C16 (the criticality/double-cancellation gap), explicitly stating this is a restricted no-go (nonlocal or relational functionals are not excluded), and hands off to the next round's question of whether the projected entropy gradient can be re-integrated back into a scalar functional.
[document] X72-39: Critical-Endpoint Dini Compensation
Picks up the critical triple-increment endpoint s_u+s_E+s_q=1 obtained in Round 38 (STOP-C42), and studies how this one derivative is continuously distributed among u, E_p, and q, testing whether defect viscosity, incompressibility, and the quadratic pressure structure can supply the missing Dini/log gain. Proves that defect viscosity can pay for a full derivative (‖δ_zE‖_2≤|z|‖∇E‖_2), and that incompressibility gives a Hardy-space compensation for q, ‖q‖_{ℋ^1}≲‖∇u‖_2², but this does not automatically give radial Dini summability — the claim of an automatic Dini gain from incompressibility is false. The alternative route, putting the derivative on q instead, loops back exactly to Round 05's H^1 strain budget, leaving only a logarithmic-modulus gap. STOP-C43 (Critical Dini/Hardy-Increment Mismatch Gap) hands the problem to the next round's Hardy–BMO dual commutator route.
[document] X72-24: Critical-Mass Conductance Dynamics
Continuing from Round 23's critical-mass spectral-gap gap (a finite Poincaré constant C_P<∞ is needed to convert spatial Fisher smoothing into an anti-intermittency restoring force), this round defines the continuous Cheeger conductance h_Q and the isoperimetric profile ℐ_Q(s), deriving a conductance-feedback ODE and an exact material-cut conductance law. The core results are two counterexamples: it proves that 'positivity does not imply mixing' — everywhere-positive density does not entail h_Q≥h_*; and constructs a two-Gaussian thin-neck witness, showing that the neck-recovery rate of pure viscous diffusion decays in a Gaussian fashion with separation distance R, h(t)≲s_t⁻¹exp(-R²/2s_t²), so topological reconnection does not imply a quantitative conductance lower bound. The route halts at STOP-C28 (conductance-recovery / neck-selection gap): neck diffusion, selection contrast, and normal-drift deformation still lack uniform control, passing the baton to the next round to test whether NS's nonlocal (Biot–Savart, pressure) coupling can supply a 'virtual connection' when the neck is nearly severed.
[document] X72-21: Critical-Mass Replicator Intermittency Dynamics
Continuing from Round 20's STOP-C24, this round no longer asks only where the low-amplitude set sits, and instead studies directly the deterministic dynamics of the critical quotient measure dμ_Q=r³dx/Q³ and the normalized strain rate K_S=|S|/r, establishing the critical-mass replicator-diffusion equation ∂_t m_Q+div(b_Qm_Q)=νΔm_Q+3(G_Q-Ḡ_Q)m_Q, and rewriting the intermittency ratio as the measure-separation form 𝔍_S-1=χ²(ν_S‖μ_Q). It proves that viscosity supplies an exact anti-intermittency mechanism, satisfying 𝔍_S'=-2νℱ_rel+𝒫_sel, but the NS relative-source production 𝒫_sel has undetermined sign and may cancel the viscous term; and clarifies that a 'probability-measure representation' does not amount to a stochastic ontology — this measure comes from a single deterministic state, not a random transition law. The route halts at STOP-C25 (relative-source / critical-mass-separation gap), passing the baton to the next round to decompose 𝒫_sel and the relative source back into concrete terms such as strain self-amplification and vorticity coupling.
[document] X72-13: Critical-Quotient Gauge Covariance
Continuing from the question left open by Round 12 (whether the projected entropy gradient PJ_{3/2} is the gradient of some scalar functional), this round first proves the answer is yes — but the true critical dual object is actually the quotient space L^{3/2}/G_{3/2}, whose minimal representative v* satisfies the nonlinear gauge div(|v*|^{-1/2}v*) = 0, so Round 12's explicit Leray defect disappears. A deeper defect immediately surfaces, however: component-wise transport does not preserve the gradient gauge; switching to a gauge-covariant one-form Lie transport does repair the gradient quotient, but introduces a strain-stretching term, producing a transport/gauge-covariance trade-off. A local-correction no-go in the affine case further proves that only pure rigid rotation can simultaneously satisfy gauge covariance and entropy neutrality. This round stops at STOP-C17 (the critical-quotient-gauge-covariance/stretching gap), and points out that the Navier–Stokes equation, after quotienting the gradient, is itself a Lie-transport equation, handing off to the next round's test of the original critical one-form/circulation quotient.
[document] X72-43: Double-Divergence-Free Stress and Wave-Cone Gauge
Picks up Round 42's compression of the nonlocal obstruction into the double-divergence-free trace-free stress W_T (∂_i∂_j(W_T)_{ij}=0, STOP-C46), and tests directly whether this differential constraint alone can supply compensating regularity. Proves that the divdiv operator is constant-rank and cocanceling, but that its wave cone is full, so no quadratic Hardy/null-Lagrangian-type gain exists; constructing an explicit potential representation via a symcurl+devgrad gauge likewise gives no automatic endpoint gain — the generic constrained transfer remains nonzero and consumes a full derivative: divdiv constraint alone is too weak. STOP-C47 (Full-Wave-Cone/Vorticity-Realizability Gap) therefore points to what should really be used — the nonlinear realizability of W=ω⊗ω-1/3|ω|²I together with ∇·ω=0 — leaving the next round to examine actual vorticity triples.
[document] X72-70: Dual Rank-One Riccati Kernel
Continuing from Round 69's conclusion compressing the first-order bridge into a single scalar scattering amplitude (STOP-C73), this round further proves, in parity-rescaled pointwise Riccati coordinates, that each local viscous tangent source is itself exactly rank one (nonzero only on the even layer, and exactly first order in ν), while the dual weight of the central scalar observable also exactly preserves rank one under pullback, yielding the
[document] X72-59: Endpoint Jost Positive Green Functional Theorem
Continuing from the bounded neutral Green/Jost endpoint gap left open by Round 58 (STOP-C62), this round addresses the positivity problem for the two-dimensional bounded Jost family at the singular endpoint ν=0. It rewrites this family as an affine-graph pullback, proves it is the unique contracting attractor, and, combining exact algebraic coefficient bounds with outward-rounding interval arithmetic, rigorously proves the central Green functionals c₀,₋>5.79 and c₀,₊>5.33, establishing the
[document] X72-63: Fast-Difference Schur Elimination and Symmetrized Slow Gauge
Continuing from Round 62's idea of compressing the small-viscosity gap into a
[document] X72-61: Fast-Slow Stable Bundle Optimal Matching Exponent
Continuing from Round 60's ν^(-1/3) WKB boundary-layer scale, this round points out that if dichotomy roughness is applied directly at the originally proposed overlap point j_m=ν^(-1/4), the ratio of the slow-gap to the coefficient error reaches only O(1) — not enough to serve as a rigorous perturbation parameter. It decomposes the zero-viscosity three-dimensional minimal bundle exactly into two fast minimal lines plus one slow neutral line, thereby reducing the proof's dimension from three to one, and after rebalancing the three conservative error terms, obtains a corrected optimal overlap exponent α*=2/7, with matching-error target O(ν^(1/7)); six-dimensional Grassmannian principal-angle numerical diagnostics show the actual convergence is far faster than this conservative bound. This round does not prove a₃(ν)/ν→c₀; the gap shifts to STOP-C65 (the fast-Schur/slow-Riccati quantitative gap), left for the next round; this round includes numerical verification scripts and CSV data.
[document] X72-66: Fixed-Size Jost-Riccati Graph Anchor
Continuing from the dense approximate-inverse-matrix storage bottleneck identified in Round 65 (STOP-C69), this round writes the six-dimensional transfer state in 3+3 block form, representing the positive-viscosity minimal three-dimensional bundle as the Möbius pullback of a fixed-size 3×3 Riccati graph G_n, and proves the
[document] X72-53: Floquet Rescue-Cascade Tail Asymptotics
Building on Round 52's conclusion that 'a rescue must export source debt upward,' this round establishes the asymptotic law for source transfer of general hidden blocks at large sideband depth, derives the frozen characteristic polynomial of the one-sided rescue recursion, and proves that its asymptotic solutions split exactly into three branches: a growing branch, an alternating branch, and a minimal branch. Proves that for the typical one-sided central rescue recursion, on both source fibers corresponding to the golden ratio the numerics fall into the growing branch rather than the required minimal branch — so if a complete analytic rescue exists, it must rely on global, two-sided hidden degrees of freedom to select the minimal branch exactly, rather than on a purely local cascade. Route halts at STOP-C57 (one-sided factorial blow-up / minimal-branch matching gap), handed to the next round to perform two-sided minimal Floquet matching; this round also includes a numerical-verification script.
[document] X72-09: Fourier-Triad Phase Coherence
Continuing from Round 08's STOP-C12, this round substitutes the abstract transfer rate ϑ back into the actual Navier–Stokes Fourier-triad convolution, establishing the triad transfer kernel T = A sin Φ (amplitude × phase coherence), and proves geometric constraints including the No-Free-Radial-Jump lemma and vanishing contribution from collinear triads. The core result is the phase-sign flexibility lemma: with the triad geometry and modal amplitudes fixed, flipping only the relative phase Φ can change the sign of the transfer, so the frequency geometry and modal amplitudes alone cannot determine the sign — a third single-observable rejection theorem, X_{Γ_triad,amp}, in a restricted context. ζ_{τ,s} is accordingly rewritten exactly as a signed phase-coherence triad integral, stopping at STOP-C13 (the triad-phase-coherence/commutator-sign gap), handing off to the next round's direct study of the dynamics of the phase Φ itself.
[document] Methodology: Generalized Structural Continuum Hypothesis (GSCH)
Proposes the Generalized Structural Continuum Hypothesis (GSCH): a structure that appears in discrete form — as integer order, mode index, or finite partition — should first be tested for a lossless, dynamically closed continuous re-integration before it is declared essentially discrete. Gives three conditions for a legitimate continuous re-integration (recoverability, dynamical compatibility, invariant preservation) and a decision criterion for essential discreteness (the essential-discreteness witness), and compresses the decision procedure into a three-layer test (index continuation, hierarchy re-integration, lossless dynamical closure). Closes with two cases from the Navier–Stokes pure-continuous route — integer derivative order can be lifted to a Gevrey carrier, and interaction order can be re-integrated via a generating functional — showing that a discrete index alone does not yet constitute an essential-discreteness witness, and lays the methodological foundation for every subsequent Pure-Continuous round.
[document] X72-04: Local-Geometry/Nonlocal-Pressure Gap
Continuing from Round 03's STOP-C06, this round directly derives the exact evolution equations for the relational-geometry quantities λ2, det S, and σ, rather than treating them merely as external criteria. Proves that the pressure Hessian H_p is essentially nonlocal at the operator level (its Fourier symbol is non-polynomial and cannot be reconstructed by a local differential operator of any order), so local finite-geometry closure is thereby refuted on the test class; and also proves that the global pairing ∫S:H_p = 0 cannot imply the local spectral sign e_2^⊤H_pe_2 = 0, producing STOP-C07 (the local-geometry/nonlocal-pressure gap) and STOP-C08 (the global-cancellation/local-feedback gap). For the first time on this route, this round establishes a transition finer-grained than continuous/discrete: local continuity is forced by the incompressibility constraint into global, nonlocal continuity (still not discrete), handing off to the next round, which reverses the order of derivation, performing the global projection cancellation first.
[document] X72-07: Continuous-Hierarchy Analytic Re-Integration
Continuing from Round 06's STOP-C10, this round proposes the Gevrey generating carrier G_{τ,s} = ‖e^{τΛ}Λ^sS‖² and proves a continuous-hierarchy re-integration theorem: as long as the analytic radius τ > 0 stays positive, it simultaneously controls every higher real Sobolev level, so the infinite derivative hierarchy is, by itself, not an essential obstruction for Pure-C. Further establishes an adaptive radius tax ρ_{τ,s} and a compensation law τ' = −ρ under which the Gevrey norm is non-increasing along this path, and proves that a finite-time singularity, if one exists, must exhaust the analytic-radius budget (inf τ(t) = 0). Finally stops at STOP-C11 (the analytic-radius-budget-exhaustion gap): it has not yet been proven that this budget cannot be exhausted, handing off to the next round's test of whether the spectral variance automatically forms a negative feedback on the radius tax.
[document] X72-40: Hardy-BMO Dual Commutator
Picks up Round 39's proof that incompressibility gives a Hardy compensation but no automatic Dini gain (STOP-C43), and switches to a dual route, requiring q∈ℋ^1 with dual commutator [u·∇,𝒯_0*]E_p∈BMO. Using Round 38's Pressure Self-Commutator Null Identity, it reduces the dual target to [D_u,𝒯_0*]C, involving only the local trace-free cofactor C_S^0, and proves that the Hardy side can be paid directly from the incompressible enstrophy — but the standard Coifman–Rochberg–Weiss L^p commutator estimate does not by itself deliver the required BMO target: the criticality of a full derivative still sits on the BMO side, with threshold s_u+s_C=1. STOP-C44 (Hardy-BMO Transfer/Two-Increment BMO Endpoint Gap) hands the problem to the next round, to look for extra cancellation from the cofactor's special algebraic structure.
[document] X72-49: Hidden Invisible-Manifold Source-Lock and Golden Transversality
Building on the golden mixed-Beltrami purely invisible manifold found in Round 48, this round directly tests whether state-level cancellation on that manifold also implies source cancellation. The result proves that the viscous source is exactly tangent at the golden-ratio root, but the nonlinear source is nonzero under any nontrivial mixing, so visibility erupts with an exact positive second-order curvature — meaning the entire golden hidden manifold, apart from the pure-Beltrami axis, is not a genuine NS-invariant branch, ruling out the first deep finite-amplitude hidden candidate family. Route halts at STOP-C53 (hidden-state / nonlinear-source transversality gap): state-level hiddenness does not imply dynamical hiddenness, handed to the next round to linearize source cancellation and build a systematic classification over the entire invisible manifold; this round also includes a numerical-verification script.
[document] X72-46: Invisible-Escape Scalarization and Beltrami Tension Cancellation
Building on Round 45's result compressing the quartic escape of the bounded Piola defect to vanishing visibility, and writing the purely invisible boundary injection as a projected tensor source, this round uses the zero-divergence property of vorticity to completely scalarize the entire visible stress into a single scalar carrier: the sum of a local vorticity-amplitude modulation and a nonlocal vorticity–Beltrami tension potential — and from this derives an exact visibility formula and a scalar second-order law for the boundary injection. Proves that near-Beltrami invisible escape necessarily forces the vorticity amplitude toward spatial uniformity, while strongly intermittent exact Beltrami flow can never asymptotically approach pure invisibility — the two together constitute an escape dichotomy. Route halts at STOP-C50 (amplitude–Beltrami-tension cancellation/injection persistence gap): the long-time persistence of this scalar carrier's cancellation term is not yet dynamically controlled, left to the next round to treat its cancellation dynamics.
[document] X72-50: Invisible-Manifold Source-Lock Characteristic Geometry
Building on Round 49's exclusion of the golden manifold, this round stops testing family by family and instead builds a second linear filter — the linearization of source cancellation — alongside the existing state normal operator, giving a characteristic classification of isolated Fourier perturbations for which both state and source cancellation hold simultaneously. Proves that Round 48's entire horizontal hidden plane, once passed through the source filter, collapses to two characteristic circles; the non-horizontal isolated hidden surfaces all vanish except at the Beltrami resonance point; and the two surviving source-hidden circles remain non-Beltrami, with nonzero quadratic lift. Route halts at STOP-C54 (second-filter characteristic / nonlinear-invisible-curve gap): first-order state-plus-source hiddenness still does not amount to the genuine persistence of a nonlinear invisible manifold, handed to the next round for a second-order manifold correction; this round also includes a numerical-verification script.
[document] X72-16: Continuous Layer-Cake Decomposition and Superlevel Distortion
Continuing from Round 15's weighted gauge-Hessian distortion ratio Ξ_Q=Q²H/(ν²D) (STOP-C19), this round instead performs a layer-cake decomposition of D and H using a continuous amplitude threshold λ∈(0,∞), without introducing dyadic shells. It proves that the global ratio Ξ_Q is a weighted average of the tail distortion at each continuous layer, so Q³ growth must force the existence of a dangerous continuous layer λ*; and derives the tail-surface evolution equation θ'=(a_Σ/d)(θ-σ) and the localized Hodge orthogonality identity E_M^u=D_M+H_M-2B_Q(λ), showing that localization itself comes at the cost of a boundary-flux tax. The route halts at STOP-C20 (continuous-layer distortion / boundary-flux gap): the boundary flux B_Q(λ) still has no unconditional control, and the baton passes to the next round to dissect the surface geometry of B_Q(λ) directly.
[document] X72-17: Level-Surface Hodge Coherence
Continuing from Round 16's STOP-C20 (boundary-flux gap), this round uses the nonlinear critical gauge div(r²n)=0 to split the level-surface flux B_Q(λ) into continuous surface invariants — normal-alignment angle, mean curvature, and tangential gauge slope — testing whether it is an independent obstruction or can be folded back into the global Hodge geometry. It proves a zero-net normal-alignment identity and an alignment-angle dissipation tax, and obtains the Level Hodge-Coherence Identity: E_M^u/D_M=(√R_M-1)²+2√R_M(1-ρ_M), which lets the accumulated flux be continuously re-integrated back into global coherence, converting it into a new critical weighted physical-gradient carrying quantity E_M — whose finiteness under space-time integration would control Q. This round explicitly states that this is still not closure (the source text devotes a dedicated section to 'Why this is not yet closure'), and halts at STOP-C21 (level-surface Hodge coherence / critical weighted-gradient gap), passing the baton to the next round to decompose E_M back into strain-vorticity geometry.
[document] X72-30: Lock-Budget Recycling and the Trajectory Gap
Continuing from Round 29's critical-lock-work gap (STOP-C33), this round introduces no new lock variables, and instead connects, term by term, the pressure, viscous strain, vorticity dyad, vorticity-direction viscosity, and quotient-gauge forcing needed to sustain the lock back to the existing NS budgets, testing whether a genuinely 'free' source of stabilization exists. The result: the frame supply can be controlled by existing quantities such as ν²‖ΔS‖₂²+‖S‖₄⁴+‖ω‖₄⁴ (the Budget Recycling Theorem), and no new free stabilization mechanism is found; but the real new obstruction turns out to be an Eulerian–Lagrangian gap — a thin-tube concentration witness is constructed showing that a volume-type L^p norm can have ‖F_ε‖→0 while the same function along a particular trajectory has F_ε(X(t),t)→∞, so a positive-volume robust lock can be charged against the global budget, while a measure-zero/thin-tube lock cannot. The route halts at STOP-C34 (budget-recycling / Eulerian–Lagrangian trajectory gap): a critical-mass/capacity/thickness lower bound for a dangerous persistent lock is still missing, passing the baton to the next round to study directly whether the lock-occupation measure Θ_lock must carry positive critical mass.
[document] X72-28: Lock-Manifold Stability and the Dual-Strain Saddle
Continuing from Round 27's angular-phase-locking gap (STOP-C31), this round performs a genuine linearization of the leading-order dynamics under frozen strain: it proves that the vorticity-direction flow ξ'=P_ξ⊥Sξ is a Rayleigh ascent and the quotient-direction flow n'=-P_n⊥Sn is a Rayleigh descent, each attracted, under a simple spectrum, to opposite eigendirections e₃ and e₁ respectively. The core result is the Common-Lock Saddle Theorem: when ξ=n=e_i lock together, the linearization exponents of any transverse eigenmode come in pairs ±|λ_j-λ_i|, so the leading-order dynamics of frozen strain can never asymptotically attract a common lock by itself — a genuinely stable lock must rely on additional frame mechanics (pressure, viscosity, vorticity, gauge) to actually overcome this unstable strain gap. The route halts at STOP-C32 (dual-strain-saddle / lock-stabilization-forcing gap), passing the baton to the next round to quantify, as a 'lock work,' whether the additional dynamics have enough budget to sustain this unstable lock over time.
[document] X72-29: Lock Work and Frame-Forcing Budget
Continuing from Round 28's proven frozen common-lock saddle structure (STOP-C32), this round turns 'how much the additional dynamics must pay to sustain this unstable lock over time' into a computable quantity. It defines the critical strain-gap exposure Γ_ij=∫|λ_i-λ_j|dt as a scale-invariant lock-instability clock, proves a fine-tuning-or-control identity and the lock-work lower bound ∫(-xf)₊dt≳∫gx²dt-ΔE_x, showing that an exactly invariant lock, while possibly existing, is exponentially non-robust; and proves a quadratic strain-gap burden law — for the frame-rotation rate to reach the gap scale |Ω_ij|~g_ij, its numerator must satisfy |N_ij|~g_ij² — yielding the gap-dominant-instability criterion: whenever the stabilizing angular Jacobian is smaller than the gap width, the common lock retains positive transverse instability. The route halts at STOP-C33 (critical-lock-work / frame-forcing-budget gap): whether the forcing budget from pressure, gauge, and the like can be unconditionally supplied by existing energy remains unknown, passing the baton to the next round to connect each forcing channel (pressure, viscosity, vorticity, gauge) individually back to the NS budgets already established in earlier rounds.
[document] X72-67: Log-Viscosity Riccati Tangent Scattering Derivative
Continuing from Round 66's fixed-size Jost-Riccati graph and the continuous-parameter extension gap it left (STOP-C70), this round uses t=log ν as the gauge parameter, differentiating the graph G_n exactly to obtain the closed, fixed-size tangent flows H_n and K_n, and proves that the derivative of the normalized central functional f(ν)=a₃(ν)/ν is exactly the
[document] X72-20: Low-Amplitude Degeneracy Intermittency
Continuing from Round 19's one unresolved low-amplitude escape channel (|v|→0 while strain remains large), this round rewrites the inverse-amplitude carrying quantity as the second and fourth moments of the normalized strain K_S=|S|/r under the critical quotient mass measure dμ_Q=r³dx/Q³, and defines the intermittency ratio 𝔍_S=𝔼[K_S⁴]/𝔼[K_S²]². It proves that the second moment cannot unconditionally control the fourth moment (second-to-fourth moment closure is explicitly listed as a NO-GO without extra structure), and constructs a local affine witness — v=0 and λ₂(S_u)>0 holding simultaneously — showing that the zero set itself is not an automatically safe branch; it also establishes a low-amplitude trichotomy (amplitude cliff ∨ directional pivot ∨ gauge-Hessian blow-up). The route halts at STOP-C24 (normalized-deformation intermittency / zero-set-degeneracy gap), passing the baton to the next round to track the dynamics of μ_Q and K_S themselves, rather than the location of the zero set.
[document] X72-62: Neutral Residual Cancellation and the Quarter-Power Matching Law
Continuing from Round 61's approach of compressing the error budget into a fast-Schur graph and a slow-Riccati part (STOP-C65), this round examines the remainder that actually acts along the neutral direction after Schur elimination, proving that the neutral residual cancels exactly down to S_n=48K³/n³+O(n⁻⁴) (rather than the originally estimated O(n⁻²)), so the neutral-root drift is only cubic order, and derives the asymptotic viscous-coupling corrections 1+j⁻¹ and 1+2j⁻¹ for the two parities. On this basis it rebalances the three post-Schur error terms, correcting the optimal overlap exponent from Round 61's 2/7 back to α*=1/4, restoring the
[document] X72-05: Nonlocal Cancellation and Gradient-Stress Alignment
Continuing from Round 04's STOP-C07/C08, this round reverses the order of derivation, first using the strain–vorticity orthogonality ⟨−ΔS, ω⊗ω⟩ = 0 and other global projections to cancel the pressure and the explicit vorticity term, and proves that STOP-C07 is not a dead end for the growth of ‖S‖_{H^1}: the pressure can be cancelled exactly by projection without truncating the full Navier–Stokes dynamics. This yields a new exact identity, (1/2) d/dt ‖S‖²_{H1} + ν‖ΔS‖² = 3∫Λ_G|∇S|² dx, where the gradient-stress tensor G[S] is positive semidefinite and Λ_G is the weighted alignment coefficient with the compressive eigendirection; also proves a rigidity result: coincidence with the model-cone equality forces S ≡ 0. Finally stops at STOP-C09 (the gradient-stress/compressive-alignment coercivity gap): whether α_ν ≤ 1 holds identically remains unproven, handing off to the next round's study of the dynamics of Λ_G/α_ν.
[document] X72-25: Nonlocal Cross-Blob Virtual Connectivity
Continuing from Round 24's result that 'local viscous neck communication can be made arbitrarily slow by separation distance,' this round reintroduces the nonlocal pressure Hessian and whole-space Biot–Savart strain/velocity coupling, measuring the decay rate of the cross-region field: cross-velocity ~R⁻², cross-strain and cross-pressure-Hessian ~R⁻³, whereas neck heat diffusion decays in a Gaussian/exponential fashion — so at fixed time and large separation the algebraic coupling can dominate the Gaussian neck communication. But it proves that the cross-term sign has no universal direction (the cross sign of both strain and pressure is indefinite), and that virtual connectivity does not imply positive conductance, thereby clearly distinguishing two independent concepts — 'mass conductance h_Q' and 'nonlocal dynamical connection' (duplex connectivity). The route halts at STOP-C29 (virtual-connectivity / sign-coherence gap), passing the baton to the next round to ask whether strain geometry or critical-mass tilt can force this signed kernel toward synchronization on the dangerous branch.
[document] Methodology: Ontological-Discreteness Proof Obligation
Proposes the Ontological-Discreteness Proof Obligation: whoever claims that 'the universe is, at the ontological level, a discrete computational system' must prove that its discreteness is not an artifact of the representation — of measurement, coordinates, a quantized spectrum, or a computational interface — but a structural invariant that cannot be eliminated under any lossless, equivalent representation. Distinguishes four non-equivalent claims — computability, digital representability, exact simulability, and constituting the ontology itself — and lists a five-step proof obligation (exact encoding, exact reconstruction, dynamical conjugacy, invariant preservation, essential discreteness). Also rejects the reverse smuggling move: failing to find essential discreteness does not imply the world must be continuous, so the legitimate epistemic states are at least four — continuous, discrete, mixed, and unknown.
[document] X72-15: Gauge-Hessian Distortion
Continuing from Round 14 (missing from this folder, but this round's hand-off section records that it already established the critical-quotient carrier Q(t), the nonlinear gauge div(|v|v) = 0 satisfied by the optimal representative v = u + ∇q, and the growth identity (1/3) dQ³/dt + νD = I_Q), this round directly analyzes the constraints the gauge places on ∇²q. Proves a curvature-payment dichotomy (positive gauge curvature must be paid for by physical compression or transverse gauge concavity) and a weighted-trace cancellation ∫r³Δq = 0, showing that only skew gauge curvature drives critical growth; and proves a nonlinear Hodge-gradient Pythagorean identity, E_U^{(M)} = D + H, where H is the non-negative gauge-Hessian distortion energy, yielding a necessary condition for growth, Ξ_Q = Q²H/(ν²D) ≳ 1, while an explicit axisymmetric vortex-field counterexample shows that the gauge condition does not automatically imply A_2 regularity of the weight. This round stops at STOP-C19 (the weighted-gauge-Hessian/quotient-dissipation gap): still missing H ≲ Q^{-2}ν²D or an integrable substitute for it, handing off to the next round's tracking of the dynamics of Ξ_Q via a continuous layer-cake decomposition.
[document] X72-31: Persistent-Lock Occupancy Capacity Problem
Picks up the gap left by Round 30 (STOP-C34: the Eulerian bulk L^p budget cannot directly control a single Lagrangian trace), and asks whether a persistent lock can occupy zero critical mass while still carrying a fixed share of the dangerous supply. Proves the Source–Occupancy Lemma by Cauchy–Schwarz, μ(A)≥β²/𝔍_W, and establishes the Vanishing-Occupancy Singularization Dichotomy: if a fixed source share corresponds to a vanishing occupancy measure, then either the participation ratio 𝔍_W must diverge, or the source becomes singular relative to the carrier measure. Under bounded source participation, Round 30's trace gap can be closed conditionally; the new gap STOP-C35 (Persistent-Lock Occupancy/Singular-Concentration Gap) is handed to the next round's source-participation dynamics.
[document] X72-42: Piola–Vorticity Visible Stress
Picks up Round 41's compression of the nonlocal Piola defect into the scalar 𝔙_ω=1/12|ω|²+1/4ℛ_iℛ_j(ω_iω_j) (STOP-C45), identifies it as the Riesz-visible projection of the trace-free vorticity stress W=ω⊗ω-1/3|ω|²I, and establishes the visible/invisible orthogonal decomposition together with the Vorticity-Stress Visibility Pythagorean identity. Proves that under this projection the transport–Riesz commutator only performs a conservative transfer of visible/invisible energy, without creating total quartic stress energy, so total stress growth can only come from vorticity–strain alignment and diffusion; the genuine remaining nonlocal obstruction is whether the double-divergence-free invisible stress itself carries extra compensating regularity. STOP-C46 (Visible–Invisible Vorticity-Stress Transfer/Double-Divergence Compensation Gap) hands this problem to the next round.
[document] X72-37: Pressure-Response Defect Energy
Picks up Round 36's proof that cofactor–pressure replenishment coherence has no universal dephasing, and that affine strain can achieve a perfect response H_p^0=-C_S^0 (STOP-C40). This round defines the affine-response defect E_p=H_p^0+C_S^0, and derives its exact PDE and the (moving-domain) defect-energy budget. Proves that the local strain coupling in the defect equation is not coercive: the pure-strain self-forcing and the explicit determinant source cancel exactly in defect coordinates, and the genuine remaining forcing consists of three terms — vorticity, gradient terms, and the transport–Riesz commutator. Critical control comes down to S∈L_t²L_x³; STOP-C41 (Affine-Response Defect/Critical Commutator–Gradient Gap) hands the remaining nonlocal forcing to the next round's analysis of transport–Riesz commutator depletion.
[document] X72-69: Rank-One Scattering Tangent and Affine Endpoint Repair
Continuing from Round 68's coarse-derivative bridge target (STOP-C72), this round first corrects a technical defect: it points out that the block-diagonal proxy used for the endpoint in Rounds 61–62 omitted the particular-solution response that the even minimal mode is forced into through the ν=0 odd equation, and that the true endpoint plane must include this affine correction term — this correction does not affect the existing theorems of Round 59, 56, 61–62, 64–68, but it demotes those two rounds' principal-angle numerical constants to a superseded proxy diagnostic. Starting afresh from the corrected endpoint plane, it proves the structural fact that the parity transfer matrix depends only on μ=ν², yielding the
[document] X72-03: Relational Geometry and the Coercivity Gap
Continuing from Round 02's three critical-carrier barriers, this round no longer relies on a single critical amplitude, and instead keeps the full relational geometry — the strain tensor S, vorticity ω, eigenvalues, and alignment angle. Proves that 'amplitude-only observation fails': S_grow = diag(−2a,a,a) and S_decay = diag(−a,−a,2a) have the same amplitude but opposite-sign determinants, so a single scalar amplitude cannot preserve the sign generated by the nonlinearity — a single-observable rejection theorem X_{Γ_amp} within a restricted context. Establishes a conditional closure criterion from the middle eigenvalue λ2 and the aligned strain σ, but proves that a constant geometric dissipation factor does not change the superlinear closure class. Finally stops at STOP-C06 (the relational-geometry/coercivity gap): the geometry has recovered the sign and a conditional criterion, but no theorem yet forces the Navier–Stokes dynamics itself into the safe region, handing off to the next round's direct study of the geometric evolution dynamics.
[document] X72-22: Relative-Source Continuous Tilt Curvature
Continuing from Round 21's abstract relative source R_S and intermittency production 𝒫_sel (STOP-C25), this round decomposes R_S in full into six exact components — strain self-amplification, vorticity coupling, pressure Hessian, quotient growth, relative diffusion, and gauge maintenance — and re-integrates the discrete p=0,2,4 moments into a continuous moment-order tilt family μ_p, p∈[0,∞). It proves the exact logarithmic intermittency law (log𝔍_S)'=-8ν⟨|∇logK|²⟩₄+3[⟨G_Q⟩₄-2⟨G_Q⟩₂+⟨G_Q⟩₀]+2[⟨R_S⟩₄-⟨R_S⟩₂], and obtains a weighted pressure-commutator identity, showing that the pressure relative source survives only through a weight-gradient commutator. The route halts at STOP-C26 (continuous-tilt-selection / relative-source gap): whether the continuous tilt bias must be suppressed by relative Fisher smoothing remains unknown, passing the baton to the next round to substitute Round 19's λ₂⁺ and confluence ratio χ_C into this tilt-covariance law for a genuine coupled test.
[document] X72-56: Rigorous Adjoint-Tail Bound and Central-Coefficient Positivity
Building on Round 55's compression of the entire obstruction into a single positivity question, this round no longer relies on finite-truncation extrapolation, but instead builds a Banach fixed-point tail construction for the infinite-dimensional adjoint recursion, using exact algebraic root isolation to prove that the tail map becomes a strict contraction beyond a sufficiently deep sideband — thereby rigorously proving the unique existence of a regular, bounded, minimal adjoint mode. This rigorously establishes a positive lower bound on the central coefficient, and combined with Round 55's same-sign result, rigorously excludes a complete second-order analytic rescue on both source-hidden circles at the normalized viscosity — the first time in this branch that a rescue question has been closed by an infinite-tail argument, rather than by finite truncation or numerical extrapolation. Route halts at STOP-C60 (viscosity-parameter continuation / global-hidden-manifold gap): this closure holds only for a single normalized viscosity value, does not yet cover all positive viscosities, and does not cover hidden manifolds outside this circular-Beltrami reference frame, handed to the next round to perform the viscosity continuation; this round also includes a numerical-verification script.
[document] X72-71: Secant Riccati Linear-Viscosity Jost Bridge
Continuing from the difficulty left by Round 70, where the tangent kernel and the local source produce unnecessary cancellation at minimal ν (STOP-C74), this round instead compares the secant difference ΔR_n=R_n^ν-R_n^0 rather than the tangent derivative, proving the
[document] X72-51: Second-Order Invisible-Manifold Correction and the Viscous-Curvature Obstruction
Building on the two non-Beltrami source-hidden circles left by Round 50 (first-order state and source both hidden, yet the visibility carrier itself is nonzero), this round solves the corresponding second-order state-correction equation. Proves that although the correction term can be solved explicitly within the minimal two-sideband correction class, the central second-order source contains a viscous-curvature term independent of the correction's degrees of freedom, one that is nonvanishing on both source-hidden circles — so the minimal correction class cannot achieve second-order source cancellation. Route halts at STOP-C55 (viscous-curvature / coupled-Floquet-rescue gap): this round explicitly states that it has not ruled out a possible rescue from the homogeneous kernel of higher-sideband coupling, so this is only a negative result for the minimal correction class, not a complete second-order impossibility theorem — handed to the next round to test whether the hidden kernel can provide such a rescue; this round also includes a numerical-verification script.
[document] X72-26: Signed-Kernel Quadrupole Coherence
Continuing from Round 25's proven duplex connectivity and the signed kernel's lack of universal direction (STOP-C29), this round analyzes directly the angular structure of the pressure Hessian and the Biot–Savart cross-strain kernel on the sphere, establishing an exact 'amplitude × anisotropy × coherence' factorization. It proves that both kernels have zero mean and finite variance under the isotropic spherical average (pressure angular variance 2|S|²/15, cross-strain angular variance |ω×n|²/15), and that dangerous middle-strain λ₂>0 does not entail a synchronized sign — even on the dangerous branch, a universal synchronization lower bound is explicitly excluded. The route halts at STOP-C30 (quadrupole-coherence / synchronization-bias gap): there is no dynamical or statistical mechanism forcing positive synchronized coherence, passing the baton to the next round to study how coherence itself — rather than its static sign — evolves under the NS dynamics.
[document] X72-33: Signed-Source Cancellation Renormalization
Picks up STOP-C36 from Round 32 — the positive parts of determinant, Q-growth, and pair-kernel sources cannot be controlled by the Fisher mechanism — and, instead of forcing sources to be positive, builds a lossless accounting system for signed sources via a Jordan decomposition (M_W, V_W, cancellation coefficient c_W). Proves that positive sources admit a Jordan reconstruction, that determinant interfaces can be renormalized by a Kato-type method, and that even Calderón–Zygmund pair kernels can be renormalized by second-order differencing and are locally finite under this regularity — but the original positive-part pair source is itself not lossless. This motivates the Cancellation-First Principle; STOP-C37 (Signed-Variation/Cancellation-Renormalization Budget Gap) hands the study of cancellation-budget dynamics to the next round.
[document] X72-60: Singular Boundary-Layer WKB Matching Law
Continuing from the endpoint Green-functional positivity proved in Round 59, this round addresses the gap it left behind — the singular matching limit a₃(ν)/ν→c₀ at fixed ν. It finds that the true neutral-to-minimal decay layer is not the ν^(-1/2) scale suggested by the original coarse Banach estimate, but rather the cubic WKB decay scale ν^(-1/3), derives the reduced 2×2 slow-pair transfer matrix and its exact stable multiplier λ₋(a)=e^(-2 arsinh(a/2)), and verifies this scaling's convergence with direct numerical solution of the full recurrence (at ν=10⁻⁷ the observed/predicted half-decay ratio reaches 0.987–0.995). This round explicitly states that the matching limit has not yet been elevated to a theorem; the gap shifts to STOP-C64 (the WKB stable-bundle/rigorous-matching gap), left for the next round; this round includes numerical verification scripts and CSV data.
[document] X72-58: Small-Viscosity Singular Adjoint Limit and the Bounded Neutral Correction Term
Building on Round 57's conjecture that 'the central coefficient tends to zero linearly at small viscosity,' this round no longer extrapolates numerically toward small viscosity, but instead rescales the odd and even parts of the adjoint recursion at different scales, deriving an endpoint system that depends only on the square of the viscosity: at zero viscosity the even part is a minimal Euler mode with super-factorial decay, while the odd part is not an analytic tail at all but a bounded neutral mode tending to a constant — from which an exact asymptotic law and a stable endpoint slope constant are derived. This round also points out that the value Round 57 obtained by raw extrapolation from very shallow viscosity — which appeared to correspond to the endpoint constant — is in fact an artifact contaminated by singular truncation, not one genuinely derived from the correct endpoint system, thereby correcting the previous round's basis for inference. Route halts at STOP-C62 (bounded-neutral Green/Jost endpoint gap): although the value of the endpoint slope constant is numerically stable, it has not yet been rigorously proved within the full infinite-dimensional operator topology, handed to the next round to rigorously construct the endpoint Green/Jost functional; this round also includes a numerical-verification script and CSV data.
[document] X72-32: Source-Participation Dynamics Renormalization
Picks up the participation ratio 𝔍_W to which Round 31 compressed the persistent-lock occupancy problem (STOP-C35), and builds an exact tilt dynamics for the relative critical mass of general smooth positive sources. Proves that (log𝔍_W)' is given exactly by three terms — viscous Fisher information, tilt selection, and relative-source bias — so smooth positive sources possess a universal viscous anti-concentration structure, and Round 31's occupancy gap can be closed conditionally on this class of sources. At the same time, it shows that three classes of genuinely dangerous sources — determinant sources, positive-Q-growth sources, and pair singular kernels — all carry a sign interface or a near-diagonal singular kernel whose positive part cannot be controlled by the same mechanism; the pair kernel's positive-part measure may even diverge near the diagonal. STOP-C36 (Source-Participation Trapping/Singular-Source Renormalization Gap) hands the problem of signed sources to the next round.
[document] X72-41: Special Cofactor and Piola Vorticity
Picks up Round 40's compression of the Hardy–BMO dual route into the special cofactor commutator 𝒜_C=[u·∇,𝒯_0*]C (STOP-C44), and, rather than treating C as an arbitrary tensor, uses its centered symmetry, incompressibility, and the cofactor's quadratic algebra to look for extra cancellation invisible to the standard CRW/BMO estimates. Proves that the affine first-order increment cancels exactly (the locally smooth commutator is O(ℓ²)), but that the second-order jet curvature of a general rotational branch can be nonzero, so no universal third-order cancellation exists; further proves that the special cofactor's nonlocal scalar projection decomposes exactly into a local pressure-source part plus a Piola-type (div cof=0) vorticity-stress defect. STOP-C45 (Affine-Jet Cancellation/Piola–Vorticity Endpoint Gap) hands the remaining critical endpoint problem to the next round's Piola–vorticity-stress dynamics.
[document] X72-08: Transfer-Dispersion Covariance Feedback
Continuing from Round 07's STOP-C11, this round tests the hypothesis that 'spectral variance automatically suppresses nonlinear transfer.' Proves a universal lower bound for the viscous covariance, Cov(r,r²) ≥ mV, which is always positive, but refutes — by an explicit counterexample (a two-point frequency measure) — that the variance must decrease monotonically under pure diffusion, and also refutes that a single α can determine the direction of spectral drift (a single-observable rejection theorem X_{Γ_α} in another restricted context). The original hypothesis is thus not proven; the problem is compressed exactly into the covariance comparison ζ_{τ,s} = Cov(r,ϑ)/(νCov(r,r²)) ≤ 1, stopping at STOP-C12 (the nonlinear-transfer/dispersion-covariance gap), and handing off to the next round's substitution of the actual Navier–Stokes Fourier-triad convolution expansion for ϑ.
[document] X72-38: Transport–Riesz Commutator Depletion
Picks up Round 37's compression of the remaining nonlocal forcing into the transport–Riesz commutator [u·∇,𝒯_0]q (STOP-C41), and points out that treating this commutator with only a norm envelope was too crude; instead it studies the defect-energy pairing ⟨E,[u·∇,𝒯_0]q⟩ directly. Using the self-adjoint structure of 𝒯_0, incompressibility, and the even-kernel symmetry, it proves the Pressure Self-Commutator Null Identity and an exact triple-increment representation, reducing the regularity burden exactly to the one-total-derivative critical endpoint problem s_u+s_E+s_q=1 (closure follows once this exceeds 1). STOP-C42 (Triple-Increment Endpoint/Critical Dini Gap) hands the gap to the next round to look for a Dini/log endpoint gain.
[document] X72-10: Triad Phase Dynamics and Phase Locking
Continuing from Round 09's STOP-C13, this round directly derives the exact equation for the interaction phase Φ = arg Z, namely Z' + νΣ_{kpq}Z = Q. Proves the viscosity-neutral phase-rotation theorem: viscosity only damps the triad amplitude and does not directly rotate the phase (dissipation and dephasing are different mechanisms), and uses a non-stationary phase-cancellation lemma to prove that persistent same-sign transfer requires phase locking or strong modulation, with the locking condition exactly equivalent to Q = λZ for real λ — a state in which viscosity likewise cannot break up the already-locked phase. Differentiating Q naturally raises the interaction order from cubic to quartic, the first apparently natural-looking integer index to surface on this route, but this round rules that it does not yet constitute essential-discreteness evidence, and proposes replacing the order-by-order expansion with continuous re-integration via a generating functional, stopping at STOP-C14 (the nonlinear-phase-locking/four-body-network gap).
[document] X72-54: Two-Sided Minimal Floquet Matching and Fredholm Defect
Building on Round 53's conclusion that 'a complete analytic rescue must select the minimal branch,' this round restores both the even and odd viscous coupling channels simultaneously, proves that the full six-step frozen recursion is a reciprocal sextic equation with no root on the unit circle for any positive viscosity, splitting exactly into three growing and three minimal reciprocal solutions. Redoing the physical finite truncation with the original divergence-free Fourier coefficients (free of representational redundancy), it stably exhibits two localized source-hidden modes and two localized adjoint-kernel modes, and Round 51's complete second-order source target has a stable nonzero projection onto them; under normalized viscosity, the minimal range-defect on the two source fibers stabilizes at about 0.965 and 0.994, respectively. Route halts at STOP-C58 (local-adjoint Fredholm / infinite-matching-proof gap): these figures are for now only truncation-stable numerical evidence, not yet upgraded to an infinite-dimensional theorem, handed to the next round to construct the infinite adjoint minimal solution and prove the matching is genuinely nonzero; this round also includes a numerical-verification script.
[document] X72-64: Validated Viscosity Half-Line Positive Adjoint Theorem
Continuing from Round 63's convergence of the small-viscosity gap to a selection problem for a single slow Jost scattering line (STOP-C67), this round changes strategy: rather than attacking the singular ν→0⁺ matching head-on, it closes the compact viscosity segment piece by piece using
[document] X72-57: Viscosity Continuation and the Adjoint-Positivity Bifurcation Map
Building on Round 56's rigorous closure at a single normalized viscosity, this round restores viscosity to a continuous parameter and investigates whether the regular central coefficient can change sign as viscosity varies. Proves that the tail contraction coefficient admits an exact scaling decomposition in viscosity, so that any fixed positive viscosity can push the onset of strict contraction out to a sufficiently deep sideband — meaning that if positivity were to fail, it could only happen at the finite-core matching or at some isolated zero, never out at the tail's infinity; a logarithmic sweep across eight orders of magnitude in viscosity shows the coefficient staying positive on both source fibers, exhibiting a positive linear asymptotic law as viscosity tends to zero and an inversely proportional asymptotic law as it tends to infinity. Route halts at STOP-C61 (viscosity-uniform positivity / endpoint-continuation gap): the absence of a zero across the entire interval is for now supported only by a high-resolution numerical sweep, not a proven theorem, handed to the next round to treat the singular endpoint at small viscosity; this round also includes a numerical-verification script and CSV data.
[document] X72-45: Visibility-Replicator Dynamics
Picks up Round 44's proof that neither static divdiv geometry nor actual quadratic vorticity realizability can eliminate the first-order transfer between visible and invisible stress (STOP-C48). This round stops the static attack and studies directly the exact dynamics of the visibility ratio η_ω=‖W_L‖_2²/(‖W_L‖_2²+‖W_T‖_2²), splitting it into four terms: stretching selection, Laplacian scale selection, gradient-stress selection, and the conservative Riesz transfer. Proves that a pure sector is stationary at first order but generically receives cross-sector injection at second order — so no universal visibility-evolution direction exists (universal visibility direction is false) — while an exact periodic Beltrami purely-invisible invariant branch also exists; a bounded Piola defect under quartic growth can force η_ω→0. STOP-C49 (Visibility Replicator/Boundary-Injection Compatibility Gap) hands the problem to the next round's analysis of invisible-escape boundary-injection depletion.
[document] X72-44: Vorticity-Stress Triad Realizability
Picks up STOP-C47 left by Round 43 — the abstract divdiv constraint has a full wave cone, yet is not enough to rule out a first-order transfer — and switches to periodic vorticity Fourier modes genuinely satisfying ∇·ω=0, testing directly whether invisible-stress modes and the visible/invisible transfer can actually be generated by real vorticity. Constructs an explicit divergence-free vorticity-triad witness (Fourier Cone Deconfinement), and proves that the actual visible/invisible transfer is nonzero and remains a sharp, one-derivative-order transfer at high frequency — directly refuting the algebraic shortcut that
[document] X72-18: Weighted Strain-Vorticity Obstruction Confluence
Continuing from Round 17's critical weighted physical-gradient carrying quantity E_M (whose finite space-time integral would control Q), this round decomposes E_M exactly into longitudinal/tangential strain-vorticity components, proving that the base carrying quantity W_SV satisfies W_SV≤E_M≤2W_SV, with the directional-misalignment term nonnegative and inessential for budget equivalence. From this it proves the chain: critical blow-up of Q ⇒ divergence of enstrophy dissipation ⇒ divergence of vortex-line stretching ⇒ divergence of positive middle-strain activity, which brings this long route — developed out of the quotient/Hodge line — back into confluence with the original strain-vorticity obstruction core of Round 03, forming an 'obstruction confluence loop' rather than a circular argument, since new necessary structure (gauge, curvature, continuous danger layers) was acquired along the way. The route halts at STOP-C22 (weighted-enstrophy / vortex-line-stretching return gap), passing the baton to the next round to launch a dual-path coupled attack on the confluence core.

number-theory · 1

[hub] Number-Theoretic Conjectures
Overview of number-theoretic conjectures: the Goldbach reverse-structure closure program, the base-space prime-fitting operator program for Legendre's conjecture, and the perfect cuboid — three lines of research about the integers, none of which claims to prove its conjecture; this page only routes.

p-np-dual · 26

[case-hub] P/NP Dual-Proof Rehearsal Research Zone
AMRAL case: P/NP Dual-Proof Rehearsal Research Zone. A dual-hypothesis rehearsal method — building both P=NP and P≠NP to their strongest versions simultaneously, attacking each other round by round under a shared model and shared resource ledger. 24 rounds advance in sequence, each fixing in place both sides' strongest current claims, thought experiments, a review against known barriers, and the wrong paths that were ruled out — not rushing to declare a proof complete.
[document] From Cognitive Discovery to an Executable World: Mathematical Construction—State-Machine Intermediary Layer
A preliminary document for the P/NP Dual-Hypothesis Rehearsal research area. Fills in the intermediary layer missing from the original P/NP Cognitive Dynamics series: how cognitive discovery becomes a repeatably executable capability, via formal specification, mathematical construction, substrate encoding, and state transition. Expands the three-stage time model (search/execution/verification) into six stages, and proposes three core theses: the Construction-Intermediary Principle, the Complexity-Transfer Principle, and the Historical-Capability-Condensation Principle.
[document] Can the Existential Quantifier Be Compressed by a Mathematical State Machine?
Round 1 of the P/NP Dual-Proof Rehearsal research area. Establishes the dual-hypothesis rehearsal method: build both P=NP and P≠NP to their strongest respective versions and have them attack each other under the same model, the same resource ledger, and the same correctness standard. Extracts the existential quantifier EX_V(x) as the shared arena, and establishes the existential-quantifier compressor C_∃ as the common object of study for every subsequent round. The three barriers — relativization, natural proofs, and algebrization — make their first appearance as reviewers.
[document] The Battle for a Cross-Representation Invariant: After the Existential Quantifier Collapses, What Must Still Remain?
Round 2 of the P/NP Dual-Hypothesis Rehearsal. Proposes the residual distinguishable load H_res as the first local invariant, forming a genuine semantic lower bound within the fixed-cut state-machine model — but Team Equal escapes along five routes: variable reordering, re-reading the input, global summarization, dimension expansion, and switching representations. Establishes a six-part qualification test for candidate invariants (semantic-ness, cross-representation robustness, non-circularity, and others), and the parity function PARITY breaks the intuition that “large candidate count = need for exponential state.” Score currently tied 1:1.
[document] Algorithmic-Trajectory Cuts and the Causal Bottleneck: Must Every Exact Solver Expose a Distinguishable Bottleneck?
Round 3 of the P/NP Dual-Hypothesis Rehearsal. Drops the externally imposed cut and instead studies the algorithm's own computational history. Team Equal breaks the simple information-bottleneck argument — a general Turing machine can re-read its input, identical configurations don't imply identical futures, and the input carries only O(n) bits of information; PARITY again demonstrates that the number of candidates need not equal the amount of information that must be transmitted. Team Not-Equal responds by upgrading its object of study from “distinguishable information” to causal reconstruction complexity (CRC), but is immediately warned that defining CRC directly as the minimum solving time would be circular. Score currently tied 2:2.
[document] The Local–Global Barrier and Representation Escape: Does Global Coupling Really Mean Computational Hardness?
Round 4 of the P/NP Dual-Hypothesis Rehearsal. Uses Tseitin parity constraints to build an almost perfect case of local–global divergence (every proper subsystem is satisfiable, yet the full system is not), which does carry exponential lower bounds in proof systems such as resolution. But Team Equal immediately points out that Tseitin constraints are essentially a linear system over F2 — solvable in polynomial time by Gaussian elimination, and in fact simply summing all the equations yields 0=1. Local–global divergence does not imply general computational hardness; the real question is whether the global structure can be moved to a different coordinate system. Proposes the representation-escape tournament and the representation-resistant coupling core (RRCC) as long-term goals. Score currently tied 3:3.
[document] The Representation-Escape Tournament: Which Hardness Falls to Which Mathematical Weapon?
Round 5 of the P/NP Dual-Hypothesis Rehearsal. Rather than guessing at an ultimate invariant, this round runs a representation-escape tournament: Tseitin/XOR, Pigeonhole, Clique, general SAT, and the TSP/CUT/Stable-Set polytopes are each pitted against six weapons — resolution, algebrization, monotone circuits, treewidth decomposition, knowledge compilation, and LP extended formulations — recording “escape” or “lower bound” cell by cell. The matrix shows that no row forms a general lower bound across every column, and no single weapon escapes universally. Proposes the representation-escape profile (REP). Score currently tied 4:4.
[document] The Polynomial Representation-Transformation Closure and the Closure Paradox: Can the Escape Hatch Be Formalized?
Round 6 of the P/NP Dual-Hypothesis Rehearsal. Attempts to formalize “representation revolution” as a polynomial representation-transformation closure, but instead proves the Tractable-Reachability Equivalence lemma: whether SAT can reach a tractable normal form within the full polynomial closure is exactly equivalent to P=NP — too wide a closure collapses into a tautology, too narrow a closure yields only restricted-model lower bounds. This is the “representation-closure paradox.” The research focus shifts from representation size to “which algebraic structure is preserved under the transformation,” with Schaefer's dichotomy theorem and CSP polymorphism offered as success stories. Score currently tied 5:5.
[document] The Battle for an Algebraic Invariant: Does Every Easy Problem Have a “Composable Solution Structure”?
Round 7 of the P/NP Dual-Hypothesis Rehearsal. Uses the Horn/dual-Horn/bijunctive/affine classes of Schaefer's Boolean CSP dichotomy and the polymorphism theory behind the finite-domain CSP dichotomy as the first genuinely syntax-independent example of a tractability invariant. But Team Equal catches a critical gap: the hard side of CSP dichotomy only establishes NP-completeness, which is not unconditionally outside P — if P=NP, these languages still have polynomial-time algorithms. Proposes the Algorithm-to-Algebra Bridge Problem: does every P algorithm necessarily induce some nontrivial preserved structure? Score currently tied 6:6.
[document] Algorithm–Algebra Bridge Stress Test: From Matching, Flow, and Determinant to Exact Quotient Structure
P/NP Dual-Hypothesis Rehearsal, Round 8. Deliberately stress-tests the algorithm–algebra bridge with problems that have no obvious classical solution closure yet are genuinely in P: general-graph maximum matching (Edmonds blossom contraction), maximum flow (residual networks), determinants (Gaussian elimination), shortest paths (semiring aggregation), and treewidth dynamic programming (boundary summaries). The pattern that keeps recurring is exact quotienting: collapsing a huge set of candidates equivalent with respect to the future answer into a polynomial-size summary. Proposes PEQS, but the Equals Team immediately points out that allowing any solver's internal state to serve as the summary would make PEQS degenerate into a tautology for “L∈P.” Tentative score: 7:7.
[document] Hunting for SAT's Blossom: Exact-Quotienting Candidates, Representational Counterkills, and Quotient Debt
P/NP Dual-Hypothesis Rehearsal, Round 9. Works directly on the Equals Team's behalf, taking six real-world SAT-quotienting techniques (variable elimination, OBDD/DNNF, XOR/affine extraction, symmetry quotients, backdoor condensation, and CDCL learned-clause compression) and checking each one in turn for whether it is SAT's blossom. The key counterexample: certain output-bit functions of integer division require exponential-size OBDDs under every variable ordering, yet the function itself is clearly computable in polynomial time — showing that representation blowup doesn't imply computational blowup, and can't even establish that a function is outside P. Proposes a Quotient Debt resource ledger. Tentative score: 8:8.
[document] Multi-Anti-Structure Cores and Heterogeneous Gluing Debt: Once All the Known Escape Hatches Are Sealed, Where Does the Difficulty Actually Lie?
P/NP Dual-Hypothesis Rehearsal, Round 10. Originally sets out to find a “multi-anti-structure core” that simultaneously defeats all six known quotienting techniques, but immediately self-corrects: even if one is found, it would only prove hardness against the currently listed arsenal, not general intractability. The round's real payoff runs the other way: each local constraint is easy on its own (all-positive 3-clauses are satisfied by setting everything to 1, all-negative 3-clauses by setting everything to 0), yet Monotone 3-SAT, which mixes the two, is NP-complete — local tractability is not closed under simple addition. Proposes Heterogeneous Gluing Debt (HGD) and a Polymorphism Intersection Spectrum (PIS); the Equals Team counters with Dynamic Algebra Switching. Tentative score: 9:9.
[document] Collapse of the Shared Preservation Structure and Dynamic Bridging: Does the Interface Between Locally Solvable Modules Regenerate an Existential Quantifier?
P/NP Dual-Hypothesis Rehearsal, Round 11. After the problem is split into local modules, each module eliminates its private variables and keeps only a Boundary Extension Relation (BER) — but the shared boundary still has to be coordinated globally: “Existential Quantifier Reappearance” — local elimination doesn't guarantee global elimination; it may simply have relocated the quantifier to the interface. The Equals Team uses real SMT techniques — Nelson-Oppen, DPLL(T), CDCL(⊕) — to show that Dynamic Algebra Switching genuinely exists; the Not-Equals Team counters that if a bridge could unconditionally combine any solvable local modules in polynomial time, the bridge itself would already be a SAT solver — the Bridging Universality Trap. Tentative score: 10:10.
[document] The Interface Language Lattice, the Schaefer Threshold, and Recursive SAT: Does a Stronger Bridge Come Closer to Regenerating the Original Problem?
P/NP Dual-Hypothesis Rehearsal, Round 12. Corrects the “bridging language hierarchy” into the poset/co-clone lattice induced by pp-definability, rather than a linear strong-weak ordering. If a fixed Boolean bridge language falls into a Schaefer-tractable family, the coordination problem is in P; otherwise it's NP-complete — but NP-complete doesn't mean it's been proven not in P. The union of several individually tractable bridge languages need not itself be tractable (the Portfolio Union Principle). Defines Recursive SAT: existential quantifiers eliminated layer by layer, only to reappear layer by layer at a higher interface. Tentative score: 11:11.
[document] Tractable Closure Stability and Polynomial Chain Blowup: If Every Step Is Easy, Is the Whole Path Necessarily Easy?
P/NP Dual-Hypothesis Rehearsal, Round 13. Proves a simple but crucial combinatorial fact: each step being a polynomial transformation relative to the current representation size does not mean the whole trajectory is polynomial in the original input — if s_(t+1)=s_t^2, then s_m=n^(2^m), and as soon as the number of steps grows with the input, this quickly exceeds any fixed polynomial bound. Formally distinguishes Stepwise Polynomiality from Pathwise Polynomiality, and proposes Tractable Closure Stability (TCS), which requires the peak size, cumulative cost, and bridging depth over the entire run to all stay within a uniform polynomial bound relative to the original input. Tentative score: 12:12.
[document] The Complexity Potential-Function Game: Amortized Tractability Certificates, Potential-Function Escape, and the Certificate-Completeness Trap
P/NP Dual-Hypothesis Rehearsal, Round 14. Formally imports the potential-function method from standard amortized analysis: a telescoping sum proves that as long as the initial potential, the per-step amortized cost, and the number of steps are all polynomially bounded, the cost of the entire trajectory is polynomial. But it uncovers a key asymmetry: the P=NP side only needs one algorithm-specific potential function to exist, while the P≠NP side, if it wants to argue a lower bound from “no potential function can be found,” must first prove that the certificate system is complete for all P algorithms — too weak, and it misses genuine algorithms; too strong, and it smuggles the original problem into the potential function itself. Tentative score: 13:13.
[document] Tractability Proof System: Tractability Certificates, Normal-Form Escape, and Clocked Enumeration
P/NP Dual-Hypothesis Rehearsal, Round 15. Distinguishes three different notions of completeness: deciding, for an arbitrary machine, whether it runs in polynomial time (undecidable in general); whether every polynomial-time machine has a verifiable proof of that fact; and whether every P-computable function has an equivalent normal form in a restricted syntax (already a mature theory via Bellantoni-Cook and Cobham). The Equals Team's new strategy: construct SAT directly within a normal-form language for P. The Not-Equals Team's counterpart: find a semantic invariant preserved by the entire grammar-generation ruleset but violated by SAT (a Grammar Invariant Program). Also establishes the clocked Turing machine as a second normal form. Tentative score: 14:14.
[document] Clocked Diagonalization and the Uniform Exponent Barrier: Once P Is Enumerated, Can You Diagonalize Directly?
P/NP Dual-Hypothesis Rehearsal, Round 16. Since P can be effectively enumerated as clocked machines C₁, C₂, ..., the intuitive next move is to diagonalize and construct L_D∉P that still stays in NP. The real breaking point: ∀k∃L_k(P\DTIME(n^k) is nonempty) cannot have its quantifiers swapped into ∃L∀k — the Polynomial Union Quantifier Trap (PUQT). The exponent k_i a naive diagonalizer needs grows unboundedly with the enumeration, yet an NP witness requires a single fixed constant K, producing the Uniform Exponent Barrier (UEB); trying the full computation trace as the witness instead runs into Certificate Exponent Explosion (CEE); and padding just converts the time cost into the Length Inflation Dilemma (LID). Closes with a Baker-Gill-Solovay relativization stress test. Tentative score: 15:15.
[document] Uniform Computation Certificate Compression and Universalization Jump: From Trace Compression to EXPTIME-Completeness Reversal
Round 17 of the P/NP Dual-Hypothesis Rehearsal. Confirms that a long computation doesn't imply a long proof — PCP, IP, and succinct arguments all show verification cost can be compressed dramatically. But once UCPE is defined (a universal bounded-halting problem that folds machine, input, and clock exponent all into one unified input), a striking reversal appears: every fixed slice lies in P, yet UCPE as a whole is EXPTIME-complete; assuming further that UCPE∈NP would directly force EXPTIME⊆NP, and combined with P⊊EXPTIME that gives P≠NP — pushing unified compression too hard instead hands the point straight to the Inequality Team. What's actually worth pursuing is certificate compression restricted to just the diagonal, self-referential slice. Provisional score: 16:16.
[document] Diagonal-Slice Compression and Sparsity Upward Separation Trap: Self-Reference Does Not Compress Proofs for Free
Round 18 of the P/NP Dual-Hypothesis Rehearsal. Narrows the diagonal construction down to just the special self-referential slice (C_i,x_i), only to find that if each machine is assigned a single diagonal point, the language becomes sparse by nature — and the Hartmanis-Immerman-Sewelson theorem says the existence of a sparse NP-P language is equivalent to a higher-order single-exponential deterministic/nondeterministic time separation. Sparsifying doesn't lower the proof threshold, it raises it (the Sparsity Upward-Separation Trap, SUST). Going dense instead runs straight back into the uniform-exponent barrier. Self-reference can supply the ability to point at yourself, not a free compression of the proof of yourself (the Self-Reference Compression Fallacy, SRCF). Provisional score 17:17.
[document] Block/Delayed Diagonalization: Density Escape, Stage Control, and Conditional Progress
Round 19 of the P/NP Dual-Hypothesis Rehearsal. Tests replacing single-point diagonalization with length blocks, stages, and delay. Proves that the exponential asymmetry at a given input size doesn't go away just by waiting (Same-Input Exponent Invariance, SIEI), and that blowing up a single diagonal bit to fill an entire block doesn't make it any cheaper (Amplification Knowledge Debt, AKD). The real Ladner-style delayed-diagonalization trick isn't to simulate further and further out — it's a stage controller that only advances once it has actually found finite counterexample evidence. But if the controller gets stuck forever, that may be exactly the signal that some candidate algorithm has succeeded (the Freeze-or-Separate Principle) — so the progress guarantee behind delayed diagonalization already presupposes P≠NP. Provisional score 18:18.
[document] Stage Controller Complexity: Logarithmic Horizons, Exponent Throttling, and Limit Monitors
Round 20 of the P/NP Dual-Hypothesis Rehearsal. Corrects the previous round: the controller's local computation cost can actually be compressed into polynomial time (checking only micro-instances within a logarithmic horizon, paired with exponential throttling that delays full verification of a given machine until the outer scale is large enough) — what genuinely can't be had for free is the global progress guarantee. Builds a Limit Separation Monitor (LSM): a computable stage function s(N) such that in a P≠NP world s(N)→∞, while in a P=NP world s(N) eventually stops at the first correct SAT machine — rewriting P/NP precisely as whether one trajectory “eventually stabilizes” or “advances without bound.” But this is still an asymptotic observation problem: no finite prefix can decide it. Provisional score 19:19.
[document] Quantifier Monitor Game and the Finite Certificate Hierarchy: From Limit Observation to the Σ₂⁰/Π₂⁰ Boundary
Round 21 of the P/NP Dual-Hypothesis Rehearsal. Rewrites P=NP as ∃i∀x R(i,x) (a Σ₂⁰-type statement) and P≠NP as ∀i∃x¬R(i,x) (a Π₂⁰-type statement); via an embedding of FIN/INF, the monitor's stabilization/unboundedness problems reach Σ₂⁰/Π₂⁰-completeness, so no general monitor can be captured by an ordinary finite witness — but that is not the same as saying
[document] Quantifier Compression Theorem and Finite Basis Game: Five Mathematical Templates for Compressing an Infinite Obligation into a Finite Structure
Round 22 of the P/NP Dual-Hypothesis Rehearsal. Surveys five mathematical templates that genuinely compress an infinite quantifier obligation into a finite structure: finite basis (Graph Minor), inductive closure (Bellantoni-Cook safe recursion), dual certificates (Farkas, max-flow/min-cut), algebraization (arithmetization, sum-check, IP=PSPACE), and algorithm-to-lower-bound transfer (Williams's ACC lower bound). Formalizes the Quantifier Compression Mechanism (QCM) and a six-part eligibility test; Cook-Reckhow and Natural Proofs are reminders that a universal short certificate isn't a free resource. Provisional score 21:21.
[document] Algorithmic WQO and the Semantic-Monotonicity Gap: Why Graph-Minor-Style Finite Obstructions Do Not Transfer Directly to P vs NP
Round 23 of the P/NP Dual-Hypothesis Rehearsal. Tests carrying the Graph-Minor-style finite forbidden-set over into algorithm space, and gets a correction: a WQO itself isn't hard to obtain — Higman lemma gives a subsequence WQO on program text, Kruskal tree theorem gives a homeomorphic-embedding WQO on syntax trees, and supercompilation has long used it as a termination tool. What actually fails is semantic monotonicity: a natural syntactic order almost never makes SAT correctness/failure monotone. The WQO--Semantic Alignment Barrier (WSAB), plus the Order Alignment Trilemma. Positive result: the derivation trees of Bellantoni–Cook's complete P grammar can directly carry a Kruskal-style WQO. Provisional score 22:22.
[document] Semantic Monotonicity Engineering: Abstract Interpretation, CEGAR, and the Precision–Effectivity–Order Trilemma
Round 24 of the P/NP Dual-Hypothesis Rehearsal (the concluding round of this series, the last of its 25 documents). Engineers a semantic abstraction directly using Abstract Interpretation (Cousot–Cousot) and CEGAR — and immediately undercuts itself: the two-point perfect abstraction, the GOOD/BAD domain, is small, is a WQO, and preserves correctness perfectly, but computing it is itself already a universal-correctness decision — the Abstraction Oracle Trap (AOT). What's actually needed is closing the Precision–Effectivity–Order Trilemma (PEO) all at once. CEGAR runs into the Counterexample Existential Asymmetry (CEA): a wrong answer has a finite counterexample to refine against, but a correct one never has any counterexample to work with. Provisional score 23:23; the series closes at this round, with the line of work then carried forward into Neo's own GLC dynamic four-layer closure framework.

perfect-cuboid · 40

[case-hub] The Perfect Cuboid: from the Continuous World and Radix Representation to Arithmetic Freedom
AMRAL case: a body of work on the perfect cuboid (a box whose three edges, three face diagonals and space diagonal are all integers) — the problem rewritten as a rational-point problem, elliptic curves and Chabauty machinery on the fixed slice k = 7/32, bounded exact searches, plus the Radical-FDRS line and the method lines FORC / GERES / SIO-X4 / X4-DMSD; no document claims to have found a perfect cuboid and none claims it does not exist.
[branch-hub] Method Lines of the Perfect Cuboid: FORC, GERES, SIO-X4, X4-DMSD, IGPC and TIFV
AMRAL case: the software and framework lines of the perfect-cuboid package — exact-rational search built from Stern–Brocot branches, product trees, modular gates, CRT lattices and persistent ledgers, producing bounded certificates, elliptic / genus-5 curves for the G2 fibres, 'body cuboid' near-misses of 20 shapes and an X4 shared-edge coupling engine; no document claims a perfect cuboid or a candidate for one.
[document] Frontier-Only Height-Bounded Enumeration and the Coverage Bridge, and the Incremental Height Ladder: No Perfect Cuboid When the Three Primitive Face-Triple Hypotenuses Are ≤ 20000
A bounded certificate: no perfect cuboid in this small range, not nonexistence.
[document] FORC: Fraction-Ontological Ratio Calculus for X4 Virtual Curvature and Exact Click Search
A methodology (a framework); it proves neither existence nor nonexistence.
[document] World Encoding and Candidate Ingestion for the Perfect Cuboid, and Rational-Point Fibre Search: 25 'Body Cuboid' Records That Are Not Perfect Cuboids
'Candidate' means an integer triple with exactly two integer face diagonals and an integer space diagonal (a body cuboid): every record is tagged NOT_PERFECT_CUBOID; the bounded scan finds no perfect point.
[document] Arithmetic Geometry and Birational Analysis of the G2 Fibre, and the Twin-Elliptic Perfect Gate: Each Coordinate Fibre Is a Genus-1 Curve and With the Perfect Gate It Is a Genus-5 Curve
Rigorous arithmetic geometry and a bounded scan: no perfect point.
[document] Global Equivalence Reconstruction and Scaling: A World-Model Methodology from Floating Geometry to Arithmetic Representatives
A research programme at the proposition-conjecture stage; no existence is claimed.
[document] IGPC: The Information-Geometric Perfect Cuboid — Propositions, Conjectures and World Stratification
Foundational propositions, a world model and conjectures that redefine the 'pre-layer' of the perfect cuboid; elementary and correct.
[document] SIO-X4: Completion Fibers, Latent Body Freedom and the Global Generating Kernel — a Bounded Temporary Closure of the First Stage
The status line of P20 is 'TEMPORARY SERIES CLOSURE — BOUNDED': a temporary closure of the first stage, only for the 104 worlds with H_E ≤ 20000.
[document] The Trajectory-Information Freedom Verification Methodology for the Perfect Cuboid (v0.2) and the Research Notes of This Round
A methodology draft and research notes (status 'Methodology Draft / Research Framework' and 'Research Notes / Non-proof'); the paper says that passing TIFV would not prove existence.
[document] X4-DMSD: Exact X–Four-Edge Joint Constraint Domains with Decimal Multiscale Search
A foundational methodology (a framework); it proves neither existence nor nonexistence.
[document] Exact X4 Joint Algebra and the Shared-Edge Scale-Coupling Engine: Three Face Joints Share Edges iff A·C·B′ = B·C′·A′
An elementary and correct shared-edge coupling algebra plus a real engine: 48 Euler bricks and 0 perfect cuboids at m ≤ 80.
[document] Reframing the Perfect Cuboid: It Is Not Primarily an Integer Search Problem
A preparatory research draft (Phase 0); the paper: 'this paper does not claim that a perfect cuboid must exist, nor infer existence of rational points from the infinitude of the real solution space'.
[document] The First-Manifestation Problem: From Rational Closure to the Minimal Primitive Cuboid
Conditional bookkeeping: the paper says 'this series does not misstate conditional inferences as existence proofs'.
[document] After the First Solution: Arithmetic Freedom of the Perfect Cuboid
The whole document is strictly conditional: the paper says 'the only thing immediately determined is M ≥ 1'.
[document] The Perfect Cuboid Center-Axis Rational Closure Theorem: An Exact Reformulation of the Perfect Cuboid Problem as Rational Closure on a Low-Dimensional Coupling Surface
An exact but elementary equivalence (the Pythagorean-triple parametrisation); §52 of the paper: 'so the classical Perfect Cuboid is still not solved by this paper'.
[document] Phase 1F-D: The Global Diagonal Restriction Re-derived in the Fixed-g Framework
A classification of a sub-family: the status line reads 're-derived independently; known in the literature (Korec, 1992)'.
[document] G2A: Nested-X Double-Square Closure — A Two-Parameter Exact Reduction of the Perfect Cuboid Problem
A bounded exact computational exclusion, not a proof: the paper says 'this is only a bounded exact computational exclusion' and 'the global problem remains open because k itself is free to vary over Q ∩ (0, 1)'.
[document] Elliptic Orbit Generation, the Local Mordell–Weil Sieve and the Five-Elliptic Decomposition of the Fixed-k Genus-5 Closure Curve
Exact structural results and a bounded computation; the paper: 'no claim is made that the rank is exactly one'.
[document] The Local Full-2-Descent Rank Theorem and the Rank-One Theorem for E_−: Exact Local Certification for the Fixed Slice k = 7/32
Two exact rank theorems with no existence or nonexistence claim.
[document] The Square-Lift Tower and Quadratic-Chabauty Admissibility: From the Fixed-k Genus-5 Curve to a Rational Conic, and the Genus 0 → 1 → 3 → 5 Rank–Genus Locking
Exact structural theorems; the papers: 'it does not yet compute that finite locus' and 'not yet proved: that the full perfect cuboid problem has no solution'.
[document] The 2-Primary Mordell–Weil Compatibility Sieve and the Dual-Quotient Mordell–Weil Sieve: Sylow-2 Projection, Clean-Prime Boundary Forcing and an Exact Genus-3 Height Exclusion
An exact partial sieve plus a bounded exact exclusion; the papers: 'the fixed slice k = 7/32 has not yet been globally eliminated' and 'the output is not yet a complete classification of C_2(Q)'.
[document] The Bielliptic Genus-2 Reduction and the Local Exact Verification Hand-off: an Exact Involution, Explicit Elliptic Quotients, a Corrected Dual-Quotient Sieve, Full-2 Descent and the Final Simultaneous Quartic Target
Exact structural theorems and an honest hand-off: 'no provisional item should be promoted without an independent exact rerun'; 'if proved, then k = 7/32 is globally excluded as a nondegenerate perfect-cuboid first-channel slice' is conditional.
[document] The First Surviving Diagonal Type g = p²q: the Seven-State System, Four Unresolved Classes and 57 → 42 → 22 Orbits
This is the surviving frontier, not a result: the papers say 'exploratory evidence only; it is not a global exclusion' and 'no claim is made that these 42 orbits are genuinely solvable'.
[document] The Rational-Sphere Baseline, Fixed-Hypotenuse Synchronization and the Primitive Gate: Bounded Exact Searches That Find No Perfect Cuboid
Three bounded exclusions: 'this is not a nonexistence result' and 'this is a finite-range exclusion only, not a global nonexistence proof' (the papers).
[document] Six-Channel Conservation–Duality, the Conservation Move Algebra and Two-Turn Square-Preserving Repair
A set of exact reinterpretations (numbers re-checked) with no claim of existence or nonexistence; C2 states it is not a new conjecture.
[branch-hub] Radical-FDRS: One-Dimensional Flattening and Elliptic–Chabauty Machinery on the Fixed Slice
AMRAL case: the Radical-FDRS line of the perfect cuboid — the problem written as a radical-closure Boolean cube, then Mordell–Weil sieves, local heights and a quadratic-Chabauty specification with a custom 11-adic backend along the historical fixed fibre n = 7/32; every file says it is not a proof of perfect-cuboid existence or nonexistence, and the line ends in a congruence-height lower bound.
[document] The Radical-FDRS One-Dimensional Flattening Methodology and Its First Experimental Pass: Radical Closure, X-Diagonal Coupling, the Boolean Cube and Squareclass Defect Dynamics
A methodology plus one experiment; both status lines say it is not a proof of perfect-cuboid existence or nonexistence, the conjectures R-A…R-D are explicitly not theorems and §27 gives proof-safety rules.
[document] R1: Squareclass Transition Algebra, Rational-Sphere Moves, Cayley Defect Ratios and the Unification with C2
An exact reformulation: 'exists iff' is an exact equivalence and the status line says it is not a proof.
[document] R2: The Twin-Psi Square System, the Fixed-Fiber Genus-5 Reconstruction and the Unification of the 7/32 and 11/45 Slices
An equivalence plus a structural genus count (generic, under the stated separability assumptions).
[document] The Reciprocal Splitting State and the Square-Lift Quotient Surface, and Its Correction: Conic Base Fibers, Elliptic Square-Lift Gates and the Five-Elliptic Decomposition of the Fixed Fiber
Both are exact structural analyses whose status lines say they are not proofs; R4 is the corrigendum round for R3.
[document] The Generic Three-Family Elliptic Decomposition, the Möbius Gate-Swap Automorphism and the Hyperelliptic E_0 Bridge
Three exact structural theorems whose status lines say they are not proofs; §38 of R6 lists the non-claims (no existence, no nonexistence, no classification of G_n(Q)); §32 of R7: 'R7 adds no existence or nonexistence theorem'.
[document] R8: Exact E_0′ Synchronization, the Biquadratic Cover Lattice and the Double Square-Value Reduction
An exact structural reduction for the historical fixed slice n = 7/32; the desired conclusion is stated only conditionally: 'if proved, then n = 7/32 contains no nondegenerate perfect-cuboid point'.
[document] R9: The Exact Two-Gate Mordell–Weil Sieve and Boundary-Tube Forcing on the n = 7/32 Fiber
A proof-safe necessary-condition theorem whose status line says it is not a proof.
[document] R10: 2-Adic Local Openness, Sharp Boundary Neighborhoods and the Failure of Pure Formal-Group Isolation
The paper says outright that it 'does not produce the hoped-for local nonexistence theorem'.
[document] The Sylow-2 Double-Gate Refinement and the p = 4,195,001 Corrigendum, with the General Prime Search, the T_0 Gate-Swap Symmetry and Quotient Compression to the 2-Isogenous Elliptic Curve
R11 is an omission fix that strengthens R9 and R12 is a computational checkpoint plus an exact algebraic symmetry theorem; both status lines say they are not proofs.
[document] The Kummer-Twist Equivalence, the Canonical Elliptic-Chabauty Cover and Residue Transport, the Canonical-Cover Sieve, and the Canonical Second Elliptic Quotient Identified with the Historical E_−
Four exact structural and transport theorems plus two honestly reported 'no progress' computations; each status line says it is not a proof (§40 of R16: 'does not prove the fixed-slice nonexistence theorem').
[document] The Quadratic-Chabauty Local Normal Form at p = 11, 11-Saturation with Custom Formal Elliptic Logarithms, and Mazur–Tate 11-Adic Heights with Calibration of the Bielliptic Quadratic-Chabauty Function
A specification and a custom backend: R17 'presents no invented p-adic height constants'; §39 of R18 says what is not computed; the final quadratic-Chabauty height computation is not executed.
[document] Bad-Prime Local-Height Sets, Coarse Ω Saturation and the Coupled-Local-Image Correction, and the Exact Finite Quadratic-Chabauty Target Modulo 11^5
Exact local reduction tables and a finite target compression; R20 is a corrigendum round and R21 says the final height audit and the 11-adic root isolation remain open.
[document] The Certified Height Audit and First Quadratic-Chabauty Root Filtering, and the QC Pole-Cancellation Corrigendum, the True Mock Branch and a Cross-Prime Mordell–Weil Height Barrier
The end of the series: a corrected quadratic-Chabauty lift and a global congruence-height lower bound; it is not a nonexistence theorem.

pps · 7

[case-hub] Projection Possibility Space (PPS)
AMRAL case: Projection Possibility Space (PPS) — five methodology papers that treat the dynamic, projective and perturbative structure of a geometric problem as something to be tested, with an adversarial counter-certificate duty. No results, no experiments; Lebesgue is only a one-to-three-section case sketch in each paper.
[document] 3D Projection Possibility Space: Three-Dimensional Sources and Planar Families
Restores a readable foundation and elementary examples; no global geometric certificate is produced.
[document] Dynamic Projection Geometry: Animated Interaction as a Continuous Geometric Experiment — from 3D Motion and 2.5D Intermediate States to the Closure of 2D Projection Events
PPS-02 proposes a framework for treating dynamic projection as a geometric experiment. It has no result and runs no experiment.
[document] Subject–Object–Boundary Geometry: From Observer, Perturbing Object and Interface Coupling to Projection Possibility
PPS-03 proposes a triadic state model that makes explicit which observer and boundary a 'closure' is relative to. It is a framework with no result.
[document] Perturbation Objects Beyond Rigidity: From Rigid and Articulated Bodies to Deformable and Worm-Like High-Freedom Perturbers
PPS-04 proposes raising the freedom of the perturbing object step by step as a family of stresses on closure claims. It is a taxonomy, with no counterexample.
[document] Projection-Induced Hidden Geometry: High-Dimensional Motion, Projection Fibers, and Geometric Classes Invisible to Direct 2-D Enumeration
PPS-05 poses an audit question: does a direct 2-D enumeration miss geometric classes that appear only as projections of higher-dimensional motion? It is an audit framework and finds no missed class.
[document] Adversarial Geometric Closure: Counterexample Generation, Search for Unknown Classes, Stopping Conditions and Finite Geometric Closure
PPS-06 writes 'closure' as an authority ladder that must survive adversarial search, not a conclusion reached at once. It is an architecture that has not been run.

protocols · 2

[case-hub] Protocols
AMRAL Research Protocols: define how AI / research roles collaborate, independent of methodology (how research paths are generated) and autonomy mode (who holds the direction). Currently includes TRP (Triadic Research Protocol): Aggressive Discovery, Adversarial Audit, Neutral Academic Assessment.
[document] TRP — Triadic Research Protocol
TRP, the Triadic Research Protocol: Agent A does Aggressive Discovery (highly divergent, may propose bold conjectural bridges, but every unproved step must be flagged); Agent B does Adversarial Proof Audit (hunts for the first illegal step — quantifiers, domain, uniformity, error, tails, local-to-global jumps, counterexamples, proves-too-much, formal gaps); Agent C does Neutral Academic Assessment (judges only the strongest defensible claim, completion level, novelty, QCI closure, and publication readiness). Core principle: bold generation ≠ bold public claim.

rchm-hodge · 16

[case-hub] RCHM × Hodge Research Round
AMRAL case: RCHM × Hodge — 27 rounds of internal research notes applying the Relational Constraint–Handoff Methodology (RCHM) to the Hodge conjecture: exact computations on constructed examples, replays of cases proved by others, and lattice and period bookkeeping for the Küchle c5 Fano fourfold; no round claims to prove or disprove the Hodge conjecture.
[document] Relational Constraint–Handoff Methodology (RCHM) v0.1
RCHM is a methodology draft: it writes problems such as Hodge as typed relations and handoffs, and does not assume that 'two infinities intersect into a finite set'.
[document] Witness Defect, Deformation Handoff, and Rigid Obstruction
R01 is a reformulation: rigidity proves the lack of deformation freedom, not algebraicity.
[document] Constraint Superposition, Cancellation Domains, and Witness-Carrier Transmutation
The number of constraints does not determine the effective freedom; the composition of constraints does.
[document] Carrier Inverse Problem, Identifiability Depth, Geometric Purity, and Witness-Transition Graphs
Resemblance of signatures is not the existence of a carrier.
[document] A Closed-Loop Carrier Reconstruction Experiment with a Twisted Cubic on a Smooth Quartic Surface
In a known reconstructible case the carrier-inverse architecture has a theorem-bridged computational loop; it solves no new Hodge case.
[document] Rational Quartic Negative Control: Envelope Recovery, Purity Breakdown, and a Two-Dimensional Non-Geometric Defect
More Hodge-annihilator information does not automatically mean more carrier information.
[document] Realizability Dominance, Information-Quotient Ladders, and Gate-Ordered Carrier Verification
R11 bounds realizability from above: impurity can only add signature aliases, not realizable carriers.
[document] Blind Reconstruction from a Published Period Signature: Recovering a Bitangent Conic Pair
R12 reconstructs a known carrier from a published period signature; the answer is known from the cited paper and serves as the validation target.
[document] Bridge-Object Search, Residual Hodge Defects, and Symmetry-Amplified Closure
R14 replays existing third-party results; the paper itself says no new proof of the published hyperkähler geometry is claimed.
[document] Generalization Test on Cubic Fourfolds: Canonical Fano Bridges, Denominator-Aware Closure, and Conditional K3 Escalation
R16 reconstructs a known consequence (the rational Hodge conjecture for codimension-two classes on a smooth cubic fourfold); it is not a new proof.
[document] Ancestry Reduction for K3-Type Fano Families: Blow-Up Source Classification, Bridge Reuse, and Novelty Frontier Detection
R19 classifies the Küchle families as reused, reduced or novel; 'NOVEL' means only that no source reduction has been certified in the current graph.
[document] Küchle c5 Ancestry Normalization: Primitive Integral Inheritance and the Re-Emergence of a K3^[2] Bridge Profile
This is a viable bridge profile, not yet a bridge theorem.
[document] Küchle c5: Exceptional-Twist Correction, Exact Saturation, the A₁⊕A₃ Inherited Lattice, and Failure of the Direct Integral K3^[2] Template
R24 corrects two values of R22 and R23, but its closing negative conclusion (direct integral primitive K3^[2] Hodge isometry = FAIL) is reversed by R25.
[document] Odd-Unimodular Gluing Correction for Küchle c5: the Integral K3^[2] Primitive Lattice Reopens
R25 reverses R24's negative conclusion: the direct integral lattice bridge is not obstructed; what remains is geometric.
[document] Küchle c5 Period Resonance as a Finite Spectral Problem: HLYY Boundary, 12 BWB Slots, and Ancestry-Relative Strong K3 Type
R27 is the endpoint of the line: it reduces c5's period-realization problem to one explicit, still unresolved integer ρ_per.

reconstructions · 1

[utility-page] Six Research Reconstructions
Six AMRAL source reconstructions dated 2026-10-08: MCC-OE-28, LESR 09V, PPS 01, WSFC R19, R22 and the R12 package.

research-modes · 1

[utility-page] Research Modes
AMRAL Autonomy Modes: Human-Led, Semi-Autonomous, Autonomous, Multi-Agent Autonomous — answering 'who holds the research direction and scheduling,' a different question from methodology (how paths are generated). Autonomous does not mean 'no human involvement,' and Semi-Autonomous is not an inferior version.

riemann · 73

[case-hub] Riemann Hypothesis
AMRAL Case One: Riemann Hypothesis. Two separately tracked research lines — AI Autonomous Research (Batch 01 / Case 0001) and Semi-Autonomous Research (led by Neo).
[branch-hub] AI Autonomous Research
AMRAL Riemann Hypothesis case, AI Autonomous Research track (Batch 01 / Case 0001). Raw engineering packages, unaltered, preserved round by round, with verification and hashes. The proof did not close; the process data is archived as-is.
[document] riemann/autonomous/p/case0001-v0.1
AI Autonomous Mathematical Research Case 0001: Riemann Hypothesis Weil Engineering Relay Batch 01. 20-round timeline, claim ledger, failure and revision records, trust boundaries, Batch 02 handoff — RH is neither proven nor disproven.
[document] Riemann Hypothesis AI Research Starting Point v0.1
RH AI Research Starting Point v0.1: The starting point of the entire research line. A line-by-line cleanup of four old manuscripts by Neo.K (Observer Dimensionality Theory, Dynamic Projection Experiment, etc.), explicitly listing which are known classical results, which should be downgraded to hypotheses, and which must be deleted entirely — including the author's own past reasoning errors such as the
[document] Riemann Hypothesis AI Research Starting Point v0.2: GAP-ification
RH AI Research Starting Point v0.2: Shifting from
[document] Riemann Hypothesis AI Research Starting Point v0.3: First Partial GAP Closure
RH AI Research Starting Point v0.3: The GBUMP generating family partially closes RH-W-01, making it the first RH GAP node to be partially closed and accompanied by programmatic regression tests. It transforms
[document] Riemann Hypothesis AI Research Starting Point v0.4: Core Topology Closure
RH AI Research Starting Point v0.4: Advancing the research boundary to where
[document] Riemann Hypothesis AI Research Starting Point v0.5: Weil Normalization Closure
RH AI Research Starting Point v0.5: The precise sign alignment of Clay arithmetic negativity and Lagarias-Weil positivity on the endpoint zero core is complete, with the core interface Q_B0(g)=-E_B0[C_g]=W[C_g]=⟨g,g⟩_W. Next node RH-W-03-SEPARATION: Does an off-axis zero necessarily produce a negative witness in the core?
[document] Riemann Hypothesis AI Research Starting Point v0.6: Compact Support Separation Closure
RH AI Research Starting Point v0.6: Advancing the Weil route from
[document] Riemann Hypothesis AI Research Starting Point v0.7: Finite-Dimensional Negative Certificate
RH AI Research Starting Point v0.7: Completed an enumerable nested cutoff–Fourier dictionary, a finite-dimensional attainability framework, an interval negative certificate theorem for a single rational witness, a purely rational exact verifier, and a one-sided semantic firewall. Did not produce a real RH counterexample or proof.
[document] Riemann Hypothesis AI Research Starting Point v0.8: Real Matrix Pipeline
RH AI Research Starting Point v0.8: The first genuine zeta Weil 2×2 rational interval matrix. By fixing two translated cubic B-spline bases with support <log2 to precisely exclude all prime terms, a strictly positive two-dimensional subspace certificate is obtained, retaining FINITE_MATRIX_IMPLIES_RH=FORBIDDEN.
[document] Riemann Hypothesis AI Research Starting Point v0.9: First Prime Activation
RH AI Research Starting Point v0.9: By activating only n=2 in the support chamber of log2<R<log3, we obtained the first prime-active 2×2 and 5×5 real Weil matrices, and an exact rational midpoint-margin certificate. A prime-free negative witness flipped to positive after restoring n=2. Finite-dimensional positivity does not imply RH; no true negative witness was found.
[document] RH AI Mathematical Engineering Milestone v1.0: Multi-Prime Chamber Compiler
RH AI Research Starting Point v1.0 Milestone: Progressing from de-claiming old manuscripts to a true multi-prime-power finite-dimensional certificate pipeline. A 9-dimensional Riemann-Weil interval matrix, five prime-power sparse blocks for 2, 3, 4, 5, 7, and the discrete-continuous decomposition of M=A∞+ΣP_p^k. Did not prove RH; did not find an RH counterexample.
[document] Riemann Hypothesis AI Research Starting Point v1.1: Automated Search and Strict Refinement
RH AI Research Starting Point v1.1: Scanning 122 chambers on a fixed search grid, the top-ranked candidate is h=3/20, d=9/40, N=13; the exact verifier proved a 13-dimensional generalized positive margin of 10^-5. Finite-dimensional positivity does not constitute an RH proof.
[document] Riemann Hypothesis AI Research Starting Point v1.2: Adaptive Continuation and One-Billionth Margin
RH AI Research Starting Point v1.2: Local adaptive continuation pushes the spectral bottom to a 15-dimensional near-critical candidate, and the exact verifier proves a generalized positive margin of 10^-9. The candidate is only about 9.67e-5 away from the log3=d+4h activation boundary. This only proves positivity in a fixed 15-dimensional subspace and cannot deduce RH.
[document] Riemann Hypothesis AI Mathematical Engineering v1.3: Seventh-Order Soft Start of Prime Boundaries
RH AI Research Starting Point v1.3: Analytically resolved the log3=d+4h boundary itself, obtaining the precise soft-start formula for the prime-3 element p_3(μ)=-log3/√3 · (μ+/h)^7/7!, proving the boundary is a seventh-order soft seam that is C6 but not C7, rather than a low-order corner. Corrected the intuitive interpretation that
[document] Riemann Hypothesis AI Research Starting Point v1.4: Kernel Sensitivity–Regularity Duality
RH AI Research Starting Point v1.4: Generalizing the 7th-order soft activation of v1.3 to the entire B-spline kernel family, proving that the prime boundary activation order r=m+n+1 simultaneously controls local amplitude, boundary regularity, Fourier decay, and tail bound cost. The response of the linear kernel to prime-3 is over 10^16 times greater than that of the cubic kernel. There is no single optimal kernel.
[document] Riemann Hypothesis AI Research Starting Point v1.5: Mixed-Order Cross-Regularity Cancellation
RH AI Research Starting Point v1.5: Establishes the first m=1/3 mixed-order kernel dictionary, discovering the
[document] RH AI Research Starting Point v1.6: Cross-Regularity Near-Zero Spectral Band
RH AI Research Starting Point v1.6: RH-W-13 continues the degree-1/3 mixed B-spline Weil dictionary, proving that full channel scaling is merely an invertible congruence that does not change the generalized spectrum, using the relative translation of the two channels as the true continuation parameter, and proving that the ten-dimensional mixed spectral bottom satisfies 10^-8<λmin<5×10^-8. Retains one replayable quantization error case.
[document] RH AI Research Starting Point v1.7: Strict Two-Dimensional Parameter Tube
RH AI Research Starting Point v1.7: RH-W-14 expands the 10-dimensional near-zero single-point certificate of v1.6 into the first continuous 2D parameter tube, proving 10^-8<λmin<5×10^-8 for the entire (d,σ) rectangle. It was discovered that the current tube width is primarily limited by the conservatism of the certificate (requiring a reserved matrix perturbation of 2.3e-8), rather than by the observed spectral instability (actual drift is only 2e-16).
[document] RH AI Research Starting Point v1.8: Interval–Taylor Parameter Tube
RH AI Research Starting Point v1.8: RH-W-15 uses strict four-corner matrices + bilinear convex combination + second-order Taylor remainder to expand the parameter tube radius from 4×10^-12 to 10^-7 (25,000 times in each direction). Retrospection revealed that the Archimedean first derivative bound in W-14 undercounted the tail terms outside the spline support; this has been corrected and reproven. The W-14 conclusion is retained, but the constants are replaced by the corrected version.
[document] RH AI Research Starting Point v1.9: Three-Parameter Near-Zero Spectral Tube
RH AI Research Starting Point v1.9: RH-W-16 adds the kernel scale h, which genuinely alters the dictionary, to the (d,σ) 2D tube, establishing the first (h,d,σ) 3D near-zero positive spectral box, proving 10^-8<λmin<5×10^-8 for every point inside the box. Once extracted, the engineering package can run the verifier independently, no longer relying on unpackaged external Python files. Batch 01 progress 16/20.
[document] RH AI Research Starting Point v2.0: Chamber-Aware Segmentation
RH AI Research Starting Point v2.0: RH-W-17 establishes the first complete closed-interval certificate across a spline knot event surface, slicing the parameter domain along the 4d=log2 event into a left chamber, an event thin layer, and a right chamber, proving λmin(M(d),G(d))>10^-8 for all three closed cells. This is a polynomial piece event, not a prime activation event. Batch 01 progress 17/20.
[document] RH AI Research Starting Point v2.1: Unified Certificate Backend
RH AI Research Starting Point v2.1: RH-W-18 unifies W-04 through W-17 into a single certificate backend and verification entry point rhcert.py, establishing artifact SHA-256 identity, claim firewall, and a three-layer adversarial red-team. Historical certificate audit results: 11 VERIFIED, 1 PROTOCOL_ONLY, 1 SUPERSEDED_RECERTIFIED, 1 LEGACY_INCOMPLETE.
[document] RH AI Research Starting Point v2.2: Adversarial Reproducible Audit
RH AI Research Starting Point v2.2: RH-W-19 adds a zoo of 16 classes of rejectable error certificates, 1 class of expected-to-survive verifier collusion attack, exact Hilbert-14 floating-point false negative, external signatures, and independent verifier routes on the unified backend v0.2. Batch 01 progress 19/20.
[document] RH AI Research Starting Point v2.3: Batch 01 Archive and Case 0001
RH AI Research Starting Point v2.3: Batch 01 sealed version, completing the first batch of twenty relay rounds from RH-W-01 to RH-W-20, adding platform_case_0001/ for direct import by the AI autonomous mathematical research platform. Batch status COMPLETE, Case CASE-0001-RH-WEIL-BATCH01, RH_CLAIM=false. Version 23/23 of the Research Starting Point series, concluding the entire series.
[document] Arithmetic Matrix and Positive Semi-Definite Certificate Prototype
RH Arithmetic Matrix/PSD Prototype v0.1: The second engineering prototype in the
[document] Regional Phase Shaping Prototype
RH Regional Phase Shaping v0.1: The first executable engineering prototype in the
[document] RH-W-01: Weil Route Test Function Space Fixed
RH-W-01 Engineering Package: Fixes the test function space, Mellin normalization, and sign conventions of the Weil explicit formula route, splitting the single node into eight independently relayable sub-GAPs. Status IN_PROGRESS.
[document] RH-W-01-D/E/F/G: Double Vanishing Moments, Correlation Closure, and Mellin–Fourier Interface
RH-W-01 Engineering Package v0.2: Constructed a non-empty, parameterizable GBUMP test function family that precisely satisfies two Mellin vanishing moments and is multiplicatively correlation-closed. Closed six sub-GAPs (A/B/C/D/E/G) for this subfamily.
[document] RH-W-02: Weil Test Function Core, Range, and Topology
RH-W-02 Engineering Package: Proves that D(D+1)C_c^∞(0,∞) is exactly equal to the compactly supported smooth double vanishing moment kernel. The GBUMP generating kernel from the previous round is not an arbitrary small subfamily, but exactly covers all legitimate kernel test functions. Status: CORE_CLOSED / GLOBAL_BRIDGE_OPEN.
[document] RH-W-02: Weil Normalization Alignment and Sign Closure
RH-W-02 Engineering Package v0.2: Term-by-term alignment of Bombieri/Clay's trace-negativity with Lagarias's covariance-positivity, locking in the unique unified quadratic form Q_B0=-E_B0=W. Status: CLOSED_FOR_ENDPOINT_NULL_CORE.
[document] RH-W-03: Compact Support Separation, Negative Witness Existence, and Dual-Core Architecture
RH-W-03 Engineering Package: Citing Suzuki's compactly supported Weil criterion, it proves that
[document] RH-W-04: Finite-Dimensional Completeness and Rational Negative Certificate
RH-W-04 Engineering Package: Constructs a cutoff–Fourier finite-dimensional dictionary and proves that the Rayleigh–Ritz limit converges to the true spectral bottom, reducing the strict negative certificate to
[document] RH-W-05: First Real Weil Matrix Rational Interval
RH-W-05 Engineering Package: Generated the first real Riemann zeta Weil 2×2 rational interval matrix that does not rely on synthetic zeros, with support controlled within log2 so that the prime terms analytically resolve to zero. The entire
[document] RH-W-06: First Prime Activation and Arithmetic Support Chamber
RH-W-06 Engineering Package: The first time n=2 truly enters the Weil matrix. The same rational integer witness is strictly negative after artificially removing the prime term, and strictly positive after adding back the real n=2 term — demonstrating that the prime term is not decorative, but can change the inertia of the finite-dimensional form. RH_CLAIM=False.
[document] RH-W-07: Multi-Prime Support Chamber Compiler
RH-W-07 Engineering Package: Expanding the single n=2 coupling into a 9-dimensional real Weil interval matrix across five von Mangoldt layers (2, 3, 4, 5, 7), establishing an activation map of prime powers entering and leaving the support window, and using four rational witnesses to prove that each layer can flip the sign of specified directions. RH_CLAIM=False.
[document] RH-W-08: Chamber Search and Strict Refinement
RH-W-08 Engineering Package: Scanned 122 B-spline chambers, selected candidates, and then used an Archimedean tail bound that preserves derivative signs to increase the reachable resolution of the exact certificate by 63 times, turning it from INCONCLUSIVE to a thirteen-dimensional strict positive margin of 10^-5. RH_CLAIM=False.
[document] RH-W-09: Adaptive Chamber Continuation
RH-W-09 Engineering Package: Shifted from a fixed grid to local adaptive continuation, pushing the lowest generalized spectral bottom down 9110 times from 10^-5 to 10^-9, with the endpoint closely approaching the prime activation boundary of log3. A 15-dimensional positive margin was proven both before and after the boundary using a purely rational verifier. RH_CLAIM=False.
[document] RH-W-10: Prime Boundary Local Modes and Seventh-Order Soft Start
RH-W-10 Engineering Package: Precisely characterizes the soft-start law of prime-3 at the log3 support boundary —— a seventh-order soft switch that is C6 but not C7, overturning the intuition that
[document] RH-W-11: Kernel Sensitivity and Regularity Duality
RH-W-11 Engineering Package: Introduces the prime-power boundary activation law r=m+n+1 for the general B-spline kernel family, proving that the smoother the kernel, the weaker the boundary signal, yet the easier the tail bound is to control — there is no single optimal kernel. The weak 10^-28 signal observed in W-10 would be 10^16 times larger if switched to an m=1 kernel. RH_CLAIM=False.
[document] RH-W-12: Mixed-Order Dictionary and Cross-Cancellation Mode
RH-W-12 Engineering Package: The first m=1/3 mixed B-spline real Weil ten-dimensional interval matrix. The mixed spectral bottom is exactly sandwiched between 1/2000 and 1/1000, strictly lower than any isolated channel — the new low mode comes from cross-order coupling, not any single kernel. RH_CLAIM=False.
[document] RH-W-13: Cross-Regularity Continuation and Canonical Parameters
RH-W-13 Engineering Package: The explorer once reported a suspected Weil negative direction of -3.32e-7, which was escalated to a red alert per protocol rather than declared a counterexample; it was traced to a parameter identity error caused by inconsistent M/G quantization, flipped to positive after consistent quantization, and verified by 80-bit independent integration. Ultimately, the 10-dimensional near-zero positive spectral band was exactly bracketed in (1e-8, 5e-8). RH_CLAIM=False.
[document] RH-W-14: Strict Two-Dimensional Parameter Tube
RH-W-14 Engineering Package: Expands the 10-dimensional near-zero single-point certificate of W-13 into the first continuous 2D parameter tube, using the B-spline global Lipschitz bound to prove that 10^-8<λ<5×10^-8 is strictly satisfied throughout the entire (d,σ) rectangle. RH_CLAIM=False.
[document] RH-W-15: Interval–Taylor Parameter Tube Expansion
RH-W-15 Engineering Package: Switches to a convex combination of four-corner matrices plus a second-order Taylor remainder, expanding the radius of the 2D near-zero parameter tube from W-14 by 25,000 times. It simultaneously discovers and corrects the missing out-of-support tail in the Archimedean derivative bound of W-14 — the original conclusion is retained, but the derivation and constants must be replaced by the corrected version. RH_CLAIM=False.
[document] RH-W-16: Three-Parameter Near-Zero Spectral Tube
RH-W-16 Engineering Package: Incorporates the kernel scale h itself into the parameter domain, establishing the first 3D rational box (h,d,σ). The real Weil interval matrices at the eight corner points, combined with trilinear convex interpolation and second-order Taylor remainders, exactly prove 10^-8<λ<5×10^-8 for the entire box. Batch 01 progress 16/20. RH_CLAIM=False.
[document] RH-W-17: Chamber-Aware Slicing and Event Thin Layer
RH-W-17 Engineering Package: Chamber-aware slicing and event thin layers. Fixing a ten-dimensional mixed-order Weil dictionary, establishing the first parameter certificate across a spline knot event surface. RH_CLAIM=False.
[document] RH-W-18: Unified Certificate Backend and Single Verification Entry
RH-W-18 Engineering Package: Consolidates the certificates of W-05 through W-17, which had different schemas, into a single CLI and a five-tier trust vocabulary (VERIFIED/VERIFIED_WITH_LIMITATION/PROTOCOL_ONLY/SUPERSEDED_RECERTIFIED/LEGACY_INCOMPLETE). It publicly acknowledges the missing files in W-06 and that W-14 has been recertified, rather than greenwashing them after the fact. RH_CLAIM=False.
[document] RH-W-19: Reproducibility and Adversarial Certificate Audit
RH-W-19 Engineering Package: Establishes a zoo of 17 classes of erroneous certificates, with 16 classes correctly rejected and 1 class of
[document] RH-W-20: Batch 01 Integration and AI Autonomous Mathematical Research Platform Case 0001 Release
RH-W-20 Engineering Package: Batch 01 (RH-W-01~RH-W-20) sealed, releasing Case 0001 importable by the platform and the Batch 02 handoff package. The Riemann Hypothesis remains an unsolved Millennium Prize Problem; Batch 01 only studies a finite engineering branch of the Weil quadratic form and explicit formulas, treating failures and revisions as first-class research data. RH_CLAIM=false.
[branch-hub] Semi-Autonomous Research
AMRAL Riemann Hypothesis case, Semi-Autonomous Research track (led by Neo). Raw engineering packages, unaltered, preserved round by round, with verification and hashes.
[document] Axis Gap and Cover Co-Design
RH Semi-Autonomous Research Engineering Package: Axis Notch and Cover Co-Design v0.5. Proves that the homogeneous notch has a subspace inclusion obstruction, external spectral dimension elevation saturates at 1.09, and local geometric improvement saturates at 1.07; all three branch lines are halted, pivoting to the continuous Paley–Wiener extremal problem.
[document] Axis Suppression and Full-Window Leakage-Aware Optimizer
RH Semi-Autonomous Research Engineering Package: Axis Suppression and Full-Window Leakage-Aware Optimizer v0.1. Proves that finite critical line cancellation compresses the arithmetic positive cone dimension, completely vanishing at q=15; full-window non-positivization fails in the existing basis. Does not constitute a proof of the Riemann Hypothesis.
[document] Axis-Target Dual Obstruction
RH Semi-Autonomous Research Engineering Package: Axis–Target Dual Obstacle v0.3. Uses a dual witness to prove J(A)≥2>1, completely vetoing the existing R=3 function class within a finite rational surrogate —— it is not that it hasn't been found yet, but that this function class itself is structurally blocked.
[document] Banded Multi-Test Functions and Adaptive Cover Certificate Families
RH Semi-Autonomous Research Engineering Package: Banded Multi-Test Functions and Adaptive Cover Certificate Families v0.1. 18 rational rectangular adaptive covers replace a single test function, reducing axial energy by 215 times, but the global dominance margins still fail entirely. This is the first node of autonomous decision-making on the AI research side.
[document] Integration Overview of Equivariant Arithmetic Obstructions
RH Semi-Autonomous Research v1.0 Integration Overview: Integrated audit, evidence grading, gap map, and research node timeline of six theoretical drafts + five engineering packages (C1-C6). The highest evidence level is the validated numerical certificate E3 for a single intersection function; RH remains in an open state.
[document] Interval Green-Kernel Atomic Certificate
RH Semi-Autonomous Research Engineering Package: Interval Green-Kernel Atomic Certificate v0.7. Strictly proves W_21/20 is positive definite using 90-digit interval arithmetic, which is the first true interval theorem in the entire sequence; simultaneously honestly catches that the existing coefficient is an upper bound rather than a lower bound, and cannot be mechanically replaced.
[document] Local Interval Green Position Cover
RH Semi-Autonomous Research Engineering Package: Local Interval Green Position Cover v1.0. Strictly increases the certificate radius of v0.9 by 890 million times (from 2e-15 to 1.78e-6), precisely locating the boundary where the current prover passes/is inconclusive, serving as the technical convergence node of the second arc.
[document] Occupancy Operator Family and Covering Green Certificates
RH Semi-Autonomous Research Engineering Package: Occupancy Operator Family v0.9. Uses exact rationals to prove the joint positive definiteness of the entire family of operators with uncertain positions (radius 2e-15), but honestly quantifies a proof budget gap of about 8 trillion times between the exact micro-radius and the floating-point local scale.
[document] Paley–Wiener Axis-Core Extremal
RH Semi-Autonomous Research Engineering Package: Paley–Wiener Axis Core Extremal v0.6. Elevates the finite dictionary problem to a continuous Hilbert space extremal problem; the joint dual monotonically converges from 7.79 to a rational candidate of 1.05, which is equivalent to the positive definite determination of a 2x2 Schur matrix.
[document] PSD Gram Banded Global Dominance
RH Semi-Autonomous Research Engineering Package: PSD Gram Banded Global Domination v0.2. Replaces the diagonal ray cone with PSD Gram variables, reducing the sample budget by an average of 21%, but still falling 64 to 143 times short of the target, with the [18,23] axis band being the main source of cost. The next step pivots to the dual problem.
[document] Separation–Positivity Intersection Solver
RH Semi-Autonomous Research Engineering Package: Separation-Positivity Intersection Solver v0.1. For the first time, simultaneously satisfies the off-axis block negative direction and arithmetic quadratic form positivity on the same coefficient vector. Floating-point finite grid results; does not constitute an interval certificate, nor does it prove the Riemann Hypothesis.
[document] Support–Prime Dual Frontier
RH Semi-Autonomous Research Engineering Package: Support–Prime Dual Frontier v0.4. Four support radii R=10.25/12/14/16 are all blocked by dual witnesses, and it was discovered that a coarse axis grid produces false escapes — after densifying the grid, α reverted from 0.99 to 1.19. Prime enumeration at R=16 has approached 79 trillion terms.
[document] v0.1–v1.0 Complete Research Report and AI Handoff
RH Semi-Autonomous Research Second Arc Complete Report and AI Handover v1.0. Integrates ten research nodes (v0.1-v1.0), claim register, GAP ledger, failure correction map, and subsequent AI execution protocols. The highest positive conclusion is an interval cover family of 58-dimensional position variables within an abstract model, which does not constitute a proof of the Riemann Hypothesis.
[document] Validated Intersection Certificate
RH Semi-Autonomous Research Engineering Package: Strict Intersection Certificate v0.2. Upgraded the floating-point candidates of v0.1 into validated-numerics certificates—continuous rectangular negative upper bounds and arithmetic positive intervals, using the same explicit test function, with replayable verification. Does not constitute a proof of the Riemann Hypothesis.
[document] Zero-Side Leakage Budget
RH Semi-Autonomous Research Engineering Package: Zero-Side Leakage Budget v0.1. Evaluates the first 50 critical line zeros using the same certificate function as v0.2, discovering that the on-axis leakage is three to four orders of magnitude larger than the target negative margin. An honest scale diagnosis, not a failure record.
[document] Zero-Count Coefficient Semantic Bridge
RH Semi-Autonomous Research Engineering Package: Zero Count Coefficient Semantic Bridge v0.8. Uses an exact counterexample to prove that the inference
[document] Equivariant Topological Decision Domain After Centering
Equivariant Topology Determination Domain After Centering: Reconstruction of RH Divisor Fixed Points and Winding Number Obstructions. Semi-autonomous research track preliminary technical draft, does not constitute a proof of the Riemann Hypothesis.
[document] From Centering to Equivariant Topology
From Centering to Equivariant Topology: Thinking Methods and Method Groups for RH Validity Determination Research. Semi-autonomous research track methodology draft, planning the subsequent four-paper sequence, does not constitute a proof of the Riemann Hypothesis.
[document] Equivariant Zero Configuration Topology
Equivariant Zero Configuration Topology: RH orbit-type stratification, effective divisor semiring, and positive obstructions. Semi-autonomous research sequence ①, does not constitute a proof of the Riemann Hypothesis.
[document] Stratified Zero Obstacles and Local–Global Lift
Sheafified Zero Obstructions and Local-Global Lifting: From Rational Rectangle Certificates to Full Critical Strip Determination. Semi-Autonomous Research Sequence ②; does not constitute a proof of the Riemann Hypothesis.
[document] Equivariant Arithmetic Separation
Equivariant Arithmetic Separation: From orbit space localization to admissible test functions of the ζ explicit formula. Semi-autonomous research sequence ③, does not constitute a proof of the Riemann Hypothesis.
[document] Off-Axis Positive Obstruction in Explicit Formulas
Off-Axis Positive Obstacles in Explicit Formulas: Zero-side regional negative directions, prime-side computable cones, and ZFC-auditable contradiction architectures. Semi-Autonomous Research Sequence ④, does not constitute a proof of the Riemann Hypothesis.

seven-conjectures · 1

[hub] Seven Great Conjectures
An overview of the Clay Mathematics Institute's seven Millennium Prize Problems: AMRAL runs independent research lines on the Riemann Hypothesis, BSD Conjecture, Navier-Stokes, P versus NP, and the Hodge Conjecture.

skew-field · 15

[case-hub] Skew Field
AMRAL case: Skew Field — a unifying bridge theory for the Kakeya needle problem, center-generated bidirectional-offset spirals, and Moser's worm problem. Proves a positive-thickness swept-area invariant, sealing off the Kakeya degeneration channel, translated into a Moser-type universal-containment problem. The original engineering packages are unmodified, with a full round-by-round trail.
[document] Universal Support Tension Comparison among Constant Curvature, Archimedean, Contact-Saturated, and Finite-Width Curvature Stratum
Center-Generated Bridge Experiment, Round 1: a comparison of universal support tension across four curve families — constant curvature, the Archimedean spiral, the contact-saturated smooth spiral, and the finite-width curvature stratum. Finding: the ranking by maximum curvature is not the ranking by common-container pressure — concentrated finite-width curvature generates more universal support pressure than local contact saturation does.
[document] Curvature-Saturation Terminology Correction, Quadratic-Exponential Limit Family, Chirality Equalization, and Dual-Skeleton Container
Center-Generated Bridge Experiment, Round 2: a terminology correction (contact saturation → curvature saturation), the quadratic-exponential limit family, dual-chirality tension, and the common container degenerating into a dual skeleton of a constant-curvature semicircle plus a quadratic-exponential curve. The common-container area advances to 0.269624487989.
[document] Normal Injectivity Theorem, Curvature Bounding Boxes, Clarke Boundary Ledger, and the New Dual-Frequency Log-Curvature Skeleton
Center-Generated Bridge Experiment, Round 3: proves the Half-Turn Positive Curvature Normal Injectivity Theorem, elevating a local lower bound on the radius of curvature to global injectivity of the normal band; finds a new dual-frequency log-curvature skeleton stronger than Round 2's, with the common-container area advancing to 0.281463277175. This round is the first to contain a formally proved theorem, not just a numerical candidate.
[document] Fourier Curvature Function Spaces, Adjoint Sensitivity, and Non-Convex Container Reduction
Center-Generated Bridge Experiment, Round 4: raising the dimension of the curvature function (Fourier 6/8/10 modes) still increases convex support tension, but at the same time we find that the cost of convexification accounts for 37.31% of the current finite-family container's area — a non-convex simply-connected container needs only 0.191, far below the convex container's 0.305. Convex support redundancy is not the same as non-convex container redundancy.
[document] Non-Convex Area-Exposure Tension and the First Curve–Container Alternating Adversarial Cycle
Center-Generated Bridge Experiment, Round 5: the first complete curve–container alternation cycle. A Fourier-12 attack curve exposes 0.00666 against the Round 4 container; container reconfiguration absorbs 57.7%, leaving a net increase of only 1.47%. Held-out sample testing shows the system has not yet converged. Genuine universal-container research must be an alternating contest between curvature functions and non-convex containers.
[document] The Second Non-Convex Alternating Cycle, the Absorption Coefficient, and the Fourier-14 Residual Attack
Center-Generated Bridge Experiment, Round 6: the second alternation cycle. The attack's exposure is smaller than Round 5's (0.00493 < 0.00666), yet the net container increase is larger (0.00446 > 0.00282) — the absorption rate is only 9.5%, far below Round 5's 57.7%. A drop in attack exposure is not enough to guarantee a drop in net container increase. A Fourier-14 residual attack shows the system still has not converged.
[document] The Third Non-Convex Alternating Cycle, Spatial Exposure Entropy, and the Fourier-16 Residual Attack
Center-Generated Bridge Experiment, Round 7: the third alternation cycle, the first to quantify the spatial distribution of exposure. This round's attack has fewer effective spectral modes than Round 6's, yet the spatial gaps are more scattered (4 connected components, with the largest accounting for only 37%). Spectral complexity does not imply spatial attack dispersion. Proposes the exposure-mode alternation conjecture: dispersed-coverage and localized-penetration attacks may occur in alternation.
[document] The Fourth Non-Convex Alternating Cycle, Fourier-18 Dual Pools, and Spectral-Lineage/Spatial-Phenotype Decoupling
Center-Generated Bridge Experiment, Round 8: the fourth alternation cycle, establishing for the first time a dual-pool (dispersed-lineage / localized-penetration-lineage) plus B-spline held-out-pool methodology. Simultaneously refutes three overly simple assumptions — that a localized lineage necessarily produces a localized phenotype, that a dispersed lineage necessarily produces a dispersed phenotype, and that a localized-penetration type is necessarily harder to absorb. The spatial-exposure phenotype is a joint function of curvature spectrum, spectral phase, congruence configuration, and container geometry — not a scalar property of the curve alone.
[document] Fifth Non-Convex Alternating Cycle, Transient Forcing Curves, and Fourier/B-spline Multi-Family Residuals
Center-Generated Bridge Experiment, Round 9: the fifth alternating cycle, with the net increase dropping to its lowest across Rounds 5-9, but this round reveals a “transient forcing curve” — a curve that can historically force the container to expand (e₉>0), yet becomes nearly redundant in the updated leave-one-out ledger (ℓ₉<10⁻³). Historical necessity does not imply final-state activity; the research ledger must preserve both attack history and final-state structure.
[document] Sixth Non-Convex Alternating Cycle, Historical Pressure Memory, and Congruent Placement Falsification
Center-Generated Bridge Experiment, Round 10: the sixth alternating cycle, establishing a “historical pressure memory” dual ledger that distinguishes transient pressure curves from persistent skeleton curves. The more critical finding is the false-hard-case problem in the congruent placer — a candidate curve's low-budget search gave an exposure of 0.0409, but a high-budget multi-seed recomputation left only 0.000226, an overestimate of about 181.4 times. Non-convex container research is not just a curve-generation problem; it is also a congruent-placement global optimization problem.
[document] Seventh Non-Convex Alternating Cycle, Local Placement Certificates, and Parent Family Relay
Center-Generated Bridge Experiment, Round 11 — the experiment-round series' 11/11 finale. The seventh alternating cycle: the container absorbs nearly 90% of the formal attack (η₁₁=89.6499%, the smallest net increase across Rounds 5-11), but another curvature parent family (the Fourier-24 local parent family) immediately takes over as the new hard case — the container's local near-equilibrium does not imply synchronous closure of the curvature parent family. Also establishes the series' first nonzero local placement lower bound.
[document] Center-Generated Bidirectional-Offset Spiral Proposition
Center-Generated Bidirectional-Offset Spiral Proposition v0.1: formalized geometry of full turning, positive thickness, non-overlap, and spiral annuli. Proves that total turning of 2π does not entail a circle — only a constant-curvature full-turning unit is a circle; the bidirectional normal-offset band area is 2ρL. The basic tubular geometry and classification propositions are directly provable; this does not constitute a solution to the Kakeya or Moser problem.
[document] From the Original Kakeya Needle to Moser's Worm
From the Original Kakeya Needle to Moser's Worm v0.1: a positive-thickness bridge theory for center-generated bidirectional-offset spirals. Proves the swept-area invariant 2ρL under positive-thickness + non-overlap conditions, closing the Kakeya zero-area degeneration channel and translating the optimization problem into a Moser-type universal-containment problem. Some theorems are directly provable; this does not constitute a solution to the Kakeya or Moser problem.
[document] From the Original Kakeya Needle to Moser's Worm II
From the Original Kakeya Needle to Moser's Worm II v0.2: measure-conserving skew-line fibers, the information-faithful kernel, and universal covering tension. A unified extended version, proving that a fiber's first moment can invertibly reconstruct curvature, the base-marginal uniformity theorem, and defining the universal covering-tension functional. The tubular-geometry portion contains directly-provable theorems; the universal extremum and optimal curve remain open propositions.

validation · 2

[case-hub] Validation
AMRAL's validation layer: how research results are legitimized, quantitatively closed, and verified, independent of methodology, protocol, and autonomy mode. Currently includes QCI (Quantitative Closure Interface), plus a list of other validation concepts: Target Fidelity Audit, Adversarial Review, Blind Re-Derivation, Proves-Too-Much Test, Numerical Certificate, Lean 4, Coq, External Expert Review, Evidence/Trust Boundary.
[document] QCI — Quantitative Closure Interface
QCI: a legitimacy, admissibility, estimate-precision, error-control, and uniform-quantification layer that a proof strategy relying primarily on qualitative, topological, geometric, algebraic, or combinatorial structure must pass through before being promoted to a global analytic/arithmetic claim. T → (Φ) → A_admissible → (Q) → R. QCI debt has nine components: definition, admissibility, quantitative bound, uniformity, error budget, tail, global, consistency, formalization.

wsfc · 18

[case-hub] WSFC: Worm Sequence Freedom Closure
AMRAL case: WSFC (Worm Sequence Freedom Closure) — puts the broadworm breadth sequence t_n and the seven general-n conjectures of Panraksa–Wetzel–Wichiramala (2007) into a finite-freedom-sequence framework; research-proof-level provisional closure, with no proof assistant, independent review or peer review; no new bound on the Moser worm area is claimed.
[document] Sequence Freedom and Limit Closure of the Possibility Space for the Worm Problem: From Finite-Freedom Expansion and State-Space Evolution to Effective Residuals and a Serializable Infinite Geometry
WSFC-00 proposes a programme that approximates the worm problem by a sequence of finite-freedom spaces and four gates; it is a programme, not a result.
[document] Polygonal ω-Hierarchy, Insufficiency of Any Finite Order, and Broadworm Breadth Sequence Closure
R01 places the broadworm breadth sequence t_n in a finite-order hierarchy and gives an elementary convergence-rate bound; it is not a new bound on the Moser area.
[document] Freedom Birth Rate, Broadworm Residual Dynamics, and the Reproduction of the n = 4, 5, 6 Polygonal Extremizers
R02 is literature recovery and numerical reproduction: it lists the seven 2007 conjectures as the targets this series faces; the numbers are research-level candidates.
[document] Antipodal Support-Tangent Compression: From 2n − 2 Vertex Degrees of Freedom to Low-Dimensional Sequences and the Continuum Limit of the Broadworm
Inside the 'support-tangent class' the vertex freedom collapses to one or two parameters with closed forms; whether that class really contains the global optimizers is the load-bearing assumption of the line.
[document] Finite-Segment Convexity Gate, Endpoint-Disc Obstacle Reduction and the Support-Cell Allocation Calculus
R04 proves a symmetric allocation for even n inside a reduced obstacle model; the conclusion is limited to that model and is not a global result.
[document] Support-Class Necessity I: Convexity, Endpoint Antipodes, and Balanced Segment Allocation
The canonical R04: two external gates are imported from Adhikari–Pitman 1989, and the endpoint-antipode lemma, the interior support-slack lemma and the balanced-allocation theorem are derived inside the reduced support-tangent class; the paper explicitly does not claim that support-class necessity is fully proved, that the top plateau is excluded, or that the global broadest polygonal arc for n ≥ 4 is solved.
[document] Boundary Saturation Closure: Endpoint Shortcut, Plateau Elimination and the Finite-n Support-Tangent Reduction
R05 gives a provisional draft of the support-tangent reduction; its status is 'provisional, independent audit required', and one gap in it was found and repaired in R06.
[document] Adversarial Re-Derivation: Finding a Plateau Gap, Completing a General Repair, and Rebuilding Support-Class Necessity
R06 found and repaired a real gap in R05; the repaired chain is still research-level and unformalized.
[document] Generic Point-to-Segment Certificate Compiler: Recovered Paper and Reconstructed Package
Canonical first event = 1; irrational event = 2−√3/2; generic formal soundness remains OPEN.
[document] Refinement Chain / Closure Algebra: Transition History and Freedom Tail Certificates
Cauchy closure requires summable residuals and an admissible limit; global broadworm obligations remain.
[document] G0 Finite-Stage Exactness Re-Audit: Support-Width Semantics, Convex Shortcut and Global Reduced-Class Necessity
G0 is labelled 'research-proof-level provisionally closed' on the authors' own re-audit; formal authority and independent review stay open.
[document] G1 Full-Domain Coverage: Exact-Length Tent Approximation, Uniform Cover Modulus and Broadworm Value Closure
The part independent of G0 is elementary: the approximation bound and the Lipschitz property of breadth; the convergence part relies on an assumed classical uniqueness.
[document] Strict Monotonicity: Tangent-Gap Refinement and the Last Half of 2007 Conjecture (5)
Conditional on G0-lite, the breadth sequence t_n is strictly increasing (the second half of 2007 conjecture (5)). A conditional research proof.
[document] Finite-Stage Uniqueness: Strict Convexity, Integer Balancing and Mirror-Class Rigidity
The optimizer is unique inside the reduced class; lifting to the full problem needs G0. A conditional research proof.
[document] Endpoint-Distance Strictness Reframed and Elasticity Kernel Closure: Dual Comparative Statics, the Unit-Length Elasticity Gap, and a Computer-Assisted K > 0
Conditional on G0, the unit-length endpoint distance b_n strictly decreases; the kernel positivity is certified computer-assisted by a single interval backend (mpmath.iv).
[document] 2007 Conjecture Ledger / Authority Audit: Classical Closure, WSFC Conditional Proofs and Formal Debt
The correct authority level of the seven conjectures is not 'WSFC solves everything' but: 2 classical source closures plus 5 WSFC provisional research closures.
[document] Independent Verification Pack: From Internal Closure to a Reviewer Protocol That Can Be Overturned from Outside
R28 is a protocol for future outside reviewers; it verifies no mathematics, and no human or third-party review has taken place.

Contents