SG-1 — Geometry Specification (GUT Gate 1): Per-Gate Closure-Attack Dossier

What this is. The closure-attack packet for SG-1 (Geometry specification / the frozen 13D K₆ active branch) on the frozen 13D K₆ branch ONLY. It recaps how our geometry closes the geometry-specification gate (concise; the full freeze record lives on the published site), verifies where the status actually stands, names every open residual, and lays out the attack plan to push the gate further. It is not a rival comparison (that is BATTLE_GATES/), not the one-line status ledger, not a reprint of the manuscript.

Binding discipline (carry verbatim). No status was ever upgraded. Frozen branch dcc66f1b2685 / a5b1e6f9d951 READ-ONLY. Honest throughout: SG-1 is a freeze-and-reproduce certificate, NOT a derivation and NOT a uniqueness theorem. Minimality is selector-minimal INSIDE the pre-declared search category — SHAPE is selected, not forced absolutely (Kolmogorov/MDL-shortest only over the declared grammar + dimension ladder + named rivals). The honest charged cost is ≈4 anchors + 9–10 injected reals, NOT the "4-in" / "4→22" headline. Carrier-uniqueness is mixed: K₆=SU(3)/T² is the unique purely-abelian clean SU(3) carrier (abelian-isotropy uniqueness; the CP²=SU(3)/U(2) swap was built and BREAKS at Gate 2 by over-producing gauge); S² is FORCED within the grammar by F1, S¹_Y/Z₂ by F2; but the gauge-group outcome is a TIE shared by string/M/F/NCG/lattice, and the search-category / metric choice is SHARED-OPEN across frameworks. Closure paths must be non-target-fitted (the κ³/π falsification test). given-E ≠ derivation of E; selection ≠ derivation; dissolved ≠ solved; AXIOM-CLOSED ≠ proven; category-relative ≠ absolute.

0. Header & Verdict

0.1 Abstract — established / open / what would close it

Established (given the declared search category, the four anchors, and the freeze). SG-1 certifies three — and only three — things: (1) specificity — the active branch $\mathfrak{B}_{\rm active}=[\mathcal{M}_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2]_\times\oplus[F^+_{\rm finite}\oplus C_{\rm admiss}]_\oplus\otimes[E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_\otimes$ is a fully specified, layer-complete three-layer object, committed before any downstream gate is evaluated; (2) no-layer-smuggling — no gate is closed by content that was not declared in its proper layer (the $\times$/$\oplus$/$\otimes$ discipline, B2); (3) reproducibility — every primitive (A0) and every derived object (A1/A2/A3) is content-addressed by SHA-256, and the R0 reproducer regenerates each hash, so the object a reviewer attacks is byte-identical to the object the gates were evaluated on. The technical witness is a freeze-and-reproduce certificate, not a derivation: it pins the object; it closes no physics.

Open (the honest deductions). (1) The gate is DECLARED-FROZEN and category-relative, not a uniqueness theorem. Minimality is selector-minimal inside the pre-declared search category (R2.5: forces = isometries, compact, classified structures, admissible bundles), not architecture-neutral forcing. (2) Absolute irreducibility is OPEN — the universal negative "no competitor anywhere is shorter" is uncomputable (Kolmogorov); the gate bottoms on $E$ (the SM chiral content presupposed on both sides). (3) The dimension-ladder lower-bound matrix is OPEN — under the MDL metric the 13D branch wins every considered rung (10 LOSES_TO_13D, 1 structural FAILS, 0 REFUTED), but the matrix is a first-pass survey, not a certified classification (SHAPE Certificate 3 / Lemma 5). (4) The search-category completeness is OPEN — the named-shelf elimination of cheaper SU(3) carriers (the K₆/CP² rung) and the fairness of R2.5 itself are flagged by the manuscript as intended first review targets (GUT.md:382). (5) The honest charged cost is ≈4 anchors + 9–10 injected reals, NOT the public "4-in" headline — several "outputs" are themselves fitted injections. (6) The MDL metric under which the ladder is scored is itself unproven against the dimension-first alternative (under which a 4D EFT wins and the whole ladder folds).

What would close it (the ladder). DERIVED-CLOSED would require an architecture-neutral proof that the 13D branch is the unique minimum over a broad competitor class $\mathfrak{B}_{\rm abs}$ — i.e. the completed role-mechanism normal-form theorem (SHAPE Certificate 3) plus the architecture-neutral metric-selection theorem (granularity ⇒ MDL). Both are OPEN and one (the universal negative, Lemma 5) is uncomputable in full. The realistic ceiling per residual is AXIOM-CLOSED: name one explicit, target-blind posit (the granularity-MDL bridge axiom; the abelian-isotropy carrier-uniqueness rule, already a theorem not an axiom for color; the role-mechanism taxonomy as a declared grammar) that pays the debt in plain sight. The most likely honest outcome on the headline residual (absolute irreducibility) is sharper-OPEN — converting an uncomputable universal negative into a grammar-relative forcing certificate, which is a real epistemic gain, not a promotion.

0.2 Website source-of-truth (link, don't duplicate)

The full construction, the three-layer rule, the selector machinery, the term-by-term dossiers, and the freeze records are the published manuscript, Paper I:

• GUT.html §6.1 (Gate-1 card) — https://physics.magflowmeters.com/articles/GUT.html
• §2 / §2B (the active branch + the binding three-layer rule, authority chain A0→A1→A2→A3→B2→L); §4 (selector machinery: §4.3 two species, §4.5 selector, §4.6 Occam/completeness>minimality, §4.9 data-use); §5.0 (the six-row geometric dictionary, row 1); §6.12 (falsification map, Gate-1 row); §2.6 / line 382 / B2.0.3.3–B2.0.3.5 (category-relativity, the standing review targets).
• Appendices A0 (frozen manifest, 33 rows, meta-hash a5b1e6f9d951); A1 (≥16-sig-fig reconstruction across all three layers); A2 (tensor/bundle/Hilbert ledger); A3 (old→new migration ledger); B1 (selector formalism); B2 (three-layer necessity, proper-subset null-space); C1–C10 (per-term necessity dossiers); R0 (freeze certificate / reproducer); GS (candidate datasheets + elimination funnel, F1–F3 facts, coset verdicts); N.4 (branch-elimination archive, the SU(3)-carrier shelf).
• Downstream Λ / TOE cross-reference (does not touch this gate): Paper IV, TOE.html — https://physics.magflowmeters.com/articles/TOE.html.

This dossier recaps only what is needed to attack; the site controls all common material.

1. How OUR geometry closes the geometry-specification gate — the closure claim (concise)

Full construction: GUT.html §2 + §2B + §4 + Appendices A0/A1/A2/A3/B2 + C1–C10 + R0. This section is the attack-grade recap, not the construction. The canonical anti-drift anchor for the exact object is …/rendered/TOE/00_EXACT_GEOMETRY_ANCHOR.md.

1.1 The object end-to-end

SG-1 is the gate that commits the object. Everything downstream (SG-2 through SG-10) is evaluated against this frozen branch; SG-1 is the load-bearing precondition for the entire program. The object is a three-layer active branch with only the ×-layer carrying metric dimension ($D=4+6+2+1=13$):

 𝔅_active = [ M₄ × K₆ × S² × S¹_Y/Z₂ ]_×           ← STAGE   (metric geometry, 13 dims)
          ⊕ [ F⁺_finite ⊕ C_admiss ]_⊕             ← RULEBOOK (finite admissibility, 0 dims)
          ⊗ [ E_matter ⊕ E_gauge ⊕ E_Higgs ⊕ E_proton ]_⊗   ← ACTORS (bundle/operator, 0 dims)

The load-bearing structure, named so a reader can attack each:

1. The ×-layer (STAGE) — the metric geometry. $\mathcal{M}_4$ (observed spacetime, an observational primitive, not a selected rung); $K_6=SU(3)/T^2$ (flag manifold, color source); $S^2$ (weak source); $S^1_Y/\mathbb{Z}_2$ (hypercharge source + orbifold chirality filter). Gauge forces = isometries of the internal factors. This is the rung whose forcedness is the whole SG-1 attack surface (§3). (Attack handle: the dimension ledger $D=13$ is selected inside R2.5, not derived — the headline residual.)
2. The ⊕-layer (RULEBOOK) — finite admissibility, 0 dimensions. $F^+_{\rm finite}$ (flavor chamber: modulus $\tau=\omega$, projectors, action ladders, operators — the SG-8 object); $C_{\rm admiss}$ (admissibility / anti-fitting firewall / selector / freeze / no-smuggling discipline). It constrains which configurations and deformations are legal. (Attack handle: SG-1 must count only the physics burden of the rulebook, not the governance burden — the F6 circularity hazard.)
3. The ⊗-layer (ACTORS) — bundle/operator content, 0 dimensions. $E_{\rm matter}$, $E_{\rm gauge}=(P,\mathrm {ad}(P),A,F,\rho_{\rm rep},\text{KK spectrum})$, $E_{\rm Higgs}$ (Wilson-line/Hosotani), $E_{\rm proton}$. It constrains which fields/operators are admissible. (Attack handle: the $\mathbb{Z}_6$ center-kernel is read off the matter content, not posited — the SHAPE Lemma 3 / actor-minimality object.)
4. The freeze. Content hash dcc66f1b2685; manifest meta-hash a5b1e6f9d951 (A0, 33 rows). Every primitive and derived object is content-addressed; the R0 reproducer regenerates each hash. This is the only certified mechanical witness of the gate.
5. The four irreducible anchors. $\{M_{\rm Pl},\ \alpha_i(M_Z),\ y_t,\ |V_{us}|\}$ — the declared free inputs. "Why these four values?" is a stated scope boundary (philosophical), not a physics gap. (Attack handle: the honest count adds ~9–10 injected reals beyond these four — §3.)

1.2 What "closed" means here, and its conditionality

"Closed" for SG-1 is specificity + no-layer-smuggling + reproducibility under declared assumptions — strictly not a uniqueness theorem, not "the geometry is derived," not "13D is forced." Per §6.12 the gate is Claimed certificate pass under declared search category, and it downgrades to Open / not claimed (under-defined branch) or Category-relative diagnostic (search-category attack). It is conditional on:

• given-the-declared-category — minimality and the elimination of competitors are evaluated inside R2.5 (forces = isometries; compact; classified structures; admissible bundles); the category is declared, not derived (§2.6).
• given-E — the SM chiral content (and the family index $-3$) is presupposed; SG-1 does not derive $E$. The target ledger $T$ that scores the geometry against rivals has $E$ on both sides; $E$ cancels.
• given-the-anchors — four declared values, counted, plus (honestly) ~9–10 injected reals ($N_d,N_e,N_\nu$, the $\delta$ triple, $\theta_H^\star$, …) that the public "4→22" headline omits.
• given-the-metric — the win over rivals holds under the MDL / description-length metric; under a dimension-first metric a 4D EFT wins and the ladder folds. Which metric is correct is itself open.

The genuine, defensible content (the part that survives the honest accounting):

The conditional / non-genuine content (what SG-1 does NOT certify, despite the surface impression):

So the precise statement of closure: SG-1 freezes a fully specified, layer-complete, reproducible three-layer object and certifies it is the selector-minimal survivor inside the declared category — it does NOT prove the object is unique, forced, or derived, and the honest input cost is ~13–14 reals, not 4.

2. Verify the status — is DECLARED-FROZEN real?

This is the verification a skeptic would run. Each witness gets a grade — hand-checkable / symbolic / machine-lane — and an honest reproduces? flag.

2.1 The witness ledger

2.2 What reproduces, plainly

• The freeze structure is sound by construction. Content-addressing + a reproducer that regenerates every hash is the strongest, most defensible leg: it makes the object a reviewer attacks byte-identical to the object the gates ran on. The discipline (freeze-before-compare, no-smuggling) is genuinely strong and is the whole point of the gate.
• The weak and hypercharge carriers are forced within the grammar, by hand-checkable general theorems. F1 (abelian ⇒ no non-abelian SU(2)) and F2 (closed odd-dim ⇒ mirrors ⇒ LEP exclusion) close the cheaper direction over whole shelves, not named candidates. These are the strongly-forced rungs.
• The color carrier is clean by an architecture-neutral argument (abelian-isotropy uniqueness), and the one concrete cheaper competitor (the K₆→CP² swap) was built end-to-end and BREAKS at Gate 2 — a real structural exclusion, not a "tunable family count" hand-wave.
• The honest input count is ~13–14 reals, and the SHAPE packet states it plainly: the "4→22" headline is overstated and must be corrected. This is not a defect of the gate — it is the gate's own honesty.

2.3 What does NOT yet reproduce (honest gaps in the status)

• The R0 reproducer is referenced, not independently re-run in this audit. "The reproducer regenerates every hash" is the load-bearing mechanical claim; like SG-7's absent δ-harness and SG-8's J.6/K.5 CSV mount, the executable check is declared-not-independently-verified here. Until R0 is mounted and run target-blind, W1/W2/W6 are asserted, not machine-confirmed in this dossier. (This is the cheapest residual to close — §4.)
• "13D is minimal" does NOT reproduce as an absolute or forced claim. It reproduces only as selector-minimal, category-relative (W4/W10). The absolute statement is uncomputable (Kolmogorov), and the manuscript itself declines to claim it (§2.6, B2.0.3.4, line 382). Any reading of SG-1 as "the geometry is forced / derived / unique" is an overclaim the gate does not support.
• The dimension-ladder lower-bound matrix does NOT reproduce as a certified classification. It reproduces as a first-pass survey (W10): every considered competitor loses under MDL. The closing object — the role-mechanism normal-form / exhaustion theorem (SHAPE Certificate 3) — is OPEN, so "no competitor below 13D is shorter" is surveyed, not proven.
• The named SU(3)-carrier shelf is NOT certified complete. K₆ is the cheapest clean SU(3) carrier on a named shelf {K₆, CP²}; N.4 completeness over all admissible SU(3) carriers is uncertified (GS.12), and the manuscript flags this as the intended first review target (line 382).

2.4 Why DECLARED-FROZEN (not higher, not lower)

• Not DERIVED-GIVEN-E (the SG-2/SG-3 tier): SG-1 derives nothing — it declares and freezes an object. SG-2 (gauge recovery) and SG-3 (family index $-3$) are rigid recoveries given this frozen branch; SG-1 is the precondition, not a recovery. There is no "given-E" computation here; there is a freeze.
• Not OPEN/DISCLOSED: the gate genuinely closes its three certified claims (specificity, no-smuggling, reproducibility) — these are real, mechanical, and non-trivial. The branch is not under-defined and no layer is missing. It is more than a disclosure.
• DECLARED-FROZEN is exactly right: a fully specified, frozen, reproducible object whose uniqueness is explicitly NOT claimed — category-relative selector-minimality, with the absolute/forcing question openly open. This matches the SCOPED_GUT ledger SG-1 line verbatim: "Frozen and reproducible, not proven unique."

3. The attack surface — what to attack (ranked by leverage)

Every open residual as a named object with its precise obstruction. Leverage = how much closing it moves the gate (and how much it strengthens the program's foundation, since SG-1 is the precondition for all downstream gates).

3.1 The residual register

3.2 Leverage ranking (attack order)

1. R5 (metric-selection) + R4 (category/shelf completeness) — the two decisive seams; either one, if it goes the wrong way, collapses the minimality claim. R5 is a single theorem; R4 is a completeness obligation.
2. R2 (lower-bound matrix / Certificate 3) — the bounded, tractable "whole remaining job"; closing it upgrades the ladder verdict.
3. R1 (absolute irreducibility) — highest conceptual leverage but provably unreachable in full; the realistic move is to convert it to grammar-relative forcing (a sharper-OPEN, not a closure).
4. R6 (reproducer AUDIT) — cheapest to close (owner artifact); makes the certificate machine-real.
5. R3 / R9 (input-count headline + M₄ axiom) — honesty corrections, already staged/labeled.
6. R7 / R8 / R10 — category-relative bridges (functional-role necessity), actor-minimality (demoted-OPEN), physics-vs-governance separation.

The cardinal honest point. R1, R4, R5 are where "DECLARED-FROZEN, not forced" lives. If a closure path narrows the category (R4) or reverse-engineers the metric (R5) to manufacture a 13D win, it has relocated the problem, not closed it — the κ³/π falsification test and the F6-circularity guard apply in full force here (a minimality metric counts only if it would be written WITHOUT knowing that 13D should win — guard G1). R3/R6/R9 are the non-physics residuals (honesty + reproducibility + a declared axiom); closing them improves the gate's honesty and machine-reality but moves no minimality claim.

4. THE ATTACK PLAN — closure paths (the core)

For each residual: the technique (closure playbook T1 axiom-floor / T4 no-go / T5 firewall / T6 all-operator-conditional / T7 eliminative / T10 selector), the named axiom it could reduce to (stated so it would be written WITHOUT knowing that 13D should win — the κ³/π falsification test + the G1 metric-not-target-fitted guard), the specialist target (theorem to hand off) or the owner artifact (reproducer/CSV/ruling) needed, the math to attempt, and the success ladder (DERIVED-CLOSED rare → AXIOM-CLOSED likely → sharper-OPEN → REFUTED).

4.1 R1 — Absolute irreducibility (the Kolmogorov wall + bottoms-on-E)

Why first. R1 is the ceiling on every minimality statement SG-1 makes. The honest first move is to recognize that "13D is the absolute minimum over all conceivable architectures" is not a theorem to be proven — it is a wrong target. This is the Einstein audit move: the catastrophe is not a math problem, it is a misframed demand.

Technique: T1 (axiom-floor) — name the ceiling honestly; the closure is a reframe, not a proof. The forcing question "no competitor anywhere is shorter" is a universal negative over all architectures, hence uncomputable (it is $K(T)$, the Kolmogorov complexity of the constant set, which is not computable). The deep move — already made in the SHAPE packet — is to declare a finite role-mechanism grammar $\mathcal{G}$, which converts the uncomputable universal negative into a finite, decidable problem (a lower-bound matrix over finitely many normal-form classes). That conversion is the achievement; it does not close the matrix (that is R2).

Named axiom it could reduce to (κ³/π-clean).

AXIOM-GRAMMAR-RELATIVE-FORCING (target-blind form): "Minimality is asserted only relative to the declared finite role-mechanism grammar $\mathcal{G}$ (the five mechanism axes); a competitor using a mechanism not in $\mathcal{G}$ is unconsidered and forces $\mathcal{G}$ to be extended, not the claim to be refuted."

This is writable with no reference to 13D winning — it is a statement about the scope of the claim, not its content. It passes the falsification test by construction. It is also TRUE (the grammar is finite and the certificate is living/extensible). The honest endpoint:

R1 reduces to: "absolute irreducibility is uncomputable; the achievable claim is grammar-relative forcing, living and extensible, and it bottoms on E." This is a sharper-OPEN, not a closure — it correctly retires the wrong target (absolute minimality) and names the right one (grammar-relative forcing = R2).

Specialist target (to hand off). None for R1 itself (it is a framing result). The work it licenses is R2.

Math to attempt. None new for R1 — it is the recognition that R1 is defined away by declaring $\mathcal{G}$, leaving R2 (close the matrix) and R4 (is $\mathcal{G}$/the category fair) as the real objects.

Success ladder. - DERIVED-CLOSED: impossible — absolute MDL over arbitrary programs is uncomputable. Do not promise it. - AXIOM-CLOSED / sharper-OPEN (the honest ceiling): AXIOM-GRAMMAR-RELATIVE-FORCING named; the wrong target (absolute minimality) retired; the right target (close the grammar-relative matrix) handed to R2. This is essentially already where the corrected SHAPE packet stands. - REFUTED: a competitor outside $\mathcal{G}$ is exhibited that is shorter → $\mathcal{G}$ extends (the certificate works as designed), not a refutation.

Honest disposition: sharper-OPEN, reduced to AXIOM-GRAMMAR-RELATIVE-FORCING + bottoms-on-E. Absolute irreducibility is provably unreachable; the closure is to stop demanding it and certify grammar-relative forcing instead. given-E ≠ derivation of E binds here permanently: even the best outcome is "shortest generator of the flavor/coupling data, GIVEN E."

4.2 R2 — The dimension-ladder lower-bound matrix / grammar exhaustiveness (the whole remaining job)

The target without loading. Under MDL the 13D branch wins every considered rung; close the survey into a certified classification so the win holds over every $B\models T$ in the grammar, not just the named ones. The number it must reproduce without a new knob: the boxed inequality $\forall D=4..12\ (+\text{non-dim}),\ \forall j:\ I_{\rm gen,13}+n_{13}\,b+I_{\rm struct,13}<I_{\rm gen}(B_{D,j})+n_{D,j}\,b+I_{\rm extra}(B_{D,j})+ I_{\rm struct}(B_{D,j})$, with the **honest** $n_{13}\approx13$–$14$ (NOT 4).

Technique: T7 (eliminative classification) + T4 (no-go per class). This is the SHAPE Certificate 3 (normal-form/exhaustion theorem) + Certificate 4 (lower-bound matrix). It is a classification theorem in the spirit of the classification of simple Lie groups: tractable iff the right invariants (the five role-mechanism axes) cut the space into finitely many classes, and $T$ does the pruning (only SM-generating architectures enter).

The two proof obligations (the bottleneck):

• (O1) Normal-form / exhaustion, relative to the declared taxonomy. Show every $B\models T$ reduces without increasing $I$ (the no-smuggling / Lemma-4 metric — a role hidden in notation is charged after unfolding) to a mechanism normal form $N_{D,j}$ over the finite axes {gauge-origin, chirality-origin, family-count, flavor-origin, scale-origin}, then bound $I(B_D)\ge L_{D,j}$ via one of {(A) fails $T$, (B) anchor floor, (C) hidden-rule floor, (D) generator floor}. This subsumes R4's SU(3)-carrier seam — the sub-shelf must be exhausted (N.4 completeness), not enumerated.
• (O2) Metric selection, architecture-neutral — handled as R5 (§4.5); (O1) is conditional on it.

Named axiom it could reduce to (κ³/π-clean).

AXIOM-ROLE-MECHANISM-GRAMMAR (target-blind): "Every SM-generating architecture realizes each functional role (gauge, chirality, family count, flavor, scale) by one of the finitely many declared mechanisms; the normal-form classes are the product of these axes."

Writable with no flavor/coupling number and no reference to 13D winning (it references only mechanism types). The 13D branch is itself a tuple (gauge = isometry/coset; chirality = index; family = index; flavor = geometric overlap + fitted normalization; scale = posited anchors) and gets no privileged row — scored by the same codebook (Certificate 2). PASSES the falsification test.

Specialist target (to hand off). "Prove the normal-form theorem (O1): every $B\models T$ reduces cost-non-increasingly to a role-mechanism tuple, and prove the lower bound $I(B_D)\ge L_{D,j}$ for each class." A bounded, hard classification theorem — the single highest-value SG-1 hand-off.

Math to attempt. (1) Compress the 13D generator into pseudocode normal form and measure $S_{13}$ honestly (uses the prior ladder audit; $n_{13}\approx13$–$14$). (2) For each $D=4..12$ + non-dim, prove (A)/(B)/(C)/(D). (3) Publish the completed lower-bound matrix. The first-pass rows already exist (the MDL ladder verdict); the job is to turn the survey into a classification with the no-smuggling charge enforced.

Success ladder. - DERIVED-CLOSED: O1 + O2 both proven → grammar-relative LADDER_FORCED (still grammar-relative, still bottoms on E — not absolute). The honest ceiling of the whole SG-1 forcedness program. - AXIOM-CLOSED (likely): AXIOM-ROLE-MECHANISM-GRAMMAR named + the first-pass matrix carried as a survey → "13D wins the considered class under MDL." Essentially where the packet already stands. - sharper-OPEN: O1 partially proven (some classes lower-bounded, others surveyed) → the matrix is partially closed. - REFUTED: a class is found with a strictly shorter MDL recipe → 13D is not minimal even in-grammar (valuable negative).

Honest disposition: OPEN, tractable-in-principle, reduced to AXIOM-ROLE-MECHANISM-GRAMMAR. Conditional on R5 (the metric). The realistic near-term outcome is AXIOM-CLOSED-as-survey; DERIVED-CLOSED requires the full classification theorem, which is hard but bounded.

4.3 R3 — The ~9–10 injected reals beyond the 4 anchors (the public overclaim)

This is an honesty/claim-boundary residual, not physics. No closure path "solves" it; the task is to state the correct count and bind it.

Technique: T2-guarded restatement (no relocation). The authoritative figure is ~4 anchors + 9–10 injected reals ≈ 13–14 reals total, not "4-in." The injected reals are concrete and named: the fitted normalizations $N_d,N_e,N_\nu$ (SG-8), the $\delta$ threshold triple (SG-7), $\theta_H^\star$ (SG-6). The public "4→22" / "2-in / 19-out" headline pretends only the anchors are inputs.

• The over-correction is also wrong. A "~14-in / ~1.6×" reading that treats frozen within-sector ratios as independently injected is forbidden by the family-level-normalization ban (SG-8 I.4) — over-correcting is as dishonest as overclaiming. The honest figure is the middle one: ~9–10 injected reals beyond the 4 anchors.

Named principle (κ³/π-clean).

AXIOM-HONEST-CHARGED-COST — "the charged cost of the branch is the count of independent measured reals it must inject at the operational resolution (4 anchors + the fitted normalizations + the threshold triple), not the anchor count alone."

Carries no target value; it is a counting discipline.

Action (countersign-gated; nothing applied here, No status was ever upgraded): restate the economy headline as "~22 outputs from ~13–14 effective inputs (4 anchors + 9–10 injected reals)" wherever the "4→22" headline appears. The SHAPE packet's honest-caveat block + the compact-generator audit already carry this — so the residual is "propagate the corrected number to the public site/headline," an owner edit, not a derivation.

Success ladder. AXIOM-CLOSED is not applicable (no physics axiom). The endpoint is DISCLOSED-CORRECTED: the ~13–14 figure stated, both wrong numbers (the ~18-economy overclaim and the ~1.6× over-correction) explicitly retired. The cleanest, lowest-risk honesty win in the gate; requires only an owner countersign.

4.4 R4 — Search-category completeness (R2.5 fairness + the SU(3)-carrier shelf / N.4)

The target without loading. Two sub-residuals, both the corpus's own declared review targets: (a) is R2.5 a fair category? (b) is the named SU(3)-carrier shelf {K₆, CP²} complete (N.4)?

Technique: T7 (eliminative) for the shelf; T5 (firewall) for category fairness.

Route A (the SU(3)-carrier shelf — the one with a real result). The color rung was the historically-flagged weak link. The session result: the K₆→CP² swap was built end-to-end (wsmnjvt55) and BREAKS at Gate 2. The exclusion principle is architecture-neutral and not reverse-engineered:

Abelian-isotropy uniqueness. Among SU(3) cosets SU(3)/R, the maximal torus T² is the unique isotropy that is purely abelian ($C_{SU(3)}(T^2)=T^2$, Cartan only) — injecting no spurious non-abelian factor. CP²'s isotropy $U(2)=(SU(2)\times U(1))/\mathbb{Z}_2$ is non-abelian and a subgroup of color SU(3); by the CSDR centralizer rule it is gauge-active, forcing a lose-lose fork (over-produce SU(2)+U(1) at Gate 2, or isotropy-lock SU(2)_L/ U(1)_Y inside SU(3) violating binding A1.4). So K₆=SU(3)/T² is the unique clean SU(3) color carrier — from rep theory + the centralizer rule alone.

• κ³/π falsification test: PASS. This is derived from $\mathrm{Rep}(T^2)$ vs $\mathrm{Rep}(U(2))$ + the centralizer rule, with no flavor/coupling number in sight; it is stronger than the corpus's original "tunable family count" reason (which was asymmetric and unsound — CP²'s 3-family count is a discrete Spin_c index $r(r+1)/2=3$, not a continuous dial).
• The residual that survives: abelian-isotropy uniqueness closes the named-shelf; the full-shelf N.4 completeness (no OTHER admissible SU(3) carrier below 6D with a clean abelian isotropy) is the cleaner statement to certify. The classification (§1 of the CP² refutation) shows $\dim H\le4$ ⇒ $\dim M\ge4$, with S⁵/Wu killed by odd-dimensionality — so the shelf {CP², K₆} is plausibly the whole sub-6D SU(3) story, but the certification is the work.

Route B (category fairness — R2.5). Is "forces = isometries, admissible bundles" fair, or does it exclude natural competitors? The standing reopen (B.12 condition 7): supply a natural in-category competitor strictly preferred under $\mathcal{R}$ → documented downgrade to category-relative diagnostic. The honest move is not to defend R2.5 as the unique fair category, but to state the claim as category-relative and route the fairness question to the metric (R5) — because enlarging the category (string-style bundle-sourced gauge) re-opens the scale problem, and the manuscript claims nothing there beyond the portability of the discipline (§4.2).

Named axiom it could reduce to (κ³/π-clean).

AXIOM-ABELIAN-ISOTROPY-COLOR (target-blind): "the color carrier is the SU(3) coset whose isotropy is purely abelian (the maximal torus), so the CSDR centralizer survives no spurious gauge factor." — Already a theorem (W9), not just an axiom, for the named shelf; the residual is the full-shelf N.4 certification.

Specialist target. "Certify N.4 completeness: enumerate all admissible compact SU(3)-homogeneous carriers and prove none below 6D has a clean (centralizer-surviving) abelian isotropy other than the K₆/CP² pair, and that CP² breaks at Gate 2." A bounded coset-classification + CSDR check.

Success ladder. - DERIVED-CLOSED: N.4 certified complete + abelian-isotropy uniqueness proven over the full shelf → the color rung is forced within the grammar (not just clean on a named shelf). Reachable — the classification is small. - AXIOM-CLOSED (already standing): AXIOM-ABELIAN-ISOTROPY-COLOR as a theorem on the named shelf + CP² built-and- broken. This is stronger than the original corpus position and is the current honest state. - sharper-OPEN: N.4 stays uncertified → K₆ is the cheapest clean carrier on a named shelf only. - REFUTED: a cheaper admissible SU(3) carrier with a clean abelian isotropy is exhibited → the color rung folds.

Honest disposition: AXIOM-CLOSED on the color shelf (a genuine session win — abelian-isotropy uniqueness + CP²-built-and-broken), with N.4 full-shelf completeness sharper-OPEN; category-fairness (R2.5) routed to R5.

4.5 R5 — The MDL-vs-dimension-first metric-selection question (the decisive seam)

Why this is decisive. Every "13D wins" verdict holds under MDL. Under dimension-first lex order a 4D EFT wins ($k_{\rm dim}=4<13$) and SHAPE folds for everyone. A single theorem — which metric is correct — flips the entire ladder. This is the seam that decides forced-given-E vs merely-selected.

Technique: T1 (axiom-floor) under the G1 metric-not-target-fitted guard. Granularity must enter NOT as "the shape must geometrize / chirality must come from an internal index" (that is the F6 circularity — it renames the answer by narrowing the class to KK architectures). It enters as a metric-selection principle, which is architecture-neutral:

AXIOM-GRANULARITY-MDL-BRIDGE (target-blind, κ³/π-clean): "The cost-floor / Finite Operational Cell Law makes the universe a finite-record system; the natural simplicity measure for a finite-record system is minimal injected information (description length / MDL), evaluated at the operational resolution. Therefore an independently-measured real anchor costs $\Theta(\log(1/\Delta_0))$ bits (large) and a discrete structural choice (a coset, a $\mathbb{Z}_6$, an integer index) costs $O(1)$ bits (small) — so anchor-burden dominates dimension-burden."

This is the architecture-neutral justification the analysis flagged as missing. It is writable from granularity alone, with no clause inserted because it makes 13D win (guard G1 — if the metric is reverse-engineered to favor low anchor count, that is the κ³/π failure → REJECT). Critically, it does NOT presuppose 13D wins — a faithful REFUTED-ECONOMY (the 4D EFT is genuinely simpler under a fair MDL once the generator map is charged) is an acceptable, valuable outcome.

The three sub-claims to prove (the theorem target). - (A) Granularity ⇒ MDL. Derive the description-length functional from the cost-floor/recordability — do not assume it. (A finite-record universe cannot specify infinite-precision continuum data; its admissible descriptions are finite bit-strings; "simplest" = shortest such string = MDL.) - (B) Anchors dominate dimension under $\mathcal{I}$. A measured real to cell resolution costs $\Theta(\log(1/\Delta_0))$ bits; a discrete structural choice costs $O(1)$. (Contrast: dimension-first put $k_{\rm dim}$ first by fiat.) - (C) Economy-win, quantitative + symmetric (guards G2, G5). Build both ledgers $I(B_{13})$ and $I(B_{\rm EFT})$ against the **same** pre-declared target set $T$. Charge the EFT only for reals it must inject as independent facts; free-for-both-and-cancel anything that is an automatic consequence of $E$ + 4D renormalizable gauge invariance (anomaly cancellation, written-spectrum chirality, the $\mathbb{Z}_6$ center-kernel, accidental proton stability) — charging the EFT for these is reverse tuning to the known answer; and counter-charge the 13D branch for its extra-D machinery ($E_{\rm proton}$, the $\delta$ triple, $R_0$, $M_U$, $S^2/S^1$ specs). Crucially (guard G2): the geometry→observables generator map must be charged — if it is a large injected object, the 13D win evaporates and the EFT wins.

Specialist target. "Prove or refute granularity ⇒ MDL (sub-claims A/B/C under guards G1/G2/G5), with the generator map fully charged." This is the single theorem that decides the whole SG-1 forcedness question.

Math to attempt. Derive $\mathcal{I}$ from recordability (A); establish the bit-cost ordering (B); compute the two symmetric ledgers quantitatively with the generator map charged (C), using the honest $n_{13}\approx13$–$14$.

Success ladder. - DERIVED-CLOSED (PROVEN): A + B + C hold with the generator charged → SHAPE upgrades from FOLDED to "realization-minimal under the granularity-induced information metric, GIVEN E" — the 4D EFT is excluded on a principled basis. Decisive if it holds. - AXIOM-CLOSED (CONDITIONAL): A holds but C needs one named, plausibly-cheap fact about the generator map → AXIOM-GRANULARITY-MDL-BRIDGE named, with one residual. - sharper-OPEN (REFUTED-METRIC): granularity does not uniquely select MDL → the fork is undecided → SHAPE stays selected. - REFUTED (REFUTED-ECONOMY): under a fair $\mathcal{I}$ the generator map is not cheaper than the ~16 reals → the 4D EFT wins → the simpler 4D realization is the correct one; the 13D geometry is selected, not minimal. An honest, equally valuable discovery.

Honest disposition: OPEN, the decisive seam, reduced to AXIOM-GRANULARITY-MDL-BRIDGE under guard G1. This is the single most important SG-1 theorem. A REFUTED-ECONOMY outcome (the 4D EFT genuinely wins) is not to be feared or suppressed — it is the honest other-possibility, and reporting it as such is a successful run. The closure campaign's SCALE-firewall verdict (the cell μ_cell has no v-independent readout; anchoring it at dV/dσ=0 is circular) is the cautionary precedent: a root posit that looks derivable can be confirmed circular — so the G1/G2 guards must be enforced before banking any 13D win.

4.6 R6 — The R0 reproducer is AUDIT (the cheapest mechanical close)

The obstruction. "The R0 reproducer regenerates every hash" is the gate's only certified mechanical witness, but it is referenced, not executed in this audit — the same class as SG-7's absent δ-harness and SG-8's J.6/K.5 CSV mount.

Technique: owner artifact (machine-lane), not an axiom. A fail-closed reproducibility task, not a physics closure.

Owner artifact needed. (1) Mount the R0 reproducer + the A0 manifest (33 rows). (2) Run it target-blind. (3) Confirm it regenerates the content hash dcc66f1b2685 and the meta-hash a5b1e6f9d951 byte-equal. (4) Confirm A1's ≥16-sig-fig reconstruction recomputes from the frozen primitives.

Math to attempt. None new — execution + verification. The check is mechanical and fail-closed: if any hash cannot be regenerated, the gate downgrades from Claimed certificate pass to Open / not claimed (under-defined branch), per §6.12.

Success ladder. BLOCKED_INPUTS until the reproducer is mounted → then either VERIFIED (hashes regenerate; "Claimed certificate pass" becomes machine-real) or REFUTED (a hash fails → downgrade). Highest value-per-effort closeable item — it converts an asserted certificate into a machine-checked one with no new physics.

Honest disposition: AUDIT → mount the reproducer; expected VERIFIED. This is the one residual that, closed, makes the certified part of SG-1 (specificity + reproducibility) genuinely machine-real rather than declared.

4.7 R7 — B2 / C1–C10 are category-relative + conditional (the functional-role bridge)

The obstruction. B2 (three-layer necessity) is an in-category null-space result, explicitly not a universal no-go (B2.0.3.4). C1–C10 (term necessity) are conditional on the declared term-construction + failure ledgers.

Technique: T1 (axiom-floor) via the functional-role necessity theorem. The bridge from category-relative to architecture-neutral is already drafted: the functional-role necessity theorem proves $\mathcal{C}_{\rm phys} \Rightarrow \mathrm{Stage}+\mathrm{Rulebook}+\mathrm{Actors}$ — any admissible architecture must carry functional equivalents of the three roles, whether or not it uses the $\times/\oplus/\otimes$ notation (proven by contradiction on each role).

Named axiom it could reduce to (κ³/π-clean).

AXIOM-FUNCTIONAL-ROLE-FLOOR (target-blind): "any architecture satisfying the architecture-neutral physical constraint set must contain functional equivalents of a Stage, a Rulebook, and Actors ($k_{\rm role}\ge3$)."

Writable with no geometry names; it is the architecture-neutral floor the corpus does earn (necessary, not sufficient). PASSES the falsification test.

Specialist target (the next theorem). Upgrade B2 from "three-layer necessity inside the declared category" to "functional three-role necessity for any admissible architecture" (the functional-role necessity theorem, already PARTIAL), then attempt the realization-minimality theorem $\mathrm{Unfold}(B)\succeq\mathrm{Unfold}(B_{\rm active})$ — which is R2/R8 territory.

Math to attempt. Defeat the F6 circularity per role (Gate 0): state each role-requirement architecture-neutrally with no hidden reference to the submitted factor set; then the contradiction proof (a role-free admissible competitor is impossible) gives the floor.

Success ladder. - DERIVED-CLOSED: realization-minimality proven (R2/R8) → the exact realization is minimal. Hard (needs the competitor audit, Lemma 5). - AXIOM-CLOSED (essentially standing): AXIOM-FUNCTIONAL-ROLE-FLOOR named; B2 upgraded to architecture-neutral role-necessity. A real strengthening over category-relative B2. - sharper-OPEN: role-necessity holds but realization-minimality stays open (the likely state). - REFUTED: a role-free admissible competitor is exhibited → the floor fails (the F1 falsifier of the theorem).

Honest disposition: AXIOM-CLOSED at the functional-role floor; realization-minimality (the exact factor set) sharper-OPEN. The floor is necessary-not-sufficient; it does not prove the 13D realization is the unique minimum.

4.8 R8 — Actor-layer minimality (SHAPE Lemma 3) + E un-forced (the demoted-OPEN)

The obstruction. Is $E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}$ the minimal actor realization? The closure campaign DEMOTED the attacker's AXIOM_CLOSED to OPEN under the overclaim test: Lemma 3's success criterion is a universal negative ("no admissible competitor supplies lower $k_{\rm actor}$") that is UNMET (competitor matrix all Tier-1 "Unknown"; NCG flagged as a serious un-scored role-equivalent), plus a second residual ($E$ un-forced; the corpus T3 was REFUTED) stays open.

Technique: T10 (selector) under T2 relabel guard. The narrowest layer — attack first (if actor-minimality fails, realization-minimality fails fast).

Named axiom it could reduce to (κ³/π-clean).

AXIOM-ACTOR-MDL-MINIMALITY-GIVEN-E (target-blind): "the actor layer is the minimal-MDL bundle/operator realization of the matter/gauge/Higgs/proton + observable-algebra + center-kernel content, given E." — Carries no target value; the $\mathbb{Z}_6$ kernel is COMPUTED ($q\equiv3z_2-2z_3\bmod6$), not posited.

The honest blocker (why it stays OPEN, not AXIOM_CLOSED): even granting the named axiom, the success criterion is a universal negative that is undischarged, and $E$ is un-forced (a second residual, left OPEN not axiomatized). Reduction-to-(axiom)+(un-forced E)+(undischarged universal-negative) = OPEN. Folding two open obligations into one axiom would be overclaiming.

Specialist target. "Score the actor-layer competitor matrix target-blind (especially NCG's finite Dirac operator as a role-equivalent), and prove no competitor supplies lower $k_{\rm actor}$ given E." The $\mathbb{Z}_6$ center-kernel computation is the partial support already in hand.

Success ladder. - DERIVED-CLOSED: competitor matrix scored + no-alternative proven → actor-minimality given E. Unlikely (universal negative). - AXIOM-CLOSED: would require discharging the universal negative — currently UNMET. - sharper-OPEN (the honest standing): reduced to AXIOM-ACTOR-MDL-MINIMALITY-GIVEN-E + un-forced E + the undischarged competitor audit. This is the demoted-OPEN disposition. - REFUTED: a lower-$k_{\rm actor}$ competitor (e.g. NCG) is scored cheaper → actor-minimality folds.

Honest disposition: OPEN (demoted on skeptic-verify). The actor layer is a strong candidate with the $\mathbb{Z}_6$ kernel computed, but the no-alternative obligation is undischarged and E is un-forced. Do not bank AXIOM_CLOSED here — the campaign already corrected that.

4.9 R9 — $\mathcal{M}_4$ is a declared axiom, not a forced rung

The obstruction. The 4D Lorentzian stage is an observational primitive — the comparison surface KK reduction lands on, declared, not an output of the funnel. No cheaper-carrier competition is run for it.

Technique: T1 (axiom-floor) — name it as a declared axiom. There is nothing to derive; the honest move is the clean statement.

Named axiom (κ³/π-clean).

AXIOM-M4-OBSERVATIONAL-PRIMITIVE — "the observed 4D Lorentzian sector is a declared observational primitive, the external comparison surface, not a selected or forced rung."

Carries no target value; it is a scope declaration.

Action. Keep $\mathcal{M}_4$ labeled as a declared axiom in the ladder accounting (it already is — the SHAPE ladder context labels it "axiom, not selected"). It should not be counted as a forced rung in any forcedness claim, and not be cited as a derivation.

Success ladder. DISCLOSED-CONSISTENT — already in place. No AXIOM-CLOSED-as-derivation is applicable (it is a primitive by design). The residual is a labeling consistency sweep, not a closure.

Honest disposition: DISCLOSED (correctly labeled). Not a defect — it is the gate's honesty about what is observed vs derived.

4.10 R10 — Rulebook physics-vs-governance separation (the F6 hazard)

The obstruction. Several $C_{\rm admiss}$ requirements (freeze-before-compare, gate-status discipline) are governance rules, not architecture-neutral physics. Counting them in the minimality burden risks F6 circularity (the constraint set presupposing the submitted architecture).

Technique: T5 (firewall) — separate physics burden from method burden. To avoid F6, the rulebook minimality (SHAPE Lemma 2) must separate the physics the rulebook enforces (flavor closure, anomaly cancellation, admissibility) from the method discipline (freeze, gate-status), and count only the physics burden.

Named axiom (κ³/π-clean).

AXIOM-RULEBOOK-PHYSICS-ONLY — "only the physics the rulebook enforces (anomaly admissibility, flavor closure, chamber constraints) is charged in the minimality burden; freeze/gate-status discipline is method, charged to no candidate."

Carries no target value; it is the no-smuggling/F6 guard for the rulebook layer.

Specialist target. "Restate $\mathcal{C}_{\rm phys}$ architecture-neutrally (Gate 0), separating physics from governance, so the rulebook-minimality lemma (Lemma 2) is non-circular." Note: Lemma 2 is flagged highest-risk ($F^+$ is the program's weakest link — see SG-8 R1).

Success ladder. - AXIOM-CLOSED: AXIOM-RULEBOOK-PHYSICS-ONLY named + the physics/governance split made formal → the rulebook burden is countable non-circularly. The realistic outcome. - sharper-OPEN: the split is partial; some requirements resist clean classification. - REFUTED: the rulebook's physics burden is shown reducible by a cheaper competitor → Lemma 2 folds.

Honest disposition: OPEN, reduced to AXIOM-RULEBOOK-PHYSICS-ONLY (the F6 guard). A prerequisite for any architecture-neutral minimality upgrade; not a physics gap, a methodology guard. Tied to SG-8's R1 ($F^+$ weakest link) since $F^+\subset C_{\rm admiss}$.

4.11 Attack-plan roll-up

REDUCE-vs-RELOCATE verdict on the plan. The plan does not turn one hard problem into three harder ones. Run the explicit harder-subproblem check:

• R1 is defined down, not relocated: declaring the grammar $\mathcal{G}$ converts an uncomputable universal negative into the bounded R2 — strictly easier, and honestly labeled "absolute is unreachable."
• R4 (color) is a genuine REDUCE: abelian-isotropy uniqueness + CP²-built-and-broken replaced an asymmetric "tunable family count" hand-wave with an architecture-neutral theorem — the subproblem (N.4 full-shelf) is smaller than the original.
• R2, R5 are the two hard objects, but each is a single bounded theorem (a classification; a metric-selection derivation), not a fan-out into harder pieces — and both carry explicit κ³/π + G1/G2 guards so a target-fitted or reverse-engineered closure cannot be banked.
• R3, R6, R9 are mechanical (owner edit / reproducer run / labeling) — strictly easier.
• R7, R8, R10 are category-relative bridges, each reduced to a single named floor axiom.

The two genuine-physics theorems (R2, R5) are the same size or smaller than the original gate (one classification, one metric derivation), and both can land at REFUTED (the matrix has a shorter recipe; the 4D EFT genuinely wins) — which would be honest, valuable discoveries, not failures. The honest expected outcome of a full campaign: 1 sharper-OPEN reframe (R1), 1 AXIOM-CLOSED-as-survey + open classification (R2), 1 DISCLOSED-CORRECTED (R3), 1 AXIOM-CLOSED on the color shelf (R4, a session win), 1 OPEN decisive theorem (R5), 1 VERIFIED (R6, the reproducer), 1 AXIOM-CLOSED at the role floor (R7), 1 demoted-OPEN (R8), 1 DISCLOSED (R9), 1 OPEN-with-F6-guard (R10). No DERIVED-CLOSED is promised on the forcedness question; the gate would move from DECLARED-FROZEN-with-asserted- reproducibility to DECLARED-FROZEN-with-machine-verified-reproducibility + a named axiom floor + an architecture-neutral color-carrier theorem — a real honesty/reproducibility/forcedness gain, not a promotion.

A. Anchoring & Hardening Map

This is SG-1's §3 residual register run through our internal honesty methodology: for each residual, classify it gap-vs-wall (a gap has a known route — what is missing is a computation, a written certificate, or a measured input; a wall is where the route itself is the problem — no known method, or the only escape secretly assumes the answer), hunt the implicit assumption it rides on, and then ask the decisive terminate-on question: what measured invariant must this residual ultimately terminate on — does it reduce to an existing anchor, need a new named invariant, hinge on a scheme-anchor, sit as a computation-debt, or have no witness (→ OPEN)? The disposition vocabulary follows the live Gaps & Walls Register (/articles/GAPS_AND_WALLS_REGISTER.html): the core eight labels are the Register's — DERIVED (connected to an already-measured fact, no new assumption) / DERIVED-GIVEN-E (rigid once the SM content E is supplied) / AXIOM-CLOSED (reduced to one named, value-free, unproven posit) / DISSOLVED (a false premise dropped) / SCHEME-ANCHORED (a number reachable only after one named technical choice) / OPEN (genuinely unsolved, or the only escape assumes the answer) / BLOCKED (route exists, required file/input missing) / measured-but-irreducible. A handful of finer per-residual labels used below (AUDIT / DISCLOSED / DISCLOSED-CORRECTED / sharper-OPEN) are strictly-weaker refinements of those eight — narrowings of OPEN/BLOCKED for bookkeeping clarity, never promotions above them. SG-1's existing anchor set is {ℏ (granularity residue), M_Pl, spectrum-E, α_i(M_Z), y_t, |V_us|}; the honest charged cost adds ~9–10 injected reals on top of the four headline anchors.

A.1 Per-residual anchoring & hardening table

A.2 Gate-level rollup

Overall disposition. SG-1 stays DECLARED-FROZEN — a serious candidate, NOT validated, exactly as the live Register records it. Its one genuinely DERIVED leg is reproducibility (R6, once the R0 reproducer is mounted — a mechanical content-hash check that lowers no assumption floor). Everything that touches forcedness is weaker than derivation: two residuals reduce to a named AXIOM-CLOSED floor (R4 color-shelf, R7 functional-role), one is DISCLOSED-CORRECTED (R3), two are clean DISCLOSED/AXIOM-CLOSED scope items (R9, R10), and the load-bearing forcedness residuals stay OPEN — R1 (uncomputable wall → sharper-OPEN), R2 (bounded computation-debt), R5 (the decisive metric wall), R8 (demoted-OPEN with E un-forced). No residual terminates on a measured invariant in a way that derives the geometry; every chain bottoms on spectrum-E (given-E, never from-nothing), and the deepest forcedness chain (R5) bottoms on the GRANULARITY root (residue ℏ), which is itself only AXIOM-CLOSED. No new measured invariant is created and no anchor floor is lowered: No status was ever upgraded.

Anchors it depends on. SG-1 charges the four headline anchors {M_Pl, α_i(M_Z), y_t, |V_us|} plus the honest ~9–10 injected reals (N_d, N_e, N_ν, the δ-triple, θ_H⋆) — ~13–14 reals total. It witnesses itself on the frozen-object hashes (dcc66f1b2685 / a5b1e6f9d951, the DERIVED reproducibility leg). The forcedness question additionally depends on the un-anchored GRANULARITY root (R5) and bottoms permanently on spectrum-E (R1/R2/R7/R8/R10). It anchors on no new measured number — that is precisely why the forcedness claim is selected-not-forced.

Single highest-leverage hardening move. R5 — prove or refute the granularity ⇒ MDL metric-selection theorem (AXIOM-GRANULARITY-MDL-BRIDGE) with the geometry→observables generator map fully charged (guards G1/G2/G5). It is the one object that flips the entire ladder: it decides forced-given-E vs merely-selected, it resolves R4's category-fairness sub-residual and gates R2's matrix, and its honest REFUTED-ECONOMY outcome (the simpler 4D EFT genuinely wins) is an equally valuable discovery — never to be feared or suppressed. The cheapest hardening move (R6, mount the reproducer) makes the certified leg machine-real; the most decisive is R5.

🎯 Target anchor(s) for this gate

In the terminate-on (anchoring) sense, SG-1 reduces to the observed spectrum E (the SHAPE shape-anchor) — and to nothing else measurable. Every forcedness chain (R1/R2/R4/R7/R8/R10) bottoms on spectrum-E, which sits on both sides of the target ledger T and therefore cancels: SG-1 is measured-but-irreducible on E, never a derivation of E (given-E ≠ derivation of E). The one genuinely DERIVED leg, reproducibility, instead terminates on the frozen-object hashes (dcc66f1b2685 / a5b1e6f9d951) as a content-addressed self-witness, not a physics invariant. Absolute minimality has NO witness: it would require a new MDL / simplicity-metric invariant (the granularity ⇒ MDL bridge, R5, whose deepest chain bottoms on the un-anchored GRANULARITY root, residue ℏ) — that invariant does not exist today and is uncomputable in its absolute form, so the absolute- forcedness target stays OPEN (sharper-OPEN at best, reframed as grammar-relative forcing). The MDL-vs-dimension- first metric is SCHEME-ANCHORED (a number reachable only after one named, currently-unproven metric choice, R5). No new measured invariant is created and no anchor floor is lowered: No status was ever upgraded.

5. References & source map

5.1 Website source-of-truth (common material — link, don't duplicate)

• Paper I, GUT.html — https://physics.magflowmeters.com/articles/GUT.html
• §6.1 Gate-1 card (binding status: Claimed certificate pass); §6.12 falsification map (Gate-1 row: Claimed certificate pass under declared search category → Open/not claimed or Category-relative diagnostic); §6.13 certificate-status summary.
• §2 / §2B the active branch + the binding three-layer rule (authority chain A0→A1→A2→A3→B2→L); §4 selector machinery (§4.3 two species; §4.5 selector; §4.6 Occam / completeness>minimality / "the selector pays dimensions for forcedness"; §4.9 data-use firewall); §5.0 the six-row geometric dictionary, row 1.
• §2.6 / line 382 / B.12 condition 7 / B2.0.3.3–B2.0.3.5 category-relativity + the standing reopen (the intended first review targets).
• Appendix A0 frozen manifest (33 rows, meta-hash a5b1e6f9d951); A1 ≥16-sig-fig three-layer reconstruction; A2 tensor/bundle/Hilbert ledger; A3 old→new migration ledger; B1 selector formalism; B2 three-layer necessity (proper-subset null-space); C1–C10 per-term necessity dossiers (failure-if-removed); R0 freeze certificate / reproducer; GS candidate datasheets + elimination funnel (GS.2 facts F1–F3, GS.5 coset verdicts, GS.10 funnel, GS.12 N.4-completeness disclaimer); N.4 branch-elimination archive (the SU(3)-carrier shelf).
• Paper IV, TOE.html — https://physics.magflowmeters.com/articles/TOE.html (Λ / TOE cross-reference only; does not touch SG-1).

This dossier recaps only what is needed to attack; the site controls all common material.

5.2 Corpus locations (authoritative inputs to this dossier)

5.3 Frozen-object hash index (load-bearing; READ-ONLY)

Branch content dcc66f1b2685 · manifest meta a5b1e6f9d951 (A0, 33 rows) · stage primitives $K_6=SU(3)/T^2$, $S^2$, $S^1_Y/\mathbb{Z}_2$ (R1.2) · orbifold freeze R1.3 ac4d2df3e708 · $F^+$ chamber + projectors (R1.4 + R1.6) · UV package $M_U\sim10^{16}$ GeV, $R_0=1.592\times10^{-17}\,\mathrm{GeV}^{-1}$, threshold $\delta=(+4.8424,-3.1112,-1.7313)\pm1.6\times10^{-3}$ · family index $\chi(K_6,E)=-3$. The four anchors $\{M_{\rm Pl},\alpha_i(M_Z),y_t,|V_{us}|\}$ are DECLARED (free inputs), not frozen-derived; the ~9–10 injected reals ($N_d,N_e,N_\nu,\delta$-triple,$\theta_H^\star$,…) are the honest additional charged cost.

Closing honest statement

SG-1 is DECLARED-FROZEN. Its genuine, defensible content is real and strong: a fully specified, layer-complete, reproducible three-layer object — $\mathfrak{B}_{\rm active}$ frozen as content hash dcc66f1b2685 / meta-hash a5b1e6f9d951, with no-layer-smuggling (B2), term-level load-bearing (C1–C10), and an R0 reproducer regenerating every hash; the weak (S², F1) and hypercharge (S¹_Y/Z₂, F2) carriers forced within the grammar; the color carrier clean by an architecture-neutral theorem (abelian-isotropy uniqueness — and the one cheaper competitor, CP², was built end-to-end and BREAKS at Gate 2). Its honest open surface is equally clear: the gate is a freeze certificate, NOT a derivation and NOT a uniqueness theorem; minimality is selector-minimal, category-relative ONLY; absolute irreducibility is OPEN (Kolmogorov-uncomputable) and the gate bottoms on E; the dimension-ladder lower-bound matrix is a survey, not a certified classification; the search category + the SU(3)-shelf completeness (N.4) are the corpus's own intended review targets; the honest charged cost is ~13–14 reals (4 anchors + 9–10 injected), not the "4-in" headline; and the MDL metric under which 13D wins is itself unproven against the dimension-first alternative (under which a 4D EFT wins and the ladder folds). The attack plan reduces these to named, target-blind axioms and two bounded falsifiable theorems — the role-mechanism normal-form classification (R2) and the granularity ⇒ MDL metric-selection theorem (R5) — with the κ³/π falsification test and the G1/G2 metric-not-target-fitted guards in force so a target-fitted or reverse-engineered 13D win cannot be banked. The realistic ceiling is a machine-verified reproducer over a named axiom floor + an architecture-neutral color-carrier theorem, with absolute forcedness reframed as grammar-relative forcing — not a promotion; a REFUTED-ECONOMY (the simpler 4D realization is the correct one) remains a live, honest, equally valuable outcome. No status was ever upgraded; frozen branch dcc66f1b2685 / a5b1e6f9d951 READ-ONLY; given-E ≠ derivation of E; selection ≠ derivation; category-relative ≠ absolute; nothing applied, nothing deployed.

Dossier built 2026-06-24. Our geometry (13D K₆ branch) only. Common material referenced to the published website source-of-truth, not duplicated.