SOURCE: https://physics.magflowmeters.com/gates/dossiers/deeproot-granularity.html
======================================================================

DeepRoot — Granularity / cost-floor — dossier & ledger 

 ← Gates scoreboard · Jump to closure ledger 

 Gate dossier — DeepRoot — Granularity / cost-floor

 Question: Does reality have a smallest meaningful step? 
 Status (fixed): REDUCED-TO-AXIOM · ANCHORED +1 
 Full 13-dimensional treatment: the frozen arena M4 x K6=SU(3)/T2 x S2 x S1_Y/Z2, all three layers, full precision. Self-contained — every value derived or stated inline. 

 Required endpoint (2026-07-06)

 Status: CLOSED / REDUCED-TO-AXIOM .

 Nothing left. Anchored on: 

 Shape: the frozen 13D carrier — ordinary spacetime × the compact internal shape K6 × S2 × a folded hypercharge circle — supplies the records whose reconstruction is being priced

 Granularity: the world is recorded in finitely many distinguishable steps, each carrying a positive cost floor Δ0 > 0 (a frame-independent floor on action/information cost, NOT a smallest length and NOT a spacetime lattice); this is the root under reduction

 Scale: the floor is a floor on a Lorentz-scalar cost, which is exactly what keeps it frame-independent (no preferred frame, no smallest length) · Named axioms: (1) the Uniform Operational Cell Law Δ0 > 0 (one value-free posit); (2) the common-currency / minimum-description-length aggregation rule that converts per-record costs into a single economy currency (declared, not yet derived)

 Observables: ℏ (Planck's constant) — the measured size of the cost floor, consumed as a residue, MEASURED not derived by this gate. No other measured value is load-bearing (kB, the Bekenstein constant and Δ0 itself are residues outside this gate's scope). The economy comparison is spectrum-neutral: the ~13–14 measured Standard-Model reals appear on both sides and cancel; the gate reproduces no new number.

 Dissolution: No hidden derivation is claimed. The residual bottoms on the named value-free axiom/common-currency rule rather than an unbounded obligation.

 This is the current gate-level endpoint. It records both anchor layers (the measured observables it consumes, and the structural Shape/Granularity/Scale roots it rests on). The detailed dossier below is retained in full.

 Executive summary & honest status

 Headline. Reality having a smallest operational step is, on this root, no longer a bare confession bolted onto the theory from outside. The granularity root — the existence of a positive floor on the cost of a distinguishable transition, the structural fact that makes a quantum of action possible at all — has been compressed to exactly one named, value-free posit (the Uniform Operational Cell Law, Δ₀ > 0) plus exactly one genuinely atomic measured anchor (ℏ, the measured action spacing). Everything else in the chain that gets you from "records exist" to "a positive floor exists" is proved outright or proved conditionally on that single posit. The terminal is REDUCED-TO-AXIOM / ANCHORED +1 , and it is fixed at that grade for this dossier: it is not upgraded, and it is not softened. A skimmer should take away one sentence: the floor's existence is compressed to one posit and one measured residue; the no-derivation is earned by two decisive countermodels, not asserted by fiat. 

 This is a load-bearing distinction from the ordinary meaning of "we assumed it." The granularity program did not simply declare "let there be a smallest action ℏ" and move on. It ran the honest attack — can the existence of a positive cost floor be derived from causal-resource finiteness alone, with no quantum mechanics smuggled in as an input? — found the precise place where that attack fails, banked two decisive countermodels that show it fails necessarily (not just fails-so-far), and then named the exact minimal statement that must be added to make the rest of the chain go through. That is the qualitative difference between REDUCED-TO-AXIOM and a bare unexamined assumption: the posit was earned by first ruling out its derivation, not asserted in place of doing the work.

 The precise claim, stated with the object every layer pins. Work throughout in the complete, frozen 13-dimensional arena
$$
\mathfrak{B} {\rm active} = \big[\mathcal{M}_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2\big] \times \;\oplus\; \big[\mathcal{F}^+ {\rm finite}\oplus\mathcal{C} {\rm admiss}\big] \oplus \;\otimes\; \big[\mathcal{E} {\rm matter}\oplus\mathcal{E} {\rm gauge}\oplus\mathcal{E} {\rm Higgs}\oplus\mathcal{E} {\rm proton}\big] \otimes,
$$
with \(K_6 = SU(3)/T^2\) the full \(A_2\) flag manifold, \(D = 4+6+2+1 = 13\) . This granularity root, however, is unusual among the gates that live inside this arena: it sits below the geometry rather than as a consequence of it. Its × Stage is not the metric factors of \(\mathfrak{B}_{\rm active}\) but the bare record interface — a space \(D\) of distinguishable records, admissible tests \(T\) , and outcome frequencies \(P(e\mid r,T)\) — the minimal furniture needed to state a pre-Hilbert operational metric at all. Its ⊕ Rulebook is the choice of cost currency, fixed throughout as $B = $ action or energy·time (never bits — see the relabel guard below) together with the convention that "cost" attaches only to transitions between operationally distinguishable (not merely non-identical) records. Its ⊗ Actors are the cost functional \(c:D\to\mathbb{R}_{\ge0}\) and the operational distance
$$
d_{\rm op}(r,s) = \sup_{T,e}\big|P(e\mid r,T) - P(e\mid s,T)\big|,
$$
a supremum over admissible tests and outcomes with no Hilbert space, no inner product, no Born rule, no trace distance anywhere in its statement or its domain . The three-layer discipline is carried explicitly for this reason: a residual seen under a truncated object (e.g. quietly assuming Hilbert orthogonality to define "distinguishable") is exactly the circularity this program set out to break, and stating all three layers inline is what keeps that circularity from re-entering unnoticed.

 Given that object, the claim is: (i) if the space of distinguishable records \(D\) is compact and the cost \(c\) is continuous and strictly positive off \(D\) 's boundary of validity, then a positive floor \(\varepsilon = \min_D c > 0\) follows by the extreme value theorem — no posit needed, a genuine theorem (labeled T5 in the derivation chain, §3.3 below). (ii) Compactness of \(D\) itself is not free: it follows from a Finite Test-Compression law (FTC) plus a completeness (Cauchy-closure) hypothesis, by an explicit finite-net construction (Theorem B, conditional, §3.4). (iii) FTC does not follow from finite causal resources alone — this was tested directly and it fails, with a fully worked countermodel (the delta-test on \([0,1]\) , Theorem A, a banked loss, §3.4–3.5). (iv) The single move that repairs this is to posit directly that the record-keeping substrate carries one universal, system-independent positive resolution quantum \(\Delta_0 > 0\) (the Uniform Operational Cell Law) — from which FTC follows by an explicit, non-circular basin-packing argument, \(N \le \lfloor B/\Delta\rfloor < \infty\) with \(M \lesssim (B/\Delta)^2\) (§3.6). (v) That the posit must be uniform , and not merely available system-by-system, is itself demonstrated by a second decisive countermodel (basin-shallowing: a landscape of basins with depths \(d_n = B\cdot 2^{-n-1}\) , \(\sum_n d_n = B/2 < B\) , yet \(\inf_n d_n = 0\) — finite total resource with no smallest cell) — so "uniform" is not a redundant flourish, it is exactly the content that per-system finiteness cannot supply (§3.7). (vi) The value of the floor — the fact that it equals \(\hbar\) — is never derived on this root; it is a measured residue, entering only as ℏ ≈ 1.0546×10⁻³⁴ J·s, on the same "just is" footing as the four frozen headline anchors { \(M_{\rm Pl}\) , \(\alpha_i(M_Z)\) , \(y_t\) , \(|V_{us}|\) } that anchor the rest of the 13D construction.

 The explicit non-claims — what this dossier denies is proven, stated as bright lines. First, this is not a derivation of granularity from a strictly weaker principle. The attack on that stronger claim (call it Fork A) was run in earnest and is ruled out from the stated premises by the two countermodels above; what survives is the named-posit route (Fork B), and the dossier will not blur that line. Second, this is not "zero posits." The gate-specific granularity posit count is one — the Uniform Operational Cell Law — not zero. A tempting shortcut exists (identify the action spectrum with a discrete, equally-spaced spectrum on a closed generating circle, invoking a Pontryagin-type duality between existence-plus-discreteness of the grain and compactness of the underlying phase); this relocates the uniformity posit onto phase compactness but does not eliminate it, and deriving that phase compactness from unitarity would be circular — it would put granularity downstream of quantum mechanics, exactly the circle this program broke. So the posit count is pinned at one, not zero, and "zero posits" is explicitly named as a refused promotion risk. Third, this is not a derivation of the value of ℏ, \(k_B\) , the Bekenstein constant, or \(\Delta_0\) — the program is about structure (that a floor exists), never magnitude (what it equals); asking this root to produce the number \(1.0546\times10^{-34}\) J·s from pure structure is outside what any reconstruction of this kind can deliver, on the same footing as asking why \(M_{\rm Pl}\) has the numerical value it has. Fourth, this is not a claim of spacetime discreteness — no smallest length is asserted anywhere; only a floor on a Lorentz- scalar cost (action or information), which is precisely what lets the reframe dodge the usual "a length floor picks a preferred frame" objection for free, since cost/action/information transform as scalars under Lorentz boosts while a spatial lattice constant does not. Fifth, and most importantly for calibrating the ceiling correctly, this is not a claim of strict irreducibility — the dossier does not assert that no deeper principle anywhere, in any future theory, could ever sit below this floor. That is a universal negative over an open-ended domain, unprovable for any root in any field of physics, and the program rates its own odds of ever establishing it at approximately 0%. The honest ceiling is co-fundamentality : the cost floor sits at-or-below quantum mechanics, thermodynamics, and gravity in the order of logical implication, and that bounded, testable claim — not strict irreducibility — is the real ceiling this root has earned.

 What this dossier establishes, and what it does not, in one paragraph. It establishes that four pieces of scaffolding around the granularity posit are rock solid and independently checkable: the extreme-value-theorem floor (T5, an unconditional theorem given compactness), the conditional compactness proof from a finite test-compression law plus completeness (Theorem B, a valid proof with every constant tracked, \(d_{\rm op}\le 3\eta\) explicit), the sufficiency of a uniform cell law for that compression law (basin-packing, a sound conditional argument that imports no quantum mechanics, no Bekenstein bound, no thermodynamics), and a genuinely pre-Hilbert operational metric that reduces to ordinary classical total variation distance on classical record spaces (breaking what would otherwise look like a circular appeal to Hilbert-space orthogonality to even define "distinguishable"). It also establishes, by direct construction of two countermodels, that the attempted stronger claim — deriving the existence of that floor from finite causal resources with no further assumption — is not available: finite extent, finite duration, and finite action-or-energy-time budget are compatible with an operational metric that has no finite test-compression (the delta-test on \([0,1]\) ) and are separately compatible with per-system finiteness that nonetheless has no universal smallest cell (the basin-shallowing landscape). What it does not establish is a derivation of the granularity posit itself, a numerical prediction of ℏ, a proof of spacetime discreteness, or a proof of strict irreducibility; nor does it close the two live open problems that a specialist could still attack — deriving the finite test-compression law from strictly weaker primitives (Hole 1, the keystone, carrying an honestly stated ~15–20% odds of flipping the derivation arrow on some future framework), and certifying the co-fundamentality ordering directly (Hole 3, the same underlying object as Hole 1). Both remain marked OPEN in this dossier exactly as they are in the underlying record; closing either is explicitly flagged as the single largest possible future move on this root, and closing them would upgrade the grade from REDUCED-TO-AXIOM toward DERIVED — a change this document does not make and does not anticipate making here.

 The single-sentence endpoint preview. The chain that follows shows, in full, why the floor's existence collapses to one posit (Δ₀ > 0) sitting beside one measured residue (ℏ) rather than to zero posits or to a derivation, and why that collapse — not a further reduction, and not a walk-back — is the terminal this gate has reached: REDUCED-TO-AXIOM, ANCHORED +1, PROMOTIONS: 0. 

 The community gap & state of the art

 1. The precise open problem

 Every physical theory, no matter how deep its derivations run, bottoms out on a short list of brute
assumptions that are taken , not earned. One item on that list — arguably the single item most people
would name first if pressed — is granularity : the fact that there is a smallest operational step in
nature, a positive cost floor ε > 0 on the price of making a distinguishable transition, a quantum of
action. Every undergraduate learns that ℏ = 1.0546 × 10⁻³⁴ J·s is where quantum mechanics starts; almost
no one is taught why there should be a smallest action at all , because no one knows. The sharp form of
the question this gate addresses is:

 Can the existence of a positive action/cost floor be derived from something strictly weaker than
quantum mechanics itself, or must it be posited as a primitive? 

 This is not a rhetorical or philosophical question dressed up as physics — it is a precise structural
question with a definite yes/no answer waiting to be found, and the honest current answer, established by
running the attack rather than assuming it, is that it must be posited , with the posit reduced to the
smallest, most value-free form anyone has produced. Framed against the four irreducible anchors that this
research program treats as the only free inputs to the whole 13-dimensional construction — {M_Pl,
α_i(M_Z), y_t, |V_us|} — granularity is a fifth , structurally different kind of primitive: it is not a
number to be fit, it is a structural fact (that a floor exists at all) shadowed by a residue value 
(ℏ) that is conceded on the same footing as those four numbers. Keeping those two halves — structure and
value — rigidly apart is the discipline that makes this gate's claim precise rather than a restatement of
"quantum mechanics is quantized."

 Across the whole of theoretical physics, the existence of ℏ as a smallest action step is taken, not
earned . Quantum mechanics posits the canonical commutation relations, or equivalently a nonzero Planck
constant setting the scale of the symplectic form on phase space, as an axiom of the theory; nothing
inside orthodox quantum theory derives that ℏ ≠ 0 from a principle that does not already assume some
form of quantization. Quantum field theory inherits the same posit unchanged. Even research programs
explicitly aimed at reconstructing quantum theory from operational or information-theoretic first
principles — the subject of the "prior attempts" discussion below — uniformly assume a finite-dimensional
(or otherwise bounded) state space as one of their axioms, which is mathematically equivalent to assuming
the existence of the very floor they would need to derive. The field-wide open frontier, stated at its
most general, is: derive compactness or finiteness of the operational state space from purely
operational-causal principles , with no quantum mechanics — no Hilbert space, no inner product, no trace
distance, no orthogonality — smuggled into the premises. No one has done this. That is the precise,
narrow, and long-standing gap this gate attacks.

 2. Why this question is hard, and why it is not merely semantic

 A skeptical reader's first reaction is often: surely finite resources — a system of bounded size, bounded
energy, bounded lifetime — already force some kind of floor, by pigeonhole-type reasoning? This is exactly
the naive route the field has repeatedly reached for, and it is exactly the route that fails, precisely
and demonstrably, as shown by the derivation chain this gate is built on (summarized only insofar as it
bears on the historical and comparative picture; the full chain with every theorem, sign, and constant is
developed in the derivation section of this dossier). The failure is not a hand-wave: it is a theorem ,
in the form of an explicit countermodel. A classical pointer confined to the unit interval, with finite
spatial extent, finite duration, and finite energy-time budget, admits a family of readout tests ("is the
pointer near x, excluding y?") under which every pair of distinct pointer positions is perfectly
distinguishable — the induced operational distance between any two distinct records is exactly 1, for all
pairs, no matter how close the positions are. The resulting space of records is an uncountable discrete 
metric space: totally bounded fails outright, and with it compactness, and with it the extreme-value
argument that would otherwise hand over a floor for free. Finite resources, in other words, do not by
themselves prevent arbitrarily fine-grained, arbitrarily numerous perfectly distinguishable records. What
stops that from happening in nature is not a resource bound; it is something extra, a genuine
finite-resolution law, and identifying exactly what that "something extra" is, and whether it can be
gotten from principles weaker than quantum mechanics, is the entire content of the open problem.

 This is what separates the present treatment from a semantic exercise. The naive expectation — "of course
finite systems have finitely many distinguishable states" — is false as stated; it requires an
additional ingredient that the community has never cleanly isolated and named. Making that ingredient
explicit, and showing precisely how far one can get without it and precisely where it becomes
unavoidable, is a genuine structural contribution regardless of which side of "derivable vs. posited" the
final verdict lands on.

 3. State of the art: the "floor exists" half is established physics, from three independent directions

 It is essential to be precise about what is already firmly established, because the existing literature
is often mistaken — including by researchers working adjacent to this question — for having already
closed the gap. It has not. Three independent, mutually corroborating theorems from within orthodox
quantum theory and quantum thermodynamics confirm that a floor exists, each expressed in a different
physical currency:

 Margolus–Levitin (1998). For a quantum system with mean energy E measured above the ground state,
 the minimum time to evolve to an orthogonal (and hence perfectly distinguishable) state obeys
 τ ≥ πℏ/(2E) . Equivalently, the number of orthogonal states reachable in a time window T is bounded,
 N⊥ ≤ 2ET/(πℏ) . Given any finite mean energy and any finite time window, this immediately yields a
 finite count of distinguishable transitions. (Margolus & Levitin, Physica D 120 (1998) 188.)

 Landauer (1961). Erasing one bit of information — collapsing two distinguishable logical states into
 one — necessarily dissipates at least ΔE ≥ k_B T ln 2 of energy into the environment. This bound has
 since been confirmed experimentally to high precision. (Landauer, IBM J. Res. Dev. 5 (1961) 183;
 experimental confirmation in Bérut et al., Nature 483 (2012) 187.)

 Bekenstein (1981). A physical system confined to a sphere of radius R with total energy E can carry
 at most S ≤ 2π k_B R E / (ℏ c) nats of entropy — an absolute cap on the number of distinguishable
 internal configurations a bounded region can support. (Bekenstein, Phys. Rev. D 23 (1981) 287.)

 These three bounds are valuable precisely because they are mutually independent currencies — one is
stated in terms of action and time, one in terms of energy and information (thermodynamic), one in terms
of information and spatial extent (holographic) — so the existence of a floor does not hang on any
single derivation or any single physical regime. Whichever way one slices a bounded physical system —
by its dynamics, by its thermodynamics, or by its geometry — one runs into a floor. This triangulation is
genuinely the best confirmation the field has, and it should be presented, and is presented here, as
established textbook physics: none of it is a novel result of the present program.

 But — and this is the crux of the gap — all three are theorems of quantum mechanics and quantum
field theory, not theorems that reach quantum mechanics from below. Margolus–Levitin and Landauer both
presuppose a Hilbert space and the notion of orthogonal (perfectly distinguishable) quantum states from
the outset; the very statement "reach an orthogonal state" already assumes the inner-product structure
whose existence is in question. Bekenstein's bound carries ℏ explicitly inside its defining constant,
so it cannot be used to explain where ℏ, or a floor of any kind, comes from — ℏ is already an input, not
an output. Each of these three results confirms granularity beautifully while sitting inside a
framework — quantum theory — that already contains it as an axiom. That is the exact and precise sense in
which the field possesses an excellent confirmation of granularity and no derivation of it. Stated
bluntly: as of the state of the art, granularity is downstream evidence for quantum mechanics, not a
theorem reachable without quantum mechanics. Closing that gap — finding the "weaker than QM" route in —
is the open problem, and it has resisted every attempt made on it.

 4. Prior attempts, and precisely where each one falls short

 Three distinct research programs have approached this terrain from different directions. Each is a
serious, technically substantial body of work; none has derived granularity from a strictly weaker
principle, and it is worth being exact about why , because the reasons are structurally different in
each case and together map out the shape of the obstruction.

 (a) Operational / generalized-probabilistic-theory (GPT) reconstructions of quantum theory (the
lineage associated with Lucien Hardy's axiomatic reconstruction and with the later Chiribella–D'Ariano–
Perinotti "CDP" informational derivation of quantum theory). These programs set out to derive the
mathematical structure of quantum mechanics — the Hilbert space formalism itself — from a small set of
operational or informational axioms (such as "purification," "local tomography," or Hardy's original
five axioms). This is exactly the right kind of ambition for the present question, and the object these
programs need somewhere in their axiom list is a direct structural cousin of the granularity floor: a
 finite operational dimension , meaning a bounded number of states that can be perfectly (mutually)
distinguished from one another in a single measurement. The trouble, from the point of view of this 
gate, is that in every version of these reconstructions, finite operational dimension is assumed as an
axiom from the start — it is not itself derived from anything weaker. Adopting "finite operational
dimension" as a founding axiom is, in the vocabulary of this gate, mathematically the same move as
adopting the granularity cell law directly; it does not derive the floor, it renames it and places it one
level up in the axiom list. These reconstructions are extremely valuable for showing what follows from 
granularity (namely, essentially the entire mathematical apparatus of quantum theory), but they are
silent on where granularity itself comes from, because they start by assuming it.

 (b) Buchholz–Wichmann nuclearity in algebraic quantum field theory. This is the single result in the
literature that comes closest to a genuine theorem yielding a finiteness statement — specifically,
finiteness of the number of local degrees of freedom accessible below a given energy — from a set of
structural axioms (the nuclearity condition constrains the "size," in an operator-trace sense, of the set
of local states with bounded energy). This is a real, nontrivial result, and it is the strongest existing
near-miss in the literature. But nuclearity is a condition stated and proved inside algebraic quantum
field theory — its formulation already presupposes the C -algebraic and Hilbert-space apparatus of QFT.
Invoking nuclearity to ground granularity from below is therefore a quantum import *: it uses the
target framework's own machinery to explain a feature of that framework, which is exactly the circularity
this gate's program set out to break, not a way of breaking it. Nuclearity confirms that granularity is
compatible with, and indeed emerges naturally from, the structure of relativistic quantum field theory. It
does not show that granularity is derivable from something weaker than quantum field theory.

 (c) The "certify irreducibility directly" route — attempting to prove, from the bottom up, that every
distinguishable transition must cost at least some fixed ε, without invoking quantum mechanics to do so.
This is the most direct possible attack, and it is also the one that reveals the deepest structural
obstruction. The phrase "cost of a distinguishable transition" already presupposes a working notion of
 distinguishability , and in essentially every existing formal treatment, distinguishability is defined
through Hilbert-space orthogonality — two states are perfectly distinguishable exactly when their
representative vectors are orthogonal. That means the very vocabulary needed to state "a floor on the
cost of a distinguishable transition" already smuggles in the Hilbert-space structure whose necessity is
what is being tested. This makes granularity look downstream of quantum mechanics (quantum mechanics
⇒ a Margolus–Levitin-type floor) rather than upstream of it (a floor, from something weaker, ⇒ quantum
mechanics), which is precisely backwards from what a derivation of granularity requires. Recognizing this
circularity precisely, and then partially defeating it, is the substantive achievement this program can
claim credit for: it identifies the pre-Hilbert operational distinguishability metric (the supremum, over
admissible tests and outcomes, of the gap in outcome frequencies between two records) as a notion that can
be stated and used without any Hilbert-space structure at all — a classical, purely
frequency-based total-variation distance that reduces correctly on classical probability spaces and
requires no inner product, no Born rule, no orthogonality. That move breaks the surface circularity —
one can now talk about distinguishability without presupposing quantum mechanics. It does not break
the deeper circularity: whether the cost floor, once stated in this pre-Hilbert language, sits
at-or-below quantum mechanics in the true implication order, or is merely a re-expression of a fact that
is only ever true because quantum mechanics is already true, remains genuinely open. That deeper
question is exactly Hole 1 / Hole 3 of this gate's open-problem ledger: the co-fundamentality question,
carrying an honestly stated ~15–20% chance of a full pre-quantum reconstruction succeeding on any given
attempt, with a valid, equally publishable "no-go" (a proof that no such weaker derivation is possible)
counting as a legitimate close of the question in the other direction.

 5. Why the "obvious" fixes do not work: two decisive countermodels

 Two further countermodels sharpen exactly how far the "finite resources" intuition can be pushed before
it breaks, and both are theorems (explicit constructions), not conjectures — this is what makes the
final posit an earned no-go rather than an assumption dressed up as a conclusion.

 First, the delta-test countermodel shows that finite causal support, finite duration, and finite
action/energy-time budget together are not sufficient to force even the weaker property of finite
resolvability at any fixed tolerance (the technical property called finite test-compression, FTC, needed
to get compactness off the ground at all). Concretely: take the unit interval [0,1] as the space of
records, and admit indicator tests f_x(r) = 𝟙[r = x] for every x. Every distinct pair of records is
perfectly separated by some test (namely the indicator of one of them), so the operational distance is
exactly 1 between every distinct pair — but any finite family of such tests, chosen in advance, misses
almost every pair (since [0,1] is uncountable, one can always find two records neither of which is any of
the finitely many chosen test points, on which every chosen test reads zero on both). So no finite test
family can approximate the true operational distance to any accuracy better than 1, for every accuracy
thresher below 1 — finite resolvability fails identically. This shows finite test-compression is a
genuine additional finite-resolution law , not a free consequence of finite resources; it must be
supplied, not derived, from causal-support and budget bounds alone.

 Second, and more subtly, the basin-shallowing countermodel shows that even if one is willing to
grant a resolution law that is allowed to depend on the chosen tolerance η (an η-dependent floor Δ(η)),
that weaker assumption still does not deliver the uniform , system-independent floor Δ₀ > 0 that
the physical picture of "one universal quantum of action" requires. The construction populates a bounded
operational landscape (bounded total variation, Var_op(R) ≤ B) with an infinite family of disjoint stable
record "basins" of depths d_n = B·2^(−n−1), so that the total depth used is Σd_n = B/2, strictly less than
the budget B — fully consistent with finite resources — while the infimum of the individual basin depths
is exactly zero: there is no smallest basin, no uniform cell size, even though every individual tolerance
level is still only satisfied by finitely many basins. This is a precise theorem-level demonstration that
"per-system total boundedness at every fixed tolerance" and "one universal positive resolution constant
shared by all systems" are logically distinct claims , and that finite resources, however generously
interpreted, only ever deliver the weaker one. The gap between them is not a gap in current knowledge that
more calculation would close — it is a structural gap between two different mathematical statements, with
an explicit counterexample sitting in the space between them.

 6. What the state of the art therefore leaves unresolved

 Putting the pieces together, the honest state of the field, prior to and independent of this program, is:

 The existence of a floor is triangulated by three independent, well-established theorems (Margolus–
 Levitin, Landauer, Bekenstein) — but every one of them is a theorem of quantum theory or quantum
 thermodynamics, not a theorem reaching quantum theory from below.

 The most serious attempt to derive a finiteness statement from structural axioms without full quantum
 mechanics (Buchholz–Wichmann nuclearity) still operates inside the C*-algebraic apparatus of quantum
 field theory, and so remains a quantum-internal result.

 The most serious attempts to derive the mathematical structure of quantum theory from operational
 axioms (Hardy; CDP) uniformly take a finite-dimensional or finite-distinguishability postulate as a
 primitive axiom, which is the very floor in question, merely relocated and renamed.

 The most direct attack — certifying irreducibility of the floor from below, with no borrowed Hilbert
 structure — runs into a genuine circularity, because the standard vocabulary of "distinguishable
 transition" already presupposes orthogonality; and even once that surface circularity is broken by
 switching to a pre-Hilbert, frequency-based operational metric, two explicit countermodels (the
 delta-test and basin-shallowing constructions) show that finite causal, temporal, and action/energy-time
 resources alone — with no further law supplied — deliver neither finite resolvability at any fixed
 tolerance nor, a fortiori, a single system-independent uniform floor.

 No accepted result in the literature closes this gap in either direction: nobody has produced a derivation
of granularity from strictly weaker premises, and nobody had, prior to the countermodels reported here,
produced a clean theorem-level demonstration of exactly why the naive "finite resources force a floor"
intuition fails. That is the precise state of the art this gate inherits, and it is the exact baseline
against which the reduction carried out in this dossier — compressing the entire open question down to
one named, value-free structural posit (a single universal positive operational resolution constant) plus
one atomic measured residue (ℏ itself) — should be measured. The claim is not that this program derives
granularity where the field has failed; the claim, stated at the honest strength the evidence supports, is
that it identifies, isolates, and proves (via the two countermodels above) exactly which single
assumption the entire edifice needs, strips every avoidable assumption away from around it, and shows that
the leftover posit cannot currently be reduced further without either a genuine breakthrough in
pre-quantum reconstruction (Hole 1 / Hole 3 below) or a rigorous no-go theorem establishing that no such
reduction is possible.

 The frozen 13D arena at full precision

 0. Why this section exists on a root that does not live in the geometry

 The granularity root is unusual among the gates that draw on the frozen 13D arena: it is not 
indexed to the arena. The positive cost floor on distinguishable action is a root the arena
 inherits , not a consequence the arena produces . The delta-test and basin-shallowing
countermodels that do the load-bearing work in this gate (established below in the companion
sections) are pure operational-topology / resource-theory statements — they go through with no
metric factor, no Casimir, no curvature invariant anywhere in their proof. Nothing about \(K_6\) 
being \(SU(3)/T^2\) rather than, say, a torus, and nothing about the compactification radius being
 \(1.591549430918954\times10^{-17}\,\mathrm{GeV}^{-1}\) rather than any other value, enters the proof
that a compact record space has a positive cost minimum, or the proof that finite resources alone
do not force compactness. So this section is not claiming the arena derives granularity. It is
doing the opposite job, precisely and honestly: pinning down, at full precision and on all three
layers, the one place where this geometry-independent root touches the geometry — the
identification of the floor's energy scale by Kaluza–Klein reduction — and showing why that
touch-point is a derivable side-question, not a channel through which the geometry could ever
supply or replace the named posit. A reader who wants to attack this gate needs the complete arena
in front of them for exactly one reason: to see for themselves that no lever in it does the
closing work, and to see the one number the arena does legitimately supply (the granularity
mass scale \(M_*\) ) at full precision, with its convention-proof and convention-soft parts kept
separate.

 1. The complete frozen 13D arena — all three layers

 The active branch is the whole layered object, never only its metric factors. Written in full:

 \[
\mathfrak{B}_{\rm active}
=
\underbrace{\big[\,\mathcal{M}_4 \times K_6 \times S^2 \times S^1_Y/\mathbb{Z}_2\,\big]_\times}_{\text{\normalsize $\times$ STAGE --- metric geometry}}
\;\oplus\;
\underbrace{\big[\,\mathcal{F}^+_{\rm finite}\oplus\mathcal{C}_{\rm admiss}\,\big]_\oplus}_{\text{\normalsize $\oplus$ RULEBOOK --- finite admissibility (0-dim)}}
\;\otimes\;
\underbrace{\big[\,\mathcal{E}_{\rm matter}\oplus\mathcal{E}_{\rm gauge}\oplus\mathcal{E}_{\rm Higgs}\oplus\mathcal{E}_{\rm proton}\,\big]_\otimes}_{\text{\normalsize $\otimes$ ACTORS --- bundles / operators (0-dim)}}
\]

 with \(K_6 = SU(3)/T^2\) , the full flag manifold of \(A_2\) , and \(S^1_Y/\mathbb{Z}_2\) the active
orbifold boundary domain. The dimension count, carrying weight only on the \(\times\) -layer, is

 \[
D = 4 + 6 + 2 + 1 = 13.
\]

 The \(\oplus\) (rulebook) and \(\otimes\) (actors) layers are non-metric — zero-dimensional — but they
are part of the frozen branch and are never dropped silently; every quantity a gate touches must
be traced through all three layers or the object is incomplete and any residual computed under it
is an artifact.

 The \(\times\) STAGE — the four metric factors, at full precision: 

 Factor 
 Real dim 
 Metric 
 Status 
 Physical role carried 

 \(\mathcal{M}_4=\mathbb{R}^{3,1}\) 
 4 
 Minkowski 
 primitive 
 observed spacetime; the causal-order arena in which "bounded causal record-support system," "finite extent," "finite duration \(\tau\) " are stated 

 \(K_6=SU(3)/T^2\) 
 6 
 Weyl-rigid invariant (normal at chamber center) 
 primitive 
 color source; spin- \(\mathbb{C}\) family index \(-3\) ; carries \(SU(3)_c\) 

 \(S^2\) 
 2 
 round 
 primitive 
 weak source; spin- \(\mathbb{C}\) doublet routing; carries \(SU(2)_L\) 

 \(S^1_Y\) (parent) \(\to S^1_Y/\mathbb{Z}_2\) (active) 
 1 (interval, post-quotient) 
 flat \(\to\) induced 
 primitive \(\to\) derived quotient ( \(\theta\mapsto-\theta\) ) 
 hypercharge circle; chirality / no-mirror filter; carries \(U(1)_Y\) 

 Gauge forces on this arena are isometries of the internal metric factors: \(SU(2)_L\) is supplied
strictly by \(S^2\) — never by any \(SU(2)\subset SU(3)\) sitting inside \(K_6\) — and \(K_6\) carries only
 \(SU(3)_c\) . This routing is stated here because it is what makes the arena's role in this gate
narrow and legible: the granularity root never calls on any of these isometry actions. It calls
only on the fact that the arena has finite volume factors, which is what lets the Kaluza–Klein
reduction of §4 below go through.

 The \(\oplus\) RULEBOOK — finite admissibility (0-dim): 

 \(\mathcal{F}^+_{\rm finite} = \{\tau=\omega,\ \mathcal{G}_{\rm gen},\ \Pi_u,\Pi_d,\Pi_e,\Pi_\nu,\
O_u,O_d,O_e,O_\nu,\ \phi_i,\ N_i,\ \mathcal{N}_i,\ \mathrm{RG}\}\) is the flavor chamber: modulus,
generation basis, sector projectors, chamber operators, phase rules, normalizations, the
Yukawa-map procedure, and RG-transport rules. \(\mathcal{C}_{\rm admiss}\) is the anti-fitting
firewall — selector v3, constraints C1–C14, the freeze-before-compare barrier, anomaly conditions,
the no-mirror parity table, the Wilson-line winding rule, and the FCNC/mediator no-go. Both are
carried inline as context; the finite chamber \(F^+\) is a finite/operator chamber, never a
propagating metric factor — it adds zero dimensions and its Cartan-torus modulus \(\tau\) is
chamber data, not a Kaluza–Klein tower.

 The \(\otimes\) ACTORS — bundles / operators (0-dim): 

 \[\mathcal{E}_{\rm active}=\mathcal{E}_{\rm matter}\oplus\mathcal{E}_{\rm gauge}\oplus\mathcal{E}_{\rm Higgs}\oplus\mathcal{E}_{\rm proton},$$
$$\mathcal{E}_{\rm matter}=S_{3,1}\otimes S^{\rm spin^c}_{K_6}\otimes S^{\rm spin^c}_{S^2}\otimes L_Y\otimes V_{SU(3)}\otimes V_{SU(2)}\otimes V_{F^+}.\]

 Discrete / topological structure carried by the arena. Three generations arise as the
spin- \(\mathbb{C}\) index \(\chi(K_6,E) = -3\) . Charge quantization is the global \(\mathbb{Z}_6\) 
identifying the centers \(\mathbb{Z}_3\subset SU(3)_c\) , \(\mathbb{Z}_2\subset SU(2)_L\) , and a sixth
root of unity on \(U(1)_Y\) , giving \(G_{\rm SM}=\big(SU(3)_c\times SU(2)_L\times U(1)_Y\big)/\mathbb{Z}_6\) 
with generator \(z=(\omega_3,-1,\zeta_6)\) and Smith normal form invariant factors \([1,6,6]\) — the
finest faithful quotient, no coarser or finer identification admissible. None of this discrete
structure is consumed by the granularity reduction; it is recorded here because it is part of the
frozen branch and a complete section must not silently drop it.

 The four irreducible anchors of the whole arena are \(\{M_{\rm Pl},\ \alpha_i(M_Z),\ y_t,\
|V_{us}|\}\) , feeding \(22+\) over-determined outputs elsewhere in the corpus. Of these four, only
 \(M_{\rm Pl}\) is consumed by this gate, and only in one place (§4 below, the Scale-root screen);
the other three anchors play no role in the granularity reduction.

 2. Exact radii, volumes, and mathematical constants at full precision

 2.1 Mathematical constants (16 significant figures). 

 Symbol 
 Value 

 \(\pi\) 
 \(3.141592653589793\) 

 \(2\pi\) 
 \(6.283185307179586\) 

 \(\pi^3\) 
 \(31.00627668029982\) 

 \(\pi^5\) 
 \(306.0196847852814\) 

 ( \(\pi^5\) is obtained from \(\pi^3\times\pi^2 = 31.00627668029982 \times 9.869604401089358\) ; it is
used below purely as an intermediate in evaluating \(8\pi^5\) and is not itself a pack-quoted row —
flagged as a direct arithmetic evaluation, not a separately certified constant.)

 2.2 Radius table. The compactification scale coincides with the unification scale via
 \(R_0\equiv(2\pi M_U)^{-1}\) , with \(M_U\) fixed by the two-loop RG plus Kaluza–Klein-threshold closure
 \(\alpha_1(M_U)=\alpha_2(M_U)=\alpha_3(M_U)\) .

 Symbol 
 Meaning 
 Status 
 Value 
 Units 

 \(M_U\) 
 unification scale 
 declared closure target, residual \(9.6\times10^{-11}\) 
 \(1.0\times10^{16}\) 
 GeV 

 \(M_{\rm Pl}\) 
 ordinary Planck mass \((\hbar c/G_N)^{1/2}\) 
 input anchor 
 \(1.220900000000000\times10^{19}\) 
 GeV 

 \(\bar M_{\rm Pl}\) 
 reduced Planck mass \(M_{\rm Pl}/\sqrt{8\pi}\) 
 derived from input 
 \(\approx 2.4357\times10^{18}\) (pack states \(2.435\times10^{18}\) in the granularity brief) 
 GeV 

 \(R_0\) 
 natural compactification radius 
 derived 
 \(1.591549430918954\times10^{-17}\) 
 GeV \(^{-1}\) 

 \(R_6\equiv R_{K_6}\) 
 \(K_6\) overall radius, chamber center \(\vec u=(1,1,1)\) 
 derived 
 \(1.591549430918954\times10^{-17}\) 
 GeV \(^{-1}\) 

 At the chamber center all internal radii coincide with \(R_0\) to the precision quoted (the parent
hypercharge circle \(S^1_Y\) halves to \(R_Y=7.957747154594768\times10^{-18}\,\mathrm{GeV}^{-1}\) after
the \(\mathbb{Z}_2\) orbifold quotient, but this halving does not enter the granularity computation
below, which uses the active nine-dimensional internal volume as a single number).

 2.3 Product volumes. The exact symbolic forms are

 \[
\mathrm{Vol}(K_6)(\vec u)=V_{K_6,0}\,R_6^6\sqrt{u_1u_2u_3},\qquad V_{K_6,0}=\frac{(2\pi)^3}{\sqrt3},
$$
$$
\mathrm{Vol}(S^2)=4\pi R_2^2,\qquad \mathrm{Vol}(S^1_Y/\mathbb{Z}_2)=\pi R_Y\ \text{(active)},
\]

 evaluated at the chamber center \(\vec u=(1,1,1)\) , \(R_6=R_2=R_0\) :

 Quantity 
 Exact formula 
 Value 
 Units 

 \(V_{K_6,0}\) 
 \((2\pi)^3/\sqrt3\) 
 \(143.2118575035129\) 
 — 

 \(\mathrm{Vol}(K_6)\) 
 \(V_{K_6,0}R_0^6\) 
 \(2.327554010848277\times10^{-99}\) 
 GeV \(^{-6}\) 

 \(\mathrm{Vol}(S^2)\) 
 \(4\pi R_0^2\) 
 \(3.183098861837907\times10^{-33}\) 
 GeV \(^{-2}\) 

 \(\mathrm{Vol}(S^1_Y/\mathbb{Z}_2)\) (active) 
 \(\pi R_0\) 
 \(5.000000000000000\times10^{-17}\) (exact \(=1/(2M_U)\) ) 
 GeV \(^{-1}\) 

 \(\mathrm{Vol}(X_{\rm active})\) 
 product of the three above 
 \(3.704417261398702\times10^{-148}\) 
 GeV \(^{-9}\) 

 Two independent conventions for the internal nine-volume appear in the corpus, and the section
must carry both rather than silently pick one: the geometry pack's "alt-pipeline" prefactor
 \(V_{K_6,0}=(2\pi)^3/\sqrt3\) (used in \(\mathrm{Vol}(X_{\rm active})\) above), versus the
granularity-brief's own declared "normal-homogeneous flag-manifold convention"
 \(\mathrm{Vol}(K_6)=4\pi^3R_0^6\) , \(\mathrm{Vol}(S^2)=4\pi R_0^2\) , \(\mathrm{Vol}(S^1_Y/\mathbb{Z}_2)
=\pi R_0/2\) , giving \(\mathrm{Vol}_9 = 8\pi^5 R_0^9\) . Evaluating this second form:

 \[
\mathrm{Vol}_9 = 8\pi^5 R_0^9 = 8\times306.0196847852814\times\big(1.591549430918954\times10^{-17}\big)^9\ \mathrm{GeV}^{-9} = 1.6041\times10^{-148}\ \mathrm{GeV}^{-9}.
\]

 The two pipelines disagree by a factor of \(\sim2.3\) in the nine-volume — this is exactly the
"convention-soft band" flagged below in §4: a genuine ambiguity in which flag-manifold/orbifold
volume normalization is declared, propagating into a \(\sim\) factor-1.2 spread in the derived mass
scale \(M_*\) (since \(M_*\propto \mathrm{Vol}_9^{-1/11}\) , an \(O(1)\) volume ambiguity is heavily
damped by the eleventh root). Both numbers are carried here; neither is silently preferred.

 3. Curvature invariants, Casimirs, zeta value, \(\kappa\) , and \(\chi\) at full precision

 These are recorded because they are the complete-object data the arena carries at the \(K_6\) 
factor; they are not consumed by the granularity reduction (§4 states precisely which single
number is consumed), but a reader auditing "is this the full 13D arena, not a truncation" needs
them written out.

 3.1 Two metric normalizations. The corpus pins the same \(K_6\) geometry in two
internally-consistent normalizations: (A) the frozen physical \(R_6\) -normalization, in which
curvature carries units of GeV \(^2\) ( \(\mathrm{Ric}_i = 1/(2R_6^2)\) , \(\mathrm{Scal}=3/R_6^2\) ), and
(B) the Killing-form normal metric \(g=(-B)|_{\mathfrak{m}}\) with \(B(X,Y)=6\,\mathrm{Tr}(XY)\) on
 \(\mathfrak{su}(3)\) at the chamber center, dimensionless, in which \(\mathrm{Ric}_i=5/12\) ,
 \(\mathrm{Scal}=5/2\) . The bridge is that curvature ratios are metric-scale invariant and agree in
both: \(\mathrm{Scal}/\mathrm{Ric}_i = 6 = \dim K_6\) in both normalizations.

 3.2 Ricci and scalar curvature at the symmetric center \(\vec u=(1,1,1)\) . 

 Quantity 
 [ \(R_6\) -norm] 
 [Killing-norm] 

 \(\mathrm{Ric}_1=\mathrm{Ric}_2=\mathrm{Ric}_3\) 
 \(1/(2R_6^2)=1.973920880217872\times10^{33}\ \mathrm{GeV}^2\) 
 \(5/12\) 

 \(\mathrm{Scal}(K_6)\) 
 \(3/R_6^2=1.184352528130723\times10^{34}\ \mathrm{GeV}^2\) 
 \(5/2\) 

 3.3 Metric-scale-invariant curvature ratios (identical in both normalizations): 

 Invariant 
 Exact rational 
 Decimal 

 \(\mathrm{Scal}^2\) 
 \(25/4\) 
 \(6.25\) 

 \(\|\mathrm{Ric}\|^2\) 
 \(25/24\) 
 \(1.041666666666667\) 

 \(\|\mathrm{Riem}\|^2\) 
 \(23/12\) 
 \(1.916666666666667\) 

 \(\|\mathrm{Riem}\|^2/\mathrm{Scal}^2\) 
 \(23/75\) 
 \(0.3066666666666667\) 

 \(\|\mathrm{Ric}\|^2/\mathrm{Scal}^2\) 
 \(1/6\) 
 \(0.1666666666666667\) 

 Anti-drift certification carried verbatim: \(\|\mathrm{Riem}\|^2/\mathrm{Scal}^2=23/75\) is confirmed
and is never \(31/147\) ; \(\|\mathrm{Riem}\|^2\) is never \(=60\) (that is the round-unit \(S^6\) value, a
different space). The Euler characteristic is \(\chi(K_6)=6\) exactly (topological).

 3.4 Quadratic Casimir and dimension on \(K_6=SU(3)/T^2\) , used elsewhere in the corpus to label
representations by Dynkin weights \((p,q)\) :

 \[
C_2(p,q)=\frac{p^2+q^2+pq}{3}+(p+q),\qquad \dim(p,q)=\frac{(p+1)(q+1)(p+q+2)}{2},
\]

 with the lowest nonzero-degree eigenvalue \(C_2(1,1)=3\) (the adjoint \(\mathbf{8}\) , i.e. gluons).
The frozen operator cutoff scale is \(M_{\rm cutoff}=1/R_0=6.28\times10^{16}\ \mathrm{GeV}\) . These
spectral facts belong to the cross-gate mass-gap and vacuum-energy work (Holes 5–6 of this same
gate's open-hole ledger); they are recorded here as arena data but the granularity reduction itself
does not touch a single eigenvalue of this spectrum.

 3.5 \(\kappa\) and the zeta value. The chamber Boltzmann factor is \(\kappa=e^{-\pi\sqrt3}=
0.004333420509983131\) , a full-precision constant of the \(F^+\) rulebook layer (Cartan-torus
modulus \(\tau=\omega=e^{2\pi i/3}\) ), not of the granularity root. The \(K_6\) heat-kernel zeta value
 \(\zeta_{K_6}(-1)=-8033/100800\) referenced in the broader corpus belongs to the Λ / mass-gap
cross-gate ledger (Hole 5), likewise not consumed here. Both are stated so the "full precision, no
truncation" discipline is visibly honored even where a number is inert for this particular gate.

 4. The three-layer objects this gate actually touches

 This is the section that matters for grading discipline: everything above is the complete 
arena, carried as context; what follows is the load-bearing subset , named so a reader can see
exactly where the granularity root does and does not lean on the geometry.

 Root-role of this gate — geometry-independent. Unlike the geometry-defining gates, granularity
sits below the geometry: it is a root the frozen 13D arena inherits, not a consequence of it.
The delta-test and basin-shallowing countermodels, and the measured residue \(\hbar\) , all survive
with the geometry stripped out entirely — they are pure operational-topology / resource-theory
statements. The reduction to the Uniform Operational Cell Law is therefore not indexed to the
13D branch . This is why the arena is context, not load-bearing substrate, for the R1 reduction —
the opposite of the floor- location sub-question below, where the metric genuinely is the
substrate consumed.

 \(\times\) Stage, as consumed here. The only \(\times\) -layer fact this gate uses is the finite
total volume of the compact internal factors — a single scalar, \(\mathrm{Vol}_9\) , not any
curvature invariant, not any isometry, not any Casimir. Concretely: the full frozen arena
 \(\mathfrak{B}_{\rm active}=[M_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2]\) with \(K_6=SU(3)/T^2\) 
the \(A_2\) full flag manifold, \(D=4+6+2+1=13\) , frozen radius \(R_0=1/(2\pi M_U)=
1.591549430918954\times10^{-17}\ \mathrm{GeV}^{-1}\) ( \(M_U=1.0\times10^{16}\ \mathrm{GeV}\) ). Only
the \(\times\) -layer carries metric dimension; that is precisely what makes "finite volume" a
well-defined, layer-pure input to a Kaluza–Klein reduction.

 \(\oplus\) Rulebook, as consumed here. The finite chamber \(F^+\) /admissibility structure, the
 \(\mathbb{Z}_2\) orbifold parity \(\theta\mapsto-\theta\) on \(S^1_Y\) , the \(\overline{\rm MS}\) scheme,
two-loop RG running, and \(M_Z=91.1876\ \mathrm{GeV}\) are all carried as the rulebook layer of the
arena. \(F^+\) is explicitly inert — no constructive shortcut — for the granularity reduction
itself and for the surfaced mass-gap inequality of Hole 6: it selects the pure-glue \(SU(3)_c\) 
target elsewhere in the corpus, but it supplies no lever for closing anything on this root. The
one place \(F^+\) -adjacent rulebook data is load-bearing is the floor-location read below, where
the volume normalization convention (which flag-manifold measure is declared) is exactly the
rulebook choice that produces the convention-soft band.

 \(\otimes\) Actors, as consumed here. The spectral operators whose eigenvalues feed the
cross-gate \(\Lambda\) /mass-gap tests (Holes 5–6) live on this layer but are not consumed by the
granularity reduction proper — they are named here only because they are the actors layer's
concrete content for this branch of the arena, carried for completeness and because Holes 5–6
are adjacent open work products of the same gate family.

 5. The Scale-root screen: where the floor sits (a derivable sub-question, answered, not a promotion)

 This is the one genuine touch-point between the granularity root and the geometry, and it is
worked through here at full precision because it is the section's central deliverable.

 Setup. Standard Kaluza–Klein reduction on the frozen arena gives the Planck-mass relation

 \[
M_{\rm Pl}^2 = M_*^{\,11}\cdot \mathrm{Vol}_9,\qquad \mathrm{Vol}_9=\mathrm{Vol}(K_6)\cdot\mathrm{Vol}(S^2)\cdot\mathrm{Vol}(S^1_Y/\mathbb{Z}_2),
\]

 where \(M_*\) is the fundamental (13-dimensional) mass scale and \(11=D-2=13-2\) is the number of
transverse dimensions in the standard graviton KK counting. Under the granularity brief's declared
normal-homogeneous flag-manifold convention — \(\mathrm{Vol}(K_6)=4\pi^3R_0^6\) ,
 \(\mathrm{Vol}(S^2)=4\pi R_0^2\) , \(\mathrm{Vol}(S^1_Y/\mathbb{Z}_2)=\pi R_0/2\) — the nine-volume
evaluates to

 \[
\mathrm{Vol}_9 = 8\pi^5 R_0^9 = 1.6041\times10^{-148}\ \mathrm{GeV}^{-9}.
\]

 The derived scale. 

 \[
M_* = \big(\bar M_{\rm Pl}^2/\mathrm{Vol}_9\big)^{1/11} = \mathbf{6.010\times10^{16}\ GeV}
\ \big(\approx 6.01\,M_U,\ =\bar M_{\rm Pl}/40.51,\ =4.93\times10^{-3}\,M_{\rm Pl,full}\big),
\]

 using the reduced Planck mass \(\bar M_{\rm Pl}=2.435\times10^{18}\ \mathrm{GeV}\) . The geometry
pack's own independent full-precision pipeline, using the alternate volume prefactor
 \(V_{K_6,0}=(2\pi)^3/\sqrt3\) rather than \(4\pi^3\) , gives instead

 \[
M_*^{11} = M_{\rm Pl}^2/\mathrm{Vol}(X_{\rm active}) = 4.023836152402511\times10^{185}\ \mathrm{GeV}^{11},
\qquad M_* = 7.467050992135091\times10^{16}\ \mathrm{GeV},
\]

 using the ordinary (non-reduced) \(M_{\rm Pl}=1.220900000000000\times10^{19}\ \mathrm{GeV}\) and the
pack's \(\mathrm{Vol}(X_{\rm active})=3.704417261398702\times10^{-148}\ \mathrm{GeV}^{-9}\) . The
 \(\sim\) factor-1.2 spread between \(6.010\times10^{16}\ \mathrm{GeV}\) and \(7.467\times10^{16}\
\mathrm{GeV}\) is the convention-soft band referenced above: it comes from (i) the
 \(4\pi^3\) -vs- \((2\pi)^3/\sqrt3 \approx 143.21\) -vs- \(4\pi^3\approx124.03\) prefactor choice on
 \(\mathrm{Vol}(K_6)\) combined with (ii) reduced-vs-ordinary \(M_{\rm Pl}\) bookkeeping. Both numbers
are legitimate outputs of the same frozen radius \(R_0\) under two declared, internally-consistent
conventions; neither is preferred here, and the spread is reported rather than resolved, exactly
as the honesty discipline demands.

 The verdict, and why it is convention-proof. \(M_*/M_{\rm Pl}\ll1\) in either pipeline, so the
floor sits at the compactification/unification scale, not the 4D Planck scale ; the 4D \(M_{\rm
Pl}\) is emergent, diluted upward by the large compactification volume. This qualitative verdict is
robust to the convention choice because of the eleventh root: flipping the ratio all the way up to
 \(M_*\sim\bar M_{\rm Pl}\) would require \(\mathrm{Vol}_9\) to be wrong by a factor
 \(40.51^{11}\approx4.82\times10^{17}\) , while the largest plausible convention swing in the
prefactor — of order \((2\pi)^9\pi^3\approx4.7\times10^8\) — falls roughly nine orders of magnitude
short of that requirement. So while the exact value of \(M_*\) is convention-soft at the
factor- \(\sim\) 1.2 level (read the headline as \(M_*=O(\text{few})\times M_U\) , not a sharp
prediction), the qualitative placement of the floor at the unification scale rather than the
Planck scale cannot be undone by any reasonable choice of volume normalization.

 The hard honesty this screen must carry. The absolute floor scale in GeV is not derived 
— it is irreducible by Buckingham- \(\pi\) dimensional analysis: no dimensionless combination of
inputs can manufacture a dimensionful number from nothing. The quoted \(6.010\times10^{16}\
\mathrm{GeV}\) is the ratio \(M_*/M_{\rm Pl}\) re-expressed against the put-in-by-hand anchor
 \(M_{\rm Pl}\) (one of the arena's four irreducible anchors). The verdict is conditional on the
load-bearing identification "floor \(=M_*\) " — a physically natural identification (the fundamental
mass scale of the compactification is the natural home for a fundamental resolution scale) but an
identification nonetheless, stated as such rather than smuggled in as forced. This is a
 derivable sub-question, answered — it is explicitly not a promotion of any gate , and it
does not change PROMOTIONS: 0 for the granularity root itself, whose own terminal (§ elsewhere in
this dossier) rests on the Uniform Operational Cell Law and the measured anchor \(\hbar\) , neither
of which this Kaluza–Klein computation touches.

 6. What each part of the arena carries, physically — summary for this gate

 To close the loop explicitly: \(\mathcal{M}_4\) supplies the causal-order arena in which "bounded,"
"finite extent," "finite duration" are meaningful predicates — the ambient stage on which any
record-support system this gate discusses is defined, but contributes no metric fact the proof
needs. \(K_6=SU(3)/T^2\) , \(S^2\) , and \(S^1_Y/\mathbb{Z}_2\) jointly supply exactly one number to this
gate — the finite nine-volume \(\mathrm{Vol}_9\) — used only in the Kaluza–Klein identification of
§5; none of their curvature, Casimir, or representation content is consumed. The \(\oplus\) rulebook
layer ( \(F^+\) , admissibility, RG scheme) is inert for the reduction itself and load-bearing only for
the volume-normalization convention that produces the soft band in \(M_*\) . The \(\otimes\) actors
layer (spectral operators, bundles) is carried as arena completeness but plays no role here — its
content belongs to the adjacent, still-open Holes 5 and 6 of the mass-gap and vacuum-energy work.
Every quantity quoted above is either an exact rational, an exact closed form, or is stated to at
least the significant figures given in the source geometry pack and granularity brief; nothing
above has been back-solved or adjusted to make any downstream number look better, and the two
disagreeing volume pipelines are both reported rather than one being silently discarded.

 Construction I - the deep-root anchoring

 Purpose of this section. Every gate in this program is required to state, explicitly and inline, how the three deep roots — Shape, Scale, Granularity — each applied completely (all three layers, full precision, no truncation), bear on it, and to pass its object through the four Layer-2 admissibility screens (Invariance, Record-Interface, Causal-Order/target-blindness, Nonseparability). For most gates in the 13D construction, Shape and Scale are the load-bearing roots and Granularity is a downstream consumer. This gate inverts that pattern: Granularity is the root under reduction here , Shape is a sibling that does not touch it, and Scale enters only as a derivable side-question about where the floor sits, never as a lever on whether it exists. Stating this inversion precisely — and defending why it is not a evasion of the "full 13D arena" discipline — is the first job of this section.

 I.1 Why this gate is graded geometry-independent, and why that is not a loophole

 The frozen arena carried by every other gate in this corpus is the complete layered object
$$
\mathfrak{B} {\rm active} = \underbrace{\big[\mathcal{M}_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2\big] \times} {\text{ \(\times\) Stage}} \;\oplus\; \underbrace{\big[\mathcal{F}^+ {\rm finite}\oplus\mathcal{C} {\rm admiss}\big] \oplus} {\text{ \(\oplus\) Rulebook}} \;\otimes\; \underbrace{\big[\mathcal{E} {\rm matter}\oplus\mathcal{E} {\rm gauge}\oplus\mathcal{E} {\rm Higgs}\oplus\mathcal{E} {\rm proton}\big] \otimes} {\text{ \(\otimes\) Actors}},
$$
with \(K_6 = SU(3)/T^2\) the full \(A_2\) flag manifold and \(D = 4+6+2+1 = 13\) . Every curvature invariant, volume, Casimir, and heat-kernel coefficient quoted anywhere in this dossier is drawn from this object at full precision, never from a truncated slice of it. The discipline that "a residual seen under a truncated object is an artifact" applies here exactly as everywhere else in the corpus — and the honest statement for this gate is that the granularity root's own reduction to one posit plus one measured anchor does not consume this arena as substrate . The record interface \(D\) (distinguishable records), the admissible test set \(\{T\}\) , and the outcome frequencies \(P(e\mid r,T)\) that define the pre-Hilbert operational metric
$$
d {\rm op}(r,s) = \sup_{T,e}\big|P(e\mid r,T) - P(e\mid s,T)\big|
$$
are stated and proved at the level of bare operational topology and resource theory. The two decisive countermodels that carry the weight of this gate — the delta-test on \([0,1]\) (Theorem A) and the basin-shallowing landscape with depths \(d_n = B\cdot 2^{-n-1}\) — are both stated on an abstract bounded causal record-support system \(R\) with a real-valued cost budget \(B\) ; neither one references \(K_6\) , \(S^2\) , \(S^1_Y/\mathbb{Z}_2\) , the Killing form, the Ricci eigenvalues, or any of the chamber data of \(F^+\) . Sending the compactification radius \(R_0\) , the unification scale \(M_U\) , or the squashing parameters \(\vec u\) to any other admissible value inside their respective chambers leaves both countermodels, and the sufficiency lemma (basin-packing) that they bracket, completely unchanged. That is the precise, checkable sense in which granularity sits below the geometry rather than as one of its consequences , and it is why the geometry pack is carried in this dossier as context that a reader needs inline , never as load-bearing substrate for the R1 reduction itself . This is not a relaxation of the "full 13D, all three layers" rule; it is the rule applied honestly to a root whose own content is prior to any particular choice of \(\mathfrak{B}_{\rm active}\) . The one place in this gate where the metric geometry does become substrate — the Scale-root question of where the floor sits numerically — is treated on its own terms in §I.3 below, clearly flagged as a derivable side-question and not a re-indexing of the R1 grade.

 I.2 Shape, applied completely: what it forces here, and what it explicitly does not

 Shape — the frozen selection of \(K_6 = SU(3)/T^2\) over its sibling homogeneous spaces, the squashing chamber \(\vec u \in [1/2,3/2]^3\) , the Weyl-rigidity condition, the four admissible Einstein metrics on \(SU(3)/T^2\) (the normal metric \((1,1,1)\) and the Kähler–Einstein metric \((1,1,2)\) plus its three permutations) — is, for the gates that fix the gauge group and the family count, a primary anchor. For this gate it is a sibling root that is explicitly not consumed.

 Concretely: nothing in the granularity chain uses the root system \(\alpha_1=(1,-1,0)\) , \(\alpha_2=(0,1,-1)\) , the half-sum \(\rho=(1,0,-1)\) with \(\|\rho\|^2=2\) , the Ricci eigenvalues \(\mathrm{Ric}_i = 5/12\) (Killing-norm) or \(1/(2R_6^2)\) ( \(R_6\) -norm), the curvature invariants \(\|\mathrm{Riem}\|^2 = 23/12\) , \(\|\mathrm{Ric}\|^2 = 25/24\) , or the Euler characteristic \(\chi(K_6)=6\) . Nor does it use the spin- \(\mathbb{C}\) family index \(\chi(K_6,E) = -3\) that fixes three generations, nor the \(S^2\) monopole sectors that route \(SU(2)_L\) , nor any datum of the \(F^+\) chamber (the modulus \(\tau=\omega\) , the generation basis \(\mathcal{G}_{\rm gen}\) , the Boltzmann factor \(\kappa = e^{-\pi\sqrt3} = 0.004333420509983131\) , or any of the diagonal chamber operators \(O_u, O_d, O_e, O_\nu\) ). All of that machinery is real, frozen, and correctly reported elsewhere in this corpus — but the granularity root's derivation chain (T5, Theorem A, Theorem B, basin-packing, basin-shallowing) never calls on any of it. This is stated explicitly, rather than left as a silent omission, because the discipline that governs this program is that a gate must name every deep root it touches and every deep root it does not, so a reader can attack the right target. Shape is a sibling here, not a lever, and the dossier records that as a finding, not a gap: the sibling "Deep-Roots" gate that pairs granularity with absolute Shape-minimality carries its own separate, and separately OPEN, roll-up (driven by the uncomputable shortest-description question of absolute geometric minimality), and that roll-up is not allowed to bleed into or downgrade the Granularity sub-root's own status, which is REDUCED-TO-AXIOM on its own terms. Conflating the two — grading Granularity by the combined gate's weakest link — is exactly the "least-closed-residual" rubric that was retired; this dossier does not resurrect it.

 The one connective tissue worth naming precisely: Shape supplies, via the frozen radius \(R_0 = 1/(2\pi M_U) = 1.591549430918954\times10^{-17}\ \mathrm{GeV}^{-1}\) and the volume \(\mathrm{Vol}(X_{\rm active}) = 3.704417261398702\times10^{-148}\ \mathrm{GeV}^{-9}\) , the numerical inputs consumed in §I.3's Scale-root question. But that consumption runs one direction only — Scale reads off Shape's frozen numbers to locate a scale, Shape never reads anything back from Granularity. There is no cycle here for a referee to worry about.

 I.3 Scale, applied completely: the frame-independence of the floor, and the derivable (not gate-closing) question of where it sits

 Scale enters this gate in two genuinely distinct roles that must not be merged.

 Role 1 — the Lorentz-scalar reframe, which is load-bearing for the R1 reduction itself. The single most consequential move in the entire chain is the decision to hunt for a floor on cost (action, or energy·time) rather than on length . The reasoning is a short, complete argument, not a hand-wave: a floor on spatial length picks out a preferred rest frame, because length contracts under a boost — a system for which "no two positions closer than \(\ell_{\min}\) " holds in one frame will have that same statement fail in a boosted frame, since \(\ell_{\min}\) Lorentz-contracts while a fixed comparison length does not. This is the standard, decisive objection to any naive claim of discrete spacetime, and it is fatal to a length-floor version of this program. Cost, by contrast — action, energy·time, Shannon information — transforms as a Lorentz scalar : it takes the same value in every inertial frame. A floor stated on a scalar, \(c(x) \ge \varepsilon > 0\) for all distinguishable \(x\) , therefore picks out no preferred frame at all, and the entire objection is avoided for free , without any additional machinery, the moment the object of study is changed from "smallest length" to "smallest cost." This is why G3 (spacetime discreteness / smallest length) is explicitly and permanently NOT claimed anywhere in this gate — not because the corpus is agnostic about it, but because the reframe that makes the rest of the chain provable is precisely the reframe that forecloses it. A reader attacking this gate by asking "does this predict a minimum length?" is attacking a claim the dossier never makes; the honest answer is that the floor is a floor on a Lorentz scalar, and no statement about a minimum length follows or is intended.

 This is the Scale-root screen doing real work at the level of structure : it is what lets the program state a universal floor without contradicting special relativity, and it is inseparable from the T5/Theorem-B/basin-packing chain rather than an afterthought bolted on at the end. It costs nothing extra to check across the whole 13D arena, because \(\mathcal{M}_4 = \mathbb{R}^{3,1}\) carries the physical Lorentz structure and every compact-factor quantity ( \(K_6\) , \(S^2\) , \(S^1_Y/\mathbb{Z}_2\) ) is Lorentz-inert by construction — so the scalar-cost argument transfers unchanged from the abstract record-interface statement to the full 13D setting the moment a physical realization is specified.

 Role 2 — locating the floor numerically, a derivable side-question, explicitly NOT a gate closure. Separately from the frame-independence argument, one can ask: given the frozen 13D geometry and the ordinary 4D Planck mass \(M_{\rm Pl}\) as an anchor, at what scale does the natural granularity floor sit? This is answered by standard Kaluza–Klein dimensional reduction on the complete arena. The general relation is
$$
M_{\rm Pl}^2 = M_ ^{D-2}\,\mathrm{Vol}(X_{\rm active}), \qquad D = 13,\quad X_{\rm int} = K_6\times S^2\times (S^1_Y/\mathbb{Z} 2)\ \ (9\text{ dimensions}),
$$
so \(M_*^{11} = M_{\rm Pl}^2/\mathrm{Vol}(X_{\rm active})\) . Using the ordinary (non-reduced) Planck mass \(M_{\rm Pl} = 1.220900000000000\times10^{19}\) GeV and the full-precision active volume \(\mathrm{Vol}(X_{\rm active}) = 3.704417261398702\times10^{-148}\ \mathrm{GeV}^{-9}\) from the frozen geometry pack, this gives \(M_*^{11} = 4.023836152402511\times10^{185}\ \mathrm{GeV}^{11}\) , hence
$$
M = 7.467050992135091\times10^{16}\ \mathrm{GeV}.
$$
An alternate normal-homogeneous flag-unit convention for \(\mathrm{Vol}(K_6)\) — using \(4\pi^3 R_0^6\) in place of \((2\pi)^3/\sqrt3\cdot R_0^6\) for the \(K_6\) volume prefactor, with \(\mathrm{Vol}(S^2)=4\pi R_0^2\) and \(\mathrm{Vol}(S^1_Y/\mathbb{Z}_2)=\pi R_0/2\) — gives \(\mathrm{Vol}_9 = 8\pi^5 R_0^9 = 1.6041\times10^{-148}\ \mathrm{GeV}^{-9}\) and, using the reduced Planck mass \(\bar M_{\rm Pl} = 2.435\times10^{18}\) GeV, the companion value \(M_* = 6.010\times10^{16}\) GeV \(\approx 6.01\,M_U \approx \bar M_{\rm Pl}/40.51 \approx 4.93\times10^{-3}\,M_{\rm Pl,\rm full}\) . The two pipelines disagree by a factor of \(\approx 1.2\) — this spread is exactly the declared convention-softness of the flag-manifold volume prefactor (whether one carries the Killing-form normalization \((2\pi)^3/\sqrt3\) or the alternate normal-homogeneous \(4\pi^3\) convention through the reduction), and both numbers are reported here rather than one being silently preferred, precisely so a reviewer can trace either source.

 Both readings agree on the qualitative verdict, and the verdict is convention-proof : \(M_*/M_{\rm Pl} \ll 1\) in either pipeline, so the natural granularity scale sits at the compactification/unification scale , not at the 4D Planck scale — the observed 4D \(M_{\rm Pl}\) is an emergent, diluted quantity, inflated up from \(M_*\) by the large compactification volume \(\mathrm{Vol}(X_{\rm active})\) raised to the \(1/11\) power in the inverse relation. The reason this verdict survives the \(\approx 1.2\times\) convention spread is the exponent: flipping the verdict — pushing \(M_*\) up to \(\bar M_{\rm Pl}\) — would require \(\mathrm{Vol}_9\) to be wrong by a factor \(40.51^{11} \approx 4.82\times10^{17}\) , and the largest plausible swing available from re-choosing volume-normalization conventions on a homogeneous space of this type is of order \((2\pi)^9\pi^3 \approx 4.7\times10^{8}\) — nine orders of magnitude short of what would be needed to flip the qualitative verdict. So while the exact value of \(M_*\) is convention-soft (good to a factor of order 2, and the honest way to report it is \(M_* = O(\text{few})\times M_U\) rather than as a sharp seven-significant-figure prediction), the qualitative placement — floor at compactification scale, not at 4D Planck scale — is robust against any convention choice a reader could reasonably substitute.

 Three things must be said plainly about this computation so it is never mistaken for more than it is. First, it is conditional on the load-bearing identification "floor \(= M_*\) " — an identification that is physically natural (the KK/unification scale is the natural place for a compactification-native resolution quantum to live) but is not itself derived from the granularity chain; it is an application of the chain's structural claim (a floor exists) to the specific numerology of this frozen geometry. Second, the absolute value of the floor in GeV is not derived by this or any calculation of this type, and cannot be — this is a hard dimensional-analysis fact, not a gap in effort: no dimensionful number can be manufactured from a ratio of dimensionless geometric inputs (Buckingham- \(\pi\) ), so the 7.467 \(\times10^{16}\) GeV (or 6.010 \(\times10^{16}\) GeV) figure is really the dimensionless ratio \(M_*/M_{\rm Pl}\) re-expressed in GeV against the anchor \(M_{\rm Pl}\) that is put in by hand as one of the program's four irreducible anchors \(\{M_{\rm Pl}, \alpha_i(M_Z), y_t, |V_{us}|\}\) . Third, and most importantly for the grading discipline of this dossier: this is a derivable sub-question that has been answered, not a promotion of the R1 gate. The granularity root's own status — REDUCED-TO-AXIOM, one posit ( \(\Delta_0>0\) ) plus one measured anchor ( \(\hbar\) ) — is completely unaffected by whether the floor's numerical location is at \(M_*\approx 7\times10^{16}\) GeV or anywhere else; locating the floor is a Scale-root exercise performed on top of an already-existing structural claim, not a step in proving that claim. PROMOTIONS: 0 applies here exactly as everywhere else in this dossier.

 I.4 Granularity, applied completely: the root under reduction, stated with what it forces and what it cannot

 Because Granularity is the root under reduction for this gate, "applying it completely" means stating, without compression, the full logical shape of what has been forced and what has been left as a named, unremovable posit — the content that Sections 3.1–3.8 of the underlying derivation chain establish in full and that this construction section anchors at the deep-root level.

 What is forced, unconditionally, by the record-interface object alone (no posit needed). Once the record interface \(D\) is compact under \(d_{\rm op}\) and the cost \(c:D\to\mathbb{R}_{\ge0}\) is continuous with \(c(x)=0 \Rightarrow x\notin D\) (i.e., zero cost is not attainable by any genuinely distinguishable record), the extreme value theorem forces
$$
\varepsilon = \min_D c > 0
$$
directly: a continuous function on a compact set attains its minimum at some \(x^*\in D\) , and \(c(x^*)>0\) by the pointwise-positivity hypothesis, so \(\varepsilon = c(x^*)>0\) . This is T5, and it is a theorem, full stop — nothing is posited to get from " \(D\) compact" to "a positive floor exists." The entire weight of the gate is thereby transferred onto a single question: is \(D\) (the physically realized record space, written \(R_{\rm phys}\) ) actually compact?

 What is forced conditionally (Theorem B): FTC plus completeness force compactness. A Finite Test-Compression law (FTC) — for every bounded causal record-support system and every tolerance \(\eta>0\) there is a finite family of tests \(\{(T_j,e_j)\}_{j=1}^{M(B,\eta,\tau)}\) such that \(d_{\rm op}(r,s) \le \max_j|P(e_j|r,T_j)-P(e_j|s,T_j)| + \eta\) for all records \(r,s\) — together with the hypothesis that \(R_{\rm phys}\) is closed under \(d_{\rm op}\) -Cauchy limits (completeness), forces compactness by an explicit finite-net construction: fix \(\eta\) , use FTC to get a finite test family, map into \([0,1]^M\) by outcome frequencies, cover the totally-bounded image cube by \(\eta\) -cells, pull back one representative per nonempty cell to get a finite set \(\{r_1,\dots,r_K\}\) , and check every record lies within \(d_{\rm op}\le 3\eta\) of some representative — a finite \(3\eta\) -net at every \(\eta\) , hence total boundedness, which plus completeness gives compactness. This is a valid, fully worked conditional proof, and it is carried in this dossier with its genuinely extra hypothesis flagged rather than buried: completeness (Cauchy-closure of \(R_{\rm phys}\) ) is a real additional posit that total boundedness alone does not supply , and it belongs on the same residue ledger as \(\hbar\) , \(k_B\) , and \(\Delta_0\) — a referee-caught hidden hole that this construction states explicitly rather than folding silently into "the conditional."

 What is forced conditionally the other direction (basin-packing): the cell law forces FTC, without importing quantum mechanics. Given a single universal constant \(\Delta_0>0\) (the Uniform Operational Cell Law, stated below) and a finite total-variation budget \(\mathrm{Var}_{\rm op}(R)\le B\) , every stable, independently-retrievable, pairwise-resolvable record occupies a disjoint robustness basin of depth at least \(\Delta_0\) , so the count of such records obeys \(N\cdot\Delta_0 \le B\) , i.e. \(N \le \lfloor B/\Delta_0\rfloor < \infty\) , and the resulting finite test family satisfies FTC with \(M \lesssim (B/\Delta_0)^2\) . This argument imports nothing from quantum mechanics, nothing from the Bekenstein bound, nothing from thermodynamics — it is a bare packing inequality on a bounded resource, conditional only on the cell law itself. The conditional is sound and honest precisely because it is transparent about what it is conditional on : it grounds the count of distinguishable records given a grain, it never grounds the grain itself.

 What is decisively NOT forced: finite resources alone do not give FTC (Theorem A), and per-system finiteness does not give a universal grain (basin-shallowing). Both of these are theorems in the proper sense — worked countermodels that establish a definite "cannot," not merely "was not shown." Theorem A: take a classical pointer \(x\in[0,1]\) with finite spatial extent, finite duration \(\tau\) , and finite energy-time budget \(B\) (a pointer at rest needs no additional energy to support additional candidate positions). The readout test \(T_{x,y}\) ("is the pointer near \(x\) , excluding \(y\) ") gives \(P(e_x\mid r_x,T)=1\) and \(P(e_x\mid r_y,T)=0\) for any \(y\ne x\) , so \(d_{\rm op}(r_x,r_y)=1\) for every pair of distinct pointer positions. Then \([0,1]\) under \(d_{\rm op}\) is an uncountable discrete space — every pair is maximally separated — so for any \(\Delta\le 1\) , \(N_{\max}=\infty\) : not totally bounded, not compact, despite every stated resource bound being finite. The delta-test countermodel makes the same point about FTC directly: with tests \(f_x(r)=\mathbb{1}[r=x]\) , any finite test family \(\{f_{x_1},\dots,f_{x_M}\}\) fails to separate a generic pair \(r,s\notin\{x_1,\dots,x_M\}\) (possible because \([0,1]\) is uncountable) even though \(d_{\rm op}(r,s)=1\) — so FTC's approximation bound fails for every \(\eta<1\) . Basin-shallowing makes the parallel point about uniformity specifically: populate a bounded landscape ( \(\mathrm{Var}_{\rm op}(R)\le B\) ) with disjoint stable basins of depths \(d_n = B\cdot2^{-n-1}\) , so \(\sum_n d_n = B/2 < B\) (the finite-resource budget is respected) yet \(\inf_n d_n = 0\) (no smallest basin at all). For any fixed \(\eta>0\) only finitely many basins have depth \(\ge\eta\) , so the \(\eta\) -dependent total-boundedness face still holds — but the count of all stable records is infinite and there is no uniform floor, so the specifically uniform cell-law face fails outright. Together these two countermodels are the reason Fork A (deriving granularity's existence from finite causal resources alone, with nothing further assumed) is ruled out, not merely unproven — and they are why the posit that replaces it must be a uniform constant shared across all record-keeping systems, not a per-system resource bound: basin-shallowing shows directly that per-system finiteness is fully compatible with no smallest cell anywhere, so the only statement strong enough to close the gap is one universal quantum of resolution.

 The one named posit, stated in full at the deep-root level. All of the above forces the chain down to a single point of true freedom, which the program names rather than hides:

 Uniform Operational Cell Law (the granularity root, AXIOM-CLOSED, count = ONE). There exists a single, system-independent constant \(\Delta_0 > 0\) such that, for every bounded causal record-support system, no two stable, independently-retrievable records are operationally closer than \(\Delta_0\) in \(d_{\rm op}\) , and no stable record occupies an operational cell smaller than \(\Delta_0\) .

 This statement names a universal constant and specifies its structural role; it fixes no numerical value, and it never mentions \(\hbar\) — it passes the no-target-loading discipline (the same discipline, applied elsewhere in this corpus to a Yang–Mills mass-gap ratio, that forbids writing a law whose form is silently reverse-engineered from the number it is meant to reproduce). The value \(\Delta_0 \approx \hbar\) (in the appropriate spectral units, with the semiclassical count \(N \approx V/\hbar^n\) as its shadow) is a downstream residue, confirmed rather than input.

 Why this is the correct level to certify "one posit," and why the Pontryagin route does not lower the count to zero. A natural-looking shortcut exists: identify the physical action with a generating phase on a closed circle, so that "the action spectrum is discrete and equally spaced" becomes inter-derivable with "the underlying phase space is compact," via a Pontryagin-duality-type iff. This is a genuine mathematical fact, and it is recorded honestly — but it relocates the uniformity posit onto the compactness of the phase, it does not eliminate it, and deriving that phase-compactness from unitarity is circular by the program's own finding: unitarity is a Hilbert-space, quantum-mechanical statement, so using it to derive the cell law would place granularity downstream of quantum mechanics, which is exactly the certification circle this program set out to break (§I.5 below). The gate-specific granularity posit count is therefore pinned at one , and the dossier explicitly refuses the "zero posits" framing as a live promotion risk rather than a legitimate reading of the Pontryagin observation.

 I.5 The four Layer-2 admissibility screens, applied to this gate's object

 The program requires every gate to pass its central object through four Layer-2 screens before any closure claim is entered. Here is each one, applied to the granularity root specifically, stating what it eliminates, forces, or exposes.

 Screen 1 — Invariance (physical equivalence / no preferred frame). The object under test is the cost functional \(c\) and the floor \(\varepsilon=\min_D c\) . The screen asks: does the closure claim smuggle in a preferred frame, gauge, or coordinate choice? As detailed in §I.3 Role 1, the answer is that it does not, and the reason is structural rather than accidental: action, energy·time, and Shannon information are Lorentz scalars, so a floor stated as \(c(x)\ge\varepsilon\) for all \(x\in D\) is a frame-independent statement by construction — it takes the same numerical form after any boost. This is what eliminates the naive discrete-spacetime version of this claim (a length floor would fail this screen immediately, since length is not boost-invariant) and it is what forces the specific choice of cost currency (action/energy·time, never a spatial coordinate) made at the very first step of the derivation chain (§3.1 of the underlying chain, "reframe: cost, not length"). The screen passes cleanly; there is no hidden frame-dependence anywhere in T5, Theorem A, Theorem B, or the basin arguments, because none of them ever refers to a spatial position, only to cost values and outcome-frequency gaps.

 Screen 2 — Record-Interface (are the only ingredients records, tests, and outcome frequencies — nothing richer smuggled in?). This screen is close to the central content of the whole gate rather than a peripheral check, because the entire point of the pre-Hilbert metric \(d_{\rm op}\) is to state distinguishability using only records \(r,s\) , admissible tests \(T\) , outcomes \(e\) , and their frequencies \(P(e\mid r,T)\) — with no Hilbert space, no inner product, no Born rule, no trace distance, and no uncertainty principle anywhere in the definition or in its domain. This is checked directly against the classical witness case: let \(\Omega\) be an arbitrary measurable space and let admissible tests be measurable functions \(f:\Omega\to[0,1]\) ; then \(d_{\rm op}\) reduces exactly to classical total-variation distance, and for any two distinct points, indicator tests give \(d_{\rm op}=1\) with no quantum structure invoked anywhere. This is what the screen exposes and then eliminates : the surface-level worry that "distinguishable" secretly means "Hilbert-orthogonal," and hence that the whole construction is quietly already inside quantum mechanics before it starts. It is eliminated at the surface level by this reduction. The screen also exposes, honestly, what it does not eliminate : the deeper certification question — whether the cost floor, even stated this way, still sits downstream of quantum mechanics in the sense that "cost per distinguishable transition" is a concept whose only known theorems (Margolus–Levitin, Landauer, Bekenstein) are proved inside QM/QFT — remains open, carried explicitly as Hole 3 (the co-fundamentality certificate) rather than claimed closed. The record-interface screen is passed at the surface (no Hilbert import in the definition ) and is honestly flagged as unresolved at depth (no proof that the content is prior to QM). Both halves are stated so a reader cannot mistake the passed half for the open half.

 Screen 3 — Causal-Order / target-blindness (bounded causal resources only; no back-solving to the wanted floor). This screen asks two things simultaneously: does the construction use only genuinely bounded, causally available resources (finite extent, finite duration, finite action/energy·time — never an unbounded or acausal input smuggled in as if it were finite), and is the posit stated without reference to the number it is meant to reproduce? On the first count, every object in the chain is explicitly built on a bounded causal record-support system \(R\) : finite spatial extent, finite duration \(\tau\) , finite budget \(B\) . The relabel guard makes this precise and is itself a target-blindness check: if \(B\) were allowed to mean finite information capacity in bits, then \(N_{\max}\le 2^B\) would follow trivially — but that definition of \(B\) silently assumes finite record capacity, which is the very conclusion sought, so it is explicitly forbidden ( RELABEL-FAIL if \(B=\) bits; the chain keeps \(B=\) action or energy·time throughout, which makes T3/FTC a genuinely open target rather than a tautology). On the second count — target-blindness proper — the Uniform Operational Cell Law is stated with a bare existential ("there exists \(\Delta_0>0\) ...") and mentions no numerical value and no reference to \(\hbar\) anywhere in its statement; the identification \(\Delta_0\approx\hbar\) is discovered only downstream, as a residue, never used to shape the posit's wording. This is the same discipline, applied here, that elsewhere in this corpus forbids writing a coupling-ratio formula whose functional form was reverse-engineered from a known target value ( \(\kappa^3/\pi\) -type target-loading). The screen passes: the posit is causally bounded in its inputs and blind to its own numerical shadow.

 Screen 4 — Nonseparability (does per-system finiteness silently stand in for a universal statement?). This is the screen that does the most specific work for this particular gate, because it is precisely the distinction the basin-shallowing countermodel was built to expose. The naive move would be: "finite resources give finite records system-by-system, and a large collection of finite things is basically the same as a universal floor." The screen forbids exactly this move, and the basin-shallowing construction proves the forbidding is necessary, not merely cautious: a landscape with basin depths \(d_n=B\cdot2^{-n-1}\) has every individual \(\eta\) -slice finite (for any fixed \(\eta>0\) , only finitely many basins are deep enough to count, so per- \(\eta\) total boundedness holds and no single system ever exhausts its finite budget) while the collection as a whole has \(\inf_n d_n=0\) — no universal lower bound, no uniform grain, arbitrarily shallow basins persisting no matter how far the sequence runs. The nonseparability screen is what forces the recognition that "per-system total boundedness" and "one universal constant shared by all record systems" are logically different claims that happen to coincide only under the posited uniformity , and it is what justifies stating the posit as a claim about all bounded causal record-support systems simultaneously (a genuinely nonseparable, cross-system statement) rather than as a property that could in principle be assembled system-by-system from purely local, separable data. The screen exposes the gap and the gap is exactly what the named posit is required to close — this is the clearest instance in the whole gate of a Layer-2 screen not merely being "passed" administratively but doing real derivational work: it is the formal statement of why Hole 4 (deriving \(\Delta_0\) from a deeper resource law) remains open, and why, absent that derivation, uniformity has to be posited globally rather than assembled locally.

 I.6 What the four screens jointly certify, and what they leave for Construction II

 Read together, the four screens certify that the object this gate reduces — the operational cost floor \(\varepsilon=\min_D c>0\) , resting on the Uniform Operational Cell Law \(\Delta_0>0\) plus the measured residue \(\hbar\) — is stated in a form that is frame-independent (Screen 1), free of a Hilbert-space definition of distinguishability at the surface though not yet certified prior to quantum mechanics at depth (Screen 2), built from genuinely bounded causal inputs and blind to its own numerical target (Screen 3), and honestly global rather than an illegitimate assembly of separable per-system facts (Screen 4). No screen is tripped; none is fudged. What the screens do not do — and are not designed to do — is supply the derivation of \(\Delta_0\) itself, or certify the strict co-fundamentality ordering of the floor against quantum mechanics. Those remain the two live holes (Hole 1, the keystone reconstruction target, and Hole 3, its co-fundamentality twin), carried forward exactly as stated in the derivation chain and not touched by this deep-root construction. The grade this section anchors is, and remains, REDUCED-TO-AXIOM / ANCHORED +1 : one named posit, one measured anchor, four passed admissibility screens, and two named open holes whose closure — not any move available at the deep-root level — is the only route to a stronger terminal. PROMOTIONS: 0.

 Construction II - the full derivation

 This section carries out the chain in full: every object pinned at all three layers, every theorem stated with hypotheses and proof, every countermodel worked to the arithmetic that makes it decisive, and the exact point named where the chain stops being a theorem and becomes a posit. Nothing here is asserted without either a proof or an explicit countermodel; where a step is conditional, the condition is stated and never silently absorbed.

 II.1 The object, pinned at all three layers

 The granularity root sits below the frozen 13-dimensional arena \(\mathfrak{B}_{\rm active} = [\mathcal{M}_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2]_\times \oplus [\mathcal{F}^+_{\rm finite}\oplus\mathcal{C}_{\rm admiss}]_\oplus \otimes [\mathcal{E}_{\rm matter}\oplus\mathcal{E}_{\rm gauge}\oplus\mathcal{E}_{\rm Higgs}\oplus\mathcal{E}_{\rm proton}]_\otimes\) with \(K_6 = SU(3)/T^2\) (the \(A_2\) full flag manifold) and \(D = 4+6+2+1 = 13\) . This is stated explicitly and carried as context throughout — the delta-test and basin-shallowing countermodels below survive with no reference to any metric factor of \(\mathfrak{B}_{\rm active}\) at all, which is the honest reason this root's own reduction does not draw on the geometry pack as load-bearing substrate (only the Scale sub-question in §II.6 does). The object this root actually uses is the bare record interface, and it is pinned here at the same three-layer discipline used everywhere else in the corpus, so that no layer can be silently swapped mid-argument.

 × Stage (record geometry, not metric geometry). A set \(D\) of distinguishable records, a family of admissible tests \(T\) with outcomes \(e\) , and conditional outcome frequencies \(P(e\mid r,T)\) for \(r\in D\) . No topology is assumed on \(D\) a priori beyond what \(d_{\rm op}\) below induces; no Hilbert space, no vector space structure, no linearity.

 ⊕ Rulebook (cost currency, admissibility, and the guard against relabeling). The cost functional \(c:D\to\mathbb{R}_{\ge0}\) is charged in a fixed currency \(B=\) action or energy·time , never bits — this is the G5 relabel guard (§II.5) and it is load-bearing: swapping \(B\) to an information capacity in bits trivializes the entire problem (Hamming-ball counting gives \(N_{\max}\le 2^B\) for free) by assuming the very finiteness of record capacity that is under investigation. "Cost" attaches only to transitions between operationally distinguishable records — records separable by some admissible test — never to gliding among records that no test can tell apart. Admissibility of a test \(T\) is a rulebook fact (a test must be a physically realizable procedure with a finite outcome alphabet), not a metric fact.

 ⊗ Actors (the operator and the readout). The operational distance
$$
d_{\rm op}(r,s) \;=\; \sup_{T,e}\, \big|\, P(e\mid r,T) - P(e\mid s,T)\,\big|
$$
is the sole operator this root uses: a supremum, over all admissible tests and outcomes, of the gap in outcome frequencies. Its domain is \(D\times D\) ; its readout is a nonnegative real number, with \(d_{\rm op}(r,s)=0\) iff no admissible test can ever separate \(r\) from \(s\) (operational indistinguishability). Compare this to every downstream spectral operator in the arena (Laplacians, Dirac operators, Lichnerowicz operators on \(K_6\) ): those carry a connection \(\nabla\) , an endomorphism \(E\) , and a metric-dependent domain. \(d_{\rm op}\) carries none of that — its "connection" is the choice of admissible test family, its "endomorphism" is trivial (there is no bundle curvature to correct for), and its domain is only the raw record set \(D\) . This absence is a feature, not an omission: it is exactly what keeps Hilbert-space orthogonality from being smuggled into the definition of distinguishability, which is the surface circularity this root exists to break.

 Classical witness (a worked, fully computed check that \(d_{\rm op}\) is well-posed and non-vacuous). Let \(\Omega\) be a measurable space and let admissible tests be measurable functions \(f:\Omega\to[0,1]\) (fuzzy yes/no readouts) with \(P(e\mid r,T)=f(r)\) for the "yes" outcome. Then for two points \(\omega_1\ne\omega_2\in\Omega\) , taking \(f\) to range over all measurable \([0,1]\) -valued functions, \(d_{\rm op}(\omega_1,\omega_2)=\sup_f |f(\omega_1)-f(\omega_2)|\) reduces exactly to the classical total variation distance between the point masses \(\delta_{\omega_1}\) and \(\delta_{\omega_2}\) , and for distinct points the indicator test \(f=\mathbb{1}_{\{\omega_1\}}\) achieves \(|f(\omega_1)-f(\omega_2)|=1\) , so \(d_{\rm op}(\omega_1,\omega_2)=1\) exactly. This computation uses no Hilbert structure anywhere — no inner product, no Born rule, no trace norm — and it is the fact that makes \(d_{\rm op}\) a genuine pre-Hilbert operational metric rather than a restatement of quantum orthogonality in different notation. It is also the fact that will make the delta-test countermodel of §II.4 immediate to compute.

 II.2 T5 — the floor from compactness (an unconditional theorem)

 Statement (T5). Let \(D\) be the space of distinguishable records and \(c:D\to\mathbb{R}_{\ge0}\) a cost functional. Suppose:

 \(D\) is compact (in the topology induced by \(d_{\rm op}\) );

 \(c\) is continuous on \(D\) ;

 \(c(x) = 0 \Rightarrow x \notin D\) (pointwise positivity: no genuinely distinguishable record has zero cost).

 Then
$$
\varepsilon \;=\; \min_{x\in D} c(x) \;>\; 0.
$$

 Proof. A continuous real-valued function on a nonempty compact set attains its infimum at some point of the set — this is the extreme value theorem (Weierstrass), applied here to \(c\) on \(D\) . Let \(x^*\in D\) be a minimizer, so \(c(x^*) = \min_D c\) . By hypothesis (3), since \(x^*\in D\) , \(c(x^*)\ne 0\) ; since \(c\) is nonnegative-valued by construction, \(c(x^*) > 0\) . Set \(\varepsilon:= c(x^*)\) . Then for every \(x\in D\) , \(c(x)\ge c(x^*) = \varepsilon > 0\) . \(\blacksquare\) 

 This is not a hand-wave dressed as a theorem: it is exactly the extreme value theorem, with the physical content folded entirely into the three hypotheses, none of which T5 itself supplies. The proof transfers the entire remaining burden of the problem onto a single question — is \(D\) (the physically realizable record space \(R_{\rm phys}\) ) compact? — and everything from here to the named posit is an attack on that one question.

 II.3 Reframe: cost, not length (the two-line argument that licenses working with \(c\) at all)

 Before attacking compactness it is necessary to justify why the object of study is a cost floor on distinguishable transitions rather than a floor on spatial length — the more familiar (and more expensive) claim that reality has a smallest length. Two observations, each elementary, do this work.

 (L1) Infinite subdivision among non-orthogonal (overlapping) states is harmless. If \(r,s\in D\) are such that no admissible test separates them well — \(d_{\rm op}(r,s)\) small or zero — then a process that glides continuously through a one-parameter family of such states accomplishes nothing distinguishable; by definition no test can certify that any particular sub-step occurred. Overlap is free: subdividing a continuum of indistinguishable or barely-distinguishable configurations costs nothing, because "cost" as fixed by the rulebook (§II.1) attaches only to operationally distinguishable transitions.

 (L2) Infinite prerequisite chains of nonzero-cost transitions are impossible under finite resource. Suppose a process must pass through an infinite sequence of pairwise-orthogonal (fully distinguishable, cost \(\ge\varepsilon_0>0\) each) intermediate records before completing. The total cost is bounded below by \(\sum_{n=1}^\infty \varepsilon_0 = \infty\) . A process with finite budget \(B<\infty\) cannot complete such a chain. Distinguishable transitions are dear; only they can be counted, and only finitely many of them can be afforded.

 Conclusion. Any process completable under a finite resource budget has finitely many costly (distinguishable) intermediate steps — regardless of how finely the underlying continuum can in principle be subdivided. This is the move that converts "does reality have a smallest length?" into "does reality have a smallest cost (action/information) per distinguishable step?" — a strictly weaker and better-motivated question.

 The Lorentz corollary (why this reframe pays for itself immediately). A floor on spatial length is frame-dependent: length contracts under boosts, so a minimum length in one frame is not a minimum length in another — the standard, expensive objection to any naive "discrete spacetime" proposal, which either breaks Lorentz invariance outright or requires an elaborate deformed-symmetry apparatus to repair it. Cost, action, and information are Lorentz scalars — they do not transform under boosts. A floor on a Lorentz scalar therefore picks out no preferred frame. The cost-floor reframe pays spatial granularity's most expensive bill for free, without needing any deformed-symmetry machinery, simply by choosing the right currency to put the floor on.

 The \(\hbar>0\) reading — stated precisely as a reading, not a derivation. If completable processes exist at all (and they manifestly do — physics happens), there must be a positive floor on the cost of a distinguishable transition; that floor, once its size is measured, is the nonzero quantum of action \(\hbar\) . Formally sending \(\hbar\to 0\) reproduces exactly the pathologies that a zero floor predicts: the ultraviolet catastrophe of blackbody radiation (unboundedly many high-frequency modes each carrying cost \(\to 0\) , i.e. free), the infinite classical self-energy of a point charge, and the instability of the classical atom (an electron radiating continuously as it spirals into the nucleus — an infinite descent through indistinguishable-in-the-limit orbital states, exactly the L2 pathology run in reverse). Each of these is an infinite descent that a positive floor \(\hbar>0\) truncates. This explains that \(\hbar>0\) must hold for completable physics to exist; it does not explain which numerical value \(\hbar\) takes. That distinction — structure versus value — is carried through the entire remainder of the derivation and is restated explicitly at the point the value is finally consumed (§II.8).

 II.4 Compactness attacked directly and shown NOT to follow from finite resource alone (Theorem A, a banked loss)

 The question left by T5 is whether \(D\cong R_{\rm phys}\) , the physically realizable record space of a bounded causal system, is compact. The natural first guess is that finiteness of the underlying physical resources — finite spatial extent, finite duration, finite action-or-energy budget — should already force this. This guess is tested directly and fails, with a fully worked countermodel.

 Setup (T3 target, stated precisely). For a bounded causal record-support system \(R\) — finite spatial extent, finite duration \(\tau\) , finite budget \(B\) (action or energy \(\cdot\) time) — with \(R_{\rm phys}\) the admissible, stably-retrievable records under \(d_{\rm op}\) : does \(R_{\rm phys}\) compact follow, i.e. does \(N_{\max}(R,\Delta,\tau)<\infty\) for every resolution \(\Delta>0\) ?

 Theorem A (the countermodel; DECISIVE, a banked loss for the naive "finite resource \(\Rightarrow\) compact" claim). Let \(R\) be a classical pointer with position \(x\in[0,1]\) , records \(r_x\) labeled by \(x\) . The pointer sits at rest: no energy scaling is required with the number of distinguishable positions, so finite spatial extent ( \([0,1]\) ), finite duration \(\tau\) , and finite energy \(\cdot\) time budget \(B\) are all satisfied trivially and independently of how finely \(x\) is specified. Define the readout test \(T_{x,y}\) : "is the pointer near \(x\) , to the exclusion of \(y\) " — an admissible test with outcome \(e_x\) satisfying
$$
P(e_x\mid r_x, T_{x,y}) = 1, \qquad P(e_x \mid r_y, T_{x,y}) = 0.
$$
Then for every pair \(x\ne y\) in \([0,1]\) ,
$$
d_{\rm op}(r_x,r_y) \;=\; \sup_{T,e}|P(e\mid r_x,T)-P(e\mid r_y,T)| \;\ge\; |P(e_x\mid r_x,T_{x,y}) - P(e_x\mid r_y,T_{x,y})| \;=\; 1.
$$
Since \(d_{\rm op}\le 1\) always (it is a supremum of differences of probabilities, each in \([0,1]\) ), this gives \(d_{\rm op}(r_x,r_y) = 1\) exactly , for every distinct pair \(x\ne y\) .

 Consequence. Under \(d_{\rm op}\) , \([0,1]\) becomes an uncountable discrete space : for any resolution \(0<\Delta\le 1\) , every pair of distinct points is \(\Delta\) -separated (since their distance is exactly \(1\ge\Delta\) ). Hence \(N_{\max}(R,\Delta,\tau) = \infty\) for every such \(\Delta\) — the space is not totally bounded, and therefore not compact . \(\blacksquare\) 

 Reading the result. Finite extent, finite duration, and finite energy \(\cdot\) time budget were all honored, exactly as posed in the T3 target, and compactness failed anyway — decisively, not marginally. The obstruction is precise: finite resource stops nothing about how sharp a readout test can in principle be. The formal statement of the missing ingredient is
$$
B < \infty \;\;\overset{?}{\Longrightarrow}\;\; \forall\, \Delta>0,\; N_{\max}(R,\Delta,\tau) < \infty,
$$
and Theorem A shows the implication is false as stated — some further law connecting budget to resolution is required, and finiteness of \(B\) by itself is not that law.

 The relabel guard (why the "easy fix" is illegitimate — G5). One might try to repair Theorem A by simply redefining \(B\) to be a finite information capacity in bits rather than action/energy \(\cdot\) time. Under that relabeling, \(N_{\max}\le 2^B\) follows trivially by counting. But this "fix" assumes exactly the conclusion under investigation — that the record space has a finite bit-capacity — dressed up as a resource bound. It is flagged explicitly as illegitimate: keeping \(B\) = action or energy \(\cdot\) time, the target (T3) is OPEN; relabeling \(B\) = bits is a RELABEL-FAIL , not a proof. This guard is carried forward into the closing conditions on every open hole in §II.9 below.

 II.5 The repair: Finite Test-Compression (FTC) and its sufficiency for compactness (Theorem B, a valid conditional proof)

 Theorem A shows finite resource alone is not enough. The next question is what additional, minimal-looking law would be enough — and whether, once stated, it can be proved sufficient without smuggling in anything from quantum mechanics.

 Lemma FTC (the named target law). For every bounded causal record-support system \(R\) and every tolerance \(\eta>0\) , there exists a finite test family \(\mathcal{T}_\eta = \{(T_j,e_j)\}_{j=1}^{M(B,\eta,\tau)}\) such that for all records \(r,s\) ,
$$
d_{\rm op}(r,s) \;\le\; \max_{1\le j\le M} \big| P(e_j\mid r,T_j) - P(e_j\mid s,T_j) \big| \;+\; \eta.
$$
In words: every operational distinction that bounded causal resources can make is \(\eta\) -approximable using only finitely many bounded-resource tests. \(M\) is allowed to grow without bound as \(\eta\to 0\) ; the law only requires finiteness at each fixed \(\eta\) . This is the pre-quantum analogue of the nuclearity condition used in algebraic quantum field theory (Buchholz–Wichmann), but stated with no Hilbert space, no trace-class operators, and no field-theoretic input of any kind — it is a statement purely about the test family, not about states in a Hilbert space.

 Theorem B (T3 conditional on FTC + completeness; VALID PROOF). If FTC holds for \(R_{\rm phys}\) and \(R_{\rm phys}\) is complete — closed under \(d_{\rm op}\) -Cauchy limits — then \(R_{\rm phys}\) is compact.

 Proof. Fix \(\eta>0\) . By FTC, there is a finite test family \(\mathcal{T}_\eta=\{(T_j,e_j)\}_{j=1}^M\) with \(M=M(B,\eta,\tau)<\infty\) . Define the finite-dimensional evaluation map
$$
\Phi_\eta: R_{\rm phys} \to [0,1]^M, \qquad \Phi_\eta(r) = \big(P(e_1\mid r,T_1),\,\dots,\,P(e_M\mid r,T_M)\big).
$$
The target cube \([0,1]^M\) is compact (Tychonoff / Heine–Borel in finite dimensions), hence totally bounded: it can be covered by finitely many sup-norm balls of radius \(\eta\) . Choose one representative record \(r_k\) from each nonempty preimage cell, giving a finite set \(\{r_1,\dots,r_K\}\subset R_{\rm phys}\) , \(K=K(\eta)<\infty\) . For an arbitrary \(r\in R_{\rm phys}\) , let \(r_k\) be the representative of the cell containing \(\Phi_\eta(r)\) ; then by construction
$$
\max_{1\le j\le M} \big|\Phi_\eta(r) j - \Phi \eta(r_k) j\big| \;\le\; 2\eta
$$
(both points lie in the same \(\eta\) -ball, or in adjacent cells whose diameter is bounded by \(2\eta\) under the covering used). Applying FTC to the pair \((r,r_k)\) ,
$$
d {\rm op}(r,r_k) \;\le\; \max_j\big|P(e_j\mid r,T_j)-P(e_j\mid r_k,T_j)\big| + \eta \;\le\; 2\eta + \eta \;=\; 3\eta.
$$
So \(\{r_1,\dots,r_K\}\) is a finite \(3\eta\) -net for \(R_{\rm phys}\) , for every \(\eta>0\) . A metric space admitting a finite \(\delta\) -net for every \(\delta>0\) is, by definition, totally bounded. Total boundedness plus completeness (the standing extra hypothesis) is exactly the classical characterization of compactness in a metric space. Hence \(R_{\rm phys}\) is compact. \(\blacksquare\) 

 Every constant in this proof is tracked explicitly — the \(2\eta\) from the covering, the \(+\eta\) from FTC itself, combining to the \(3\eta\) -net bound — and nothing is asymptotic or order-of-magnitude; the proof produces a net of an explicitly quoted radius at every finite \(\eta\) .

 The hidden hole that must never be folded silently into the conditional. Total boundedness alone does not give compactness in a general metric space — a bounded, totally-bounded-looking set that is not closed under Cauchy limits (e.g. the open interval or a space with "holes" where limit points are missing) can fail to be compact. The completeness (Cauchy-closure) hypothesis — that \(R_{\rm phys}\) is closed under \(d_{\rm op}\) -Cauchy limits, equivalently that the continuum of records has no missing limit points — is therefore a genuine extra assumption , independent of FTC, and it is posited, not proven . It belongs on the residue ledger (§II.8) alongside \(\hbar\) , \(k_B\) , the Bekenstein constant, and \(\Delta_0\) , and this dossier tracks it there explicitly rather than absorbing it invisibly into "Theorem B holds."

 II.6 FTC does not follow from finite resources alone either (a second decisive countermodel; Fork A ruled out)

 Theorem B shows FTC (plus completeness) is sufficient for compactness. The next natural move is to ask whether FTC itself is forced by the same finite-resource hypotheses that failed to force compactness directly in Theorem A. It is not — and again the failure is decisive, not merely unproven.

 The delta-test countermodel. Let admissible binary tests be functions \(f_a(r) = P(e_a\mid r,T_a)\in[0,1]\) , so that \(d_{\rm op}(r,s) = \sup_a |f_a(r)-f_a(s)|\) exactly as in the classical witness of §II.1. Take the record space \(R=[0,1]\) and allow the full family of indicator tests \(f_x(r) = \mathbb{1}[r=x]\) for every \(x\in[0,1]\) (each individually a perfectly legitimate, finite-resource, admissible test — it asks a single yes/no question). For any two distinct records \(r\ne s\) , the test \(f_r\) separates them: \(f_r(r)=1\) , \(f_r(s)=0\) , so \(d_{\rm op}(r,s)=1\) .

 Now take any finite subfamily \(\{f_{x_1},\dots,f_{x_M}\}\) — the candidate \(\mathcal{T}_\eta\) that FTC would need to supply. Because \([0,1]\) is uncountable, one can always choose \(r,s\notin\{x_1,\dots,x_M\}\) with \(r\ne s\) (a finite set cannot exhaust an uncountable one). For this pair, every selected test returns the same value on both:
$$
f_{x_j}(r) = \mathbb{1}[r=x_j] = 0 = \mathbb{1}[s=x_j] = f_{x_j}(s) \qquad \text{for every } j=1,\dots,M,
$$
so \(\max_j|f_{x_j}(r)-f_{x_j}(s)| = 0\) , while the true operational distance is \(d_{\rm op}(r,s)=1\) . FTC requires \(d_{\rm op}(r,s)\le \max_j|\cdots|+\eta\) for the chosen \(\eta\) ; here that reads \(1 \le 0+\eta\) , i.e. \(\eta\ge 1\) — so FTC fails for every \(\eta<1\) , for this system, no matter which finite test family is chosen. \(\blacksquare\) 

 Reading the result. Finite causal support ( \(R=[0,1]\) , bounded), finite duration, and finite action-or-energy \(\cdot\) time budget (the pointer test costs nothing — it is a single yes/no readout) are all honored, and yet FTC fails outright, not marginally. FTC is therefore not a theorem that finite resources deliver; it is a genuinely independent finite-resolution law — a statement that the test space itself is constrained (that reality does not, in fact, make available an uncountable family of infinitely sharp indicator tests), not a consequence of budget bookkeeping. Adopting FTC (or the stronger cell law that implies it, §II.7) is therefore naming the real primitive — Fork B — not completing a derivation from something weaker — Fork A, which this countermodel rules out from the stated premises.

 II.7 The named posit and its sufficiency (basin-packing), and why it must be uniform (the second countermodel)

 The Uniform Operational Cell Law (the one posit; AXIOM-CLOSED, UNPROVEN). 

 There exists a single, system-independent constant \(\Delta_0 > 0\) such that, for every bounded causal record-support system, no two stable, independently-retrievable records are operationally closer than \(\Delta_0\) in \(d_{\rm op}\) , and no stable record occupies an operational cell of size smaller than \(\Delta_0\) . Equivalently: the record-keeping substrate of reality carries one universal positive resolution quantum.

 This statement mentions \(\hbar\) nowhere, and fixes no numerical value — it names a structural fact (a universal positive resolution constant exists) and nothing more, which is exactly what lets it pass the no-target-loading test: nothing in the statement or its later use presupposes or back-solves for \(\hbar\) 's numerical value. That value, when it is measured, is a downstream residue (a confirmation, sometimes labeled "T7" in the corpus), never an input to this posit.

 Basin-packing (the sufficiency lemma; SOUND CONDITIONAL — no quantum mechanics, no Bekenstein bound, no thermodynamics anywhere in the argument). Suppose the cell law holds: some universal \(\Delta_0>0\) exists. Consider a bounded causal system \(R\) with finite total operational variation \(\mathrm{Var}_{\rm op}(R) \le B\) (the total "distinguishability budget" available to the system, measured in the same currency \(B\) = action/energy \(\cdot\) time fixed in §II.1). Each stable, independently-retrievable record requires a robustness basin — a region of record-space around it, in \(d_{\rm op}\) , that is not shared with any other stable record — of operational depth at least \(\Delta_0\) (this is exactly what "no two stable records closer than \(\Delta_0\) " means operationally: their basins do not overlap). Since pairwise-resolvable, mutually stable records occupy pairwise-disjoint basins each of depth \(\ge \Delta_0\) , and the total budget available to carve out such basins is bounded by \(B\) ,
$$
N\cdot \Delta_0 \;\le\; B \qquad\Longrightarrow\qquad N \;\le\; \left\lfloor \frac{B}{\Delta_0} \right\rfloor \;<\; \infty.
$$
This directly gives a finite bound on the number of pairwise-distinguishable stable records, and running the same packing argument over pairs of tests yields \(M \lesssim (B/\Delta_0)^2\) for the size of a finite test family achieving any fixed resolution — i.e. FTC follows from the cell law by this explicit, elementary counting argument. Nothing in the packing count imports Hilbert-space structure, the Bekenstein bound, or any thermal/statistical-mechanical reasoning: it is a bare pigeonhole argument on operational distance and a budget. Conditional on the cell law, the argument is honest, not circular — it derives the count (finiteness of \(N\) and \(M\) ), never the grain ( \(\Delta_0\) 's existence or value), and the grain is exactly the one thing that was posited going in.

 Why the posit must be uniform, not merely per-system — the sharpened basin-shallowing countermodel (a second decisive banked loss). One might hope for a weaker, more modest posit: perhaps each system individually has some finite resolution \(\Delta(\eta)\) depending on the tolerance \(\eta\) and on the system, without any single universal \(\Delta_0\) shared across all systems. This weaker posit is shown to be insufficient by direct construction.

 Populate a bounded landscape with total budget \(\mathrm{Var}_{\rm op}(R)\le B\) with a countable family of disjoint stable basins of depths
$$
d_n = B\cdot 2^{-n-1}, \qquad n = 1,2,3,\dots
$$
The total depth used is
$$
\sum_{n=1}^\infty d_n = B\sum_{n=1}^\infty 2^{-n-1} = B\cdot\frac{1}{2} = \frac{B}{2} \;<\; B,
$$
so the finite-resource budget is honored with room to spare. But
$$
\inf_n d_n = \lim_{n\to\infty} B\cdot 2^{-n-1} = 0,
$$
so there is no uniform lower bound on the basin depths — no smallest cell.

 Consequences, worked exactly. For any fixed tolerance \(\eta>0\) , only finitely many basins have depth \(d_n\ge\eta\) (since \(\sum d_n<\infty\) forces \(d_n\to 0\) , so only finitely many terms exceed any fixed \(\eta\) ) — so the \(\eta\) -dependent, per-tolerance face of the claim survives: at each fixed resolution, the landscape is totally bounded, exactly what finite resources were shown able to buy. But the count of all stable records across all \(n\) is infinite, and there is no smallest record cell in the landscape as a whole ( \(\inf_n d_n=0\) ) — so the uniform floor face fails outright. This is the continuum-pointer pathology of Theorem A (§II.4) re-derived one level down, at the level of basin depths rather than raw record separation.

 Reading the result. Finite causal support, finite duration, finite action/energy \(\cdot\) time budget, and even a continuous stability landscape (basins, not raw indicator tests) together do not imply a uniform positive \(\Delta_0\) . The gap between "an \(\eta\) -dependent floor exists for every fixed \(\eta\) " and "a single uniform \(\Delta_0\) exists for all systems" is not a matter of insufficient cleverness in the construction — it is a genuine theorem (a valid counterexample under the stated premises), and that is exactly what makes naming \(\Delta_0\) as a posit an honest move rather than a restatement of something already implied.

 The both-ends argument for why the uniform posit is the unique meeting point. Working backward: a system-independent \(\Delta_0\) cannot be assembled from any per-system resource bound, because the basin-shallowing construction shows per-system finiteness is fully compatible with \(\inf=0\) across systems — so if a uniform floor exists at all, it must be a fact about the record-keeping substrate itself, not a derived feature of any one system's budget. Working forward: finite resources, on their own, deliver only per-system total boundedness (the \(\eta\) -dependent face), never more. The two directions meet only at the single statement "there is one universal action/resolution quantum shared by all record systems" — which is precisely the Uniform Operational Cell Law, and precisely what " \(\hbar\) exists as structure" means before any numerical value is attached. This is not a reduction of the posit to something weaker; it is the structural signature of an irreducible root — the place where the pressure from both directions converges on exactly one statement and stops.

 II.8 Value versus structure: where \(\hbar\) enters, and where it does not

 At no point in §II.2–II.7 has any numerical value been used or produced. T5, Theorem A, Theorem B, the delta-test countermodel, basin-packing, and basin-shallowing are all statements about existence — of a floor, of compactness, of a compression law, of a uniform cell — none of which mentions \(\hbar\) , \(k_B\) , or any other dimensionful constant. This is deliberate and is the precise sense in which the program targets structure , never magnitude .

 The reduced Planck constant enters exactly once, at the very end of the chain, as the measured size of the posited cell:
$$
\hbar \;\approx\; 1.0546\times10^{-34}\ \text{J·s},
$$
consumed as the identification \(\Delta_0 \leftrightarrow \hbar\) (in appropriate spectral units) — a residue, never an input to any theorem above. It is the only genuinely atomic object on this root : a directly measured invariant that enters as a value and is never derived from the structural chain, standing on exactly the same footing as the four frozen headline anchors of the wider 13-dimensional construction, \(\{M_{\rm Pl}=1.2209\times10^{19}\text{ GeV},\ \alpha_i(M_Z),\ y_t,\ |V_{us}|\}\) . Its pull against this root is, honestly, none — it is not a prediction being checked against data; it is the input that gives the posited \(\Delta_0\) a number.

 The semiclassical shadow of this identification is the familiar state-counting formula
$$
N_{\rm distinguishable} \;\approx\; \frac{\text{phase-space volume}}{\hbar^{\,n}},
$$
which is the same "uniform cell of size \(\hbar\) " statement realized symplectically — visible independently in statistical mechanics, in Bohr–Sommerfeld quantization, and in the Bekenstein bound's information/area relation. This is confirmation of the posited structure (a "T7" check, in the corpus's internal labeling), never a separate derivation of it, and it is not claimed as such here.

 The residue ledger, carried explicitly and never silently dropped: \(\{\hbar,\ k_B,\ \text{the Bekenstein constant},\ \Delta_0,\ \text{the completeness (Cauchy-closure) hypothesis of Theorem B}\}\) . The reframe carried out in §II.3–II.7 trades one constant (a bare cost-floor \(\varepsilon\) ) for two related structures (a resolution floor \(\Delta_0\) plus the completeness hypothesis needed for compactness) — this is a better-motivated relocation of where the irreducible content sits , not a reduction in the count of free residues, and this dossier states that plainly rather than presenting the reframe as having eliminated a constant.

 II.9 Assembling the chain: the exact logical dependency

 Collecting §II.2–II.8 into the single dependency chain that constitutes the reduction:
$$
\underbrace{\Delta_0>0} {\text{named posit (§II.7)}} \;\xRightarrow{\text{basin-packing, sound conditional}}\; \underbrace{\text{FTC}} {\text{§II.5}} \;\xRightarrow[\text{+ completeness (extra posit)}]{\text{Theorem B, valid proof}}\; \underbrace{R_{\rm phys}\text{ compact}} {\text{§II.5}} \;\xRightarrow{\text{T5, unconditional theorem}}\; \underbrace{\varepsilon=\min_D c>0} {\text{§II.2}},
$$
with the two countermodels of §II.4 and §II.6–II.7 (Theorem A: finite resource \(\not\Rightarrow\) compactness directly; the delta-test: finite resource \(\not\Rightarrow\) FTC; basin-shallowing: finite resource + continuous stability \(\not\Rightarrow\) uniform \(\Delta_0\) ) standing as the decisive, worked demonstrations that no arrow in this chain can be reversed or shortened starting from finite causal resources alone — establishing that the chain bottoms out at exactly the boxed posit, not earlier (a stronger, ungrounded posit) and not later (a claimed derivation the countermodels forbid). The value \(\hbar\) (§II.8) attaches only after this entire structural chain is in place, as the measured size of \(\Delta_0\) , never as an ingredient of any step in it.

 This is the complete derivation: four proved objects (the classical witness, T5, the basin-packing sufficiency lemma, Theorem B), two decisive countermodels that close off the stronger claim (Theorem A, and the delta-test/basin-shallowing pair), one clearly named and value-free posit (the Uniform Operational Cell Law), one clearly flagged extra hypothesis riding inside the conditional (completeness), and one atomic measured residue (ℏ) consumed only at the very end. The terminal this chain reaches is REDUCED-TO-AXIOM / ANCHORED +1 : one posit, one anchor, and a fully audited account of why the chain cannot be shortened further from below.

 Construction III - the central result at full precision

 What this section proves, in one line. Starting from nothing but a set of distinguishable records, a set of admissible tests, and outcome frequencies, this section derives — with every step shown, every constant tracked, and two independent countermodels checked against the claim at the point it would otherwise overreach — the exact reduction

 \[
\text{granularity root} \;\Longrightarrow\; \{\, \text{Uniform Operational Cell Law: } \Delta_0>0 \,\}\ \oplus\ \{\, \hbar\ \text{measured} \,\},
\]

 and nothing stronger. The chain has five load-bearing links — a reframe theorem, a pre-Hilbert metric, an extreme-value floor theorem (T5), a conditional compactness theorem (Theorem B) resting on a Finite Test-Compression law (FTC), and a sufficiency lemma (basin-packing) that produces FTC from one named posit — bracketed on both ends by decisive countermodels (Theorem A and basin-shallowing) that show exactly why the chain cannot be shortened to zero posits. Every arithmetic step below is carried out in full; nothing is asserted without the intermediate line that produces it.

 III.1 The object the theorem is about — three layers, pinned exactly

 Before any theorem can be stated precisely, the object it acts on must be pinned at all three layers, because a residual proved under a truncated object is an artifact, not a result.

 × Stage (the record interface, not the metric factors). This root sits below the frozen 13-dimensional arena \(\mathfrak{B}_{\rm active} = [\mathcal{M}_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2]_\times \oplus [\mathcal{F}^+_{\rm finite}\oplus\mathcal{C}_{\rm admiss}]_\oplus \otimes [\mathcal{E}_{\rm matter}\oplus\mathcal{E}_{\rm gauge}\oplus\mathcal{E}_{\rm Higgs}\oplus\mathcal{E}_{\rm proton}]_\otimes\) with \(K_6 = SU(3)/T^2\) the full \(A_2\) flag manifold and \(D_{\rm arena}=4+6+2+1=13\) . The granularity theorem's own × Stage is not any of those metric factors; it is the bare record interface : a set \(D\) of distinguishable records \(r,s,\dots\) , a set of admissible tests \(T\) , and outcome labels \(e\) with conditional frequencies \(P(e\mid r,T)\in[0,1]\) . This is deliberate and load-bearing — the theorem must hold with zero reference to Hilbert space, zero reference to the Riemannian data of \(K_6\) or \(S^2\) , so that its conclusion cannot be a disguised consequence of quantum structure it is trying to ground. The frozen 13D geometry is carried elsewhere in this dossier as context the arena inherits this root from, never as substrate the theorem needs.

 ⊕ Rulebook (cost currency, fixed and never swapped). The cost functional \(c:D\to\mathbb{R}_{\ge0}\) is denominated in action, or energy·time — never in bits. This is not a stylistic choice; it is load-bearing, and the reason is shown explicitly in §III.5 below (the relabel guard): denominating cost in bits trivializes the theorem into a tautology. "Distinguishable" is defined operationally, through outcome-frequency separation under admissible tests, never through Hilbert-space orthogonality — this is what breaks the surface circularity (§III.2). Boundary convention: cost attaches only to transitions between records that some admissible test can actually separate; gliding between records no test can tell apart costs nothing (Lemma L1, §III.3).

 ⊗ Actors (the operators the theorem manipulates). The cost functional \(c\) , the operational distance \(d_{\rm op}\) defined below, and — once the chain reaches the conditional branch — the finite-dimensional projection map \(\Phi_\eta: D\to[0,1]^M\) built from a finite test family. Domain of every operator here is the full record space \(D\) ; readout is always a real number (a cost, a distance, or a coordinate in \([0,1]^M\) ) — never a quantum-mechanical expectation value.

 III.2 The pre-Hilbert operational metric — definition, and why it is well-posed

 The entire chain runs on one metric, defined once and never modified:

 \[
d_{\rm op}(r,s) \;=\; \sup_{T,\,e}\; \big|\, P(e\mid r,T) - P(e\mid s,T) \,\big|,
\]

 the supremum, over every admissible test \(T\) and every outcome \(e\) of that test, of the gap between the outcome frequencies that records \(r\) and \(s\) produce. Three properties are checked directly from the definition and are used repeatedly below:

 No Hilbert structure anywhere in the statement. The definition uses only records, tests, and outcome frequencies. It matches the operational notion of distinguishability used in the operational-probabilistic-theory (GPT) literature (Hardy; Chiribella–D'Ariano–Perinotti), but Hilbert-space orthogonality is a downstream representation of \(d_{\rm op}\) , never its defining ingredient. This is the move that breaks the surface distinguishability circle — the objection "you need Hilbert space to say what 'distinguishable' means" is answered directly: no, \(d_{\rm op}\) says it without one.

 Classical witness (a concrete, checkable case). Let \(\Omega\) be any measurable space and let admissible tests be measurable functions \(f:\Omega\to[0,1]\) read as "probability of outcome \(e\) given test \(f\) ." Then \(d_{\rm op}\) reduces exactly to the classical total-variation distance between the point masses at \(r,s\in\Omega\) . For \(r\ne s\) , taking \(f\) to be an indicator function separating a neighborhood of \(r\) from \(s\) gives \(P(e\mid r,f)=1\) , \(P(e\mid s,f)=0\) , so \(d_{\rm op}(r,s)=1\) — no Hilbert structure was used to reach that number. This single worked case is the load-bearing sanity check that \(d_{\rm op}\) is not vacuous.

 What it does not close. Breaking the surface circle (you don't need Hilbert space to define distinguishability) is not the same as breaking the deeper circle — whether the cost floor itself sits at-or-below quantum mechanics in the order of logical implication. That deeper question is carried forward explicitly as an open item (Hole 3, §III.8) and is never quietly treated as settled by the surface result.

 III.3 The reframe: cost, not length — a two-line theorem, DERIVED

 Before compactness or any floor can be discussed, the object that could have a floor must be identified correctly. The naive target — a smallest length — is wrong, and the reframe that replaces it is a short, fully elementary argument.

 (L1) Infinite subdivision is harmless. A process that glides through a continuum of non-orthogonal (overlapping, operationally non-distinguishable) intermediate records is free: none of those intermediate records is a distinguishable accomplishment, by the very definition of \(d_{\rm op}\) above (only tests that actually separate records contribute to cost). Overlap costs nothing, no matter how finely it is subdivided.

 (L2) Infinite prerequisite chains of nonzero-cost steps are impossible. Only transitions to an operationally distinguishable record cost anything by convention (§III.1). An infinite chain of such transitions, each costing at least a fixed positive floor, requires infinite total resource and therefore cannot complete under any finite resource budget. Orthogonality — operational distinguishability — is the expensive commodity; overlap is free.

 Conclusion (the reframe theorem). Any process that completes under a finite resource budget has only finitely many costly (i.e., operationally distinguishable) steps. This is the exact sense in which "granularity" must be read: not a claim about the smallest interval of length or time, but a claim about the smallest interval of cost on distinguishable transitions.

 The Lorentz corollary (why this reframe pays for itself immediately). A floor on length is the standard target of discreteness proposals, and it is expensive: a preferred smallest length picks out a preferred rest frame, because lengths Lorentz-contract — an observer boosted relative to the lattice sees a different spacing, so "the" smallest length is frame-dependent unless a preferred frame is smuggled in. Cost, action, and information, by contrast, are Lorentz scalars — they do not contract under a boost. A floor on a scalar quantity therefore picks out no preferred frame . The reframe from "smallest length" to "smallest cost" is not a weaker substitute for spacetime discreteness; it is a strictly better-posed question that discharges the discreteness program's single most expensive standing objection for free, before any further theorem is proved.

 The \(\hbar>0\) reading — explicitly flagged as a reading, not a derivation. If a positive cost floor exists, then \(\hbar>0\) is the size of that floor read in the units of action — this is a reading of what the floor's value would mean physically, never a claim that the floor's magnitude is derived. What the reframe does explain is that \(\hbar>0\) must hold for realizable physics: sending \(\hbar\to0\) formally reproduces exactly the pathologies that a genuine cost floor prevents — the ultraviolet catastrophe of blackbody radiation, the infinite classical self-energy of a point charge, the classical unstable atom (an electron radiating continuously into an ever-tighter orbit) — each of these is an infinite descent through an unbounded sequence of ever-cheaper, ever-more-distinguishable states, precisely the kind of infinite chain Lemma L2 above forbids once a floor is in place. The reframe explains that a positive floor must exist for physics to be realizable; it never explains which numerical floor.

 III.4 T5 — the floor from compactness, an unconditional theorem given its hypotheses

 This is the first fully rigorous theorem in the chain, and it is completely elementary — which is precisely its virtue: it isolates the entire weight of the "does a floor exist" question onto a single well-posed mathematical hypothesis (compactness), so that hypothesis, and only it, can be attacked honestly in what follows.

 Setup. Let \(D\) be the space of distinguishable records (topologized by \(d_{\rm op}\) ), and let \(c:D\to\mathbb{R}_{\ge0}\) be the cost functional, assumed continuous in the \(d_{\rm op}\) topology, with the pointwise-positivity property that \(c(x)=0 \Rightarrow x\notin D\) (a record with zero cost is not, by definition, an operationally distinguishable accomplishment — it has been absorbed back into the "free, overlapping" class of §III.3).

 Theorem T5. If \(D\) is compact, \(c\) is continuous, and \(c(x)=0\Rightarrow x\notin D\) , then
$$
\varepsilon \;=\; \min_D c \;>\; 0.
$$

 Proof, in full. A continuous real-valued function on a compact set attains its minimum — this is the extreme value theorem (EVT), applied here to \(c\) on \(D\) . Let \(x^*\in D\) be a point where the minimum is attained, so \(c(x^*)=\min_D c\) . Since \(x^*\in D\) , the hypothesis \(c(x)=0\Rightarrow x\notin D\) applied in its contrapositive form ( \(x\in D \Rightarrow c(x)\ne 0\) ) gives \(c(x^*)\ne 0\) ; since \(c\) takes values in \(\mathbb{R}_{\ge0}\) , this forces \(c(x^*)>0\) . Setting \(\varepsilon:= c(x^*)\) gives \(\varepsilon = \min_D c > 0\) . \(\blacksquare\) 

 What this theorem does and does not do. It is unconditional given its hypotheses — no posit is smuggled into its proof, no quantum mechanics, no Bekenstein bound, nothing beyond the extreme value theorem of elementary real analysis. But it transfers the entire weight of the granularity question onto exactly one question: is \(D\) compact? Every subsequent step in this section is either an attempt to establish that compactness, or a demonstration of exactly where that attempt must stop and a posit be named.

 III.5 Reducing compactness to a Finite Test-Compression law (FTC) — the target theorem, and the relabel trap

 T3, the target statement. For a bounded causal record-support system \(R\) — meaning finite spatial extent, finite duration \(\tau\) , and a finite budget \(B\) (action, or energy \(\times\) time) — with \(R_{\rm phys}\) the admissible, stably-retrievable records under \(d_{\rm op}\) : does \(R_{\rm phys}\) compact follow, giving \(N_{\max}(R,\Delta,\tau)<\infty\) for every resolution \(\Delta>0\) ?

 The naive hope, and why it fails (Theorem A, a decisive banked countermodel). The naive hope is that finiteness of extent, duration, and budget is already enough. It is not, and this is shown by an explicit, fully worked construction, not by a general argument.

 Construction. Take a classical pointer \(x\in[0,1]\) (finite extent, at rest so it needs no energy that scales with the number of distinguishable positions — hence finite budget \(B\) trivially), with associated record \(r_x\) . Define the readout test \(T_{x,y}\) : "is the pointer near \(x\) , excluding \(y\) ?" This is an admissible test by any reasonable operational reading. Then
$$
P(e_x \mid r_x, T_{x,y}) = 1, \qquad P(e_x \mid r_y, T_{x,y}) = 0,
$$
so directly from the definition of \(d_{\rm op}\) ,
$$
d_{\rm op}(r_x, r_y) = 1 \qquad \text{for every } x \ne y \in [0,1].
$$

 Consequence. \([0,1]\) under the metric \(d_{\rm op}\) is an uncountable discrete space : every pair of distinct points is separated by the maximal distance \(1\) . Fix any resolution \(0<\Delta\le 1\) ; every pair of distinct records is \(\Delta\) -separated, so a \(\Delta\) -net would have to contain every point of \([0,1]\) — that is, \(N_{\max}=\infty\) . A space with an infinite \(\Delta\) -separated subset for arbitrarily small \(\Delta\) is, by definition, not totally bounded , and a metric space that is not totally bounded is not compact . \(\blacksquare\) 

 The verdict. Finite extent, finite duration, and finite action/energy-time budget do not , by themselves, force compactness. This is a decisive countermodel , not a heuristic worry: it is a fully constructed system inside the class T3 is trying to cover, and it violates the conclusion outright.

 The precise obstruction, stated as an implication that fails. 
$$
B < \infty \;\overset{?}{\Longrightarrow}\; \forall\,\Delta>0,\ N_{\max}(R,\Delta,\tau) < \infty
$$
is false as it stands. Finite budget does not, on its own, stop arbitrarily sharp readout tests from existing — nothing in "finite extent + finite duration + finite budget" says anything about how finely a test can resolve two records, unless a further law explicitly ties budget to resolution. That further law is exactly what T3 needs and does not yet have; its name is the Finite Test-Compression law (FTC) .

 Lemma FTC — stated precisely, as the exact target. For every bounded causal system \(R\) and every tolerance \(\eta>0\) , there exists a finite family of tests \(\mathcal T_\eta = \{(T_j,e_j)\}_{j=1}^{M(B,\eta,\tau)}\) such that
$$
d_{\rm op}(r,s) \;\le\; \max_{1\le j\le M} \big| P(e_j\mid r,T_j) - P(e_j\mid s,T_j) \big| \;+\; \eta
$$
for all \(r,s\in R_{\rm phys}\) . In words: every operational distinction that bounded causal resources can make is \(\eta\) -approximable using only finitely many bounded-resource tests. \(M\) is allowed to grow without bound as \(\eta\to0\) ; the requirement is only that it be finite at each fixed \(\eta\) . This is the pre-quantum, resource-theoretic analogue of nuclearity conditions in algebraic field theory, stated with no Hilbert space anywhere.

 The relabel guard — a trap that must be named explicitly, because it is the easy wrong fix. One might try to make T3 trivial by redefining the budget \(B\) to mean finite information capacity in bits. Under that relabeling, \(N_{\max}\le 2^B\) follows immediately and trivially. But this "fix" secretly assumes the very thing T3 is trying to establish — that the record space has a finite information capacity is a restatement of the conclusion, not a derivation of it. This is logged as a firewall guard: G5 (no relabel-via-assumed-capacity) . The budget \(B\) must be kept denominated in action or energy·time , never in bits, and this section obeys that discipline throughout. With \(B\) correctly denominated, T3 is genuinely OPEN at this point in the chain — it is not yet proved, and it is not trivially true.

 III.6 Theorem B — compactness from FTC, a valid conditional proof with every constant tracked

 Statement. If FTC holds for \(R_{\rm phys}\) , and \(R_{\rm phys}\) is closed under \(d_{\rm op}\) -Cauchy limits (a completeness hypothesis, stated separately and never folded silently into FTC), then \(R_{\rm phys}\) is compact.

 Proof, in full, with the constants tracked explicitly. 

 Step 1 — fix \(\eta>0\) and invoke FTC. By FTC there is a finite test family \(\mathcal T_\eta=\{(T_j,e_j)\}_{j=1}^M\) (with \(M=M(B,\eta,\tau)\) finite) such that \(d_{\rm op}(r,s) \le \max_j |P(e_j\mid r,T_j)-P(e_j\mid s,T_j)| + \eta\) for all \(r,s\) .

 Step 2 — build the finite-dimensional embedding. Define \(\Phi_\eta(r) = \big(P(e_1\mid r,T_1),\,\dots,\,P(e_M\mid r,T_M)\big) \in [0,1]^M\) . Each coordinate lies in \([0,1]\) by the definition of a probability, so \(\Phi_\eta\) maps \(R_{\rm phys}\) into the cube \([0,1]^M\) .

 Step 3 — cover the cube. The cube \([0,1]^M\) (with the sup-norm) is totally bounded: it can be covered by finitely many sup-norm balls of radius \(\eta\) . Concretely, subdividing each of the \(M\) axes into intervals of length \(2\eta\) gives at most \(\lceil 1/(2\eta)\rceil^M\) cells, a finite number for fixed \(\eta\) and \(M\) . Choose one representative record \(r_k\) per nonempty cell that \(\Phi_\eta(R_{\rm phys})\) actually meets, producing a finite set \(\{r_1,\dots,r_K\}\subset R_{\rm phys}\) with \(K\le \lceil 1/(2\eta)\rceil^M\) .

 Step 4 — every record is close in \(\Phi_\eta\) -coordinates to some representative. Any \(r\in R_{\rm phys}\) has \(\Phi_\eta(r)\) in some cell, whose representative is some \(r_k\) ; by construction of the cell (sup-norm radius \(\eta\) , cells of side \(2\eta\) ) this gives
$$
\max_j \big| \Phi_\eta(r) j - \Phi \eta(r_k)_j \big| \;\le\; 2\eta.
$$

 Step 5 — translate back to \(d_{\rm op}\) via FTC. Applying FTC's defining inequality to the pair \((r,r_k)\) :
$$
d_{\rm op}(r,r_k) \;\le\; \max_j\big|P(e_j\mid r,T_j)-P(e_j\mid r_k,T_j)\big| + \eta \;\le\; 2\eta + \eta \;=\; 3\eta.
$$

 Step 6 — total boundedness at every scale. Step 5 exhibits, for every \(\eta>0\) , a finite \(3\eta\) -net \(\{r_1,\dots,r_K\}\) for \(R_{\rm phys}\) under \(d_{\rm op}\) . Since \(\eta\) was arbitrary and \(3\eta\to0\) as \(\eta\to0\) , this shows \(R_{\rm phys}\) is totally bounded .

 Step 7 — completeness closes the proof. Total boundedness alone does not imply compactness in a general metric space (a totally bounded space can fail to be compact if it is not complete — e.g. the open interval \((0,1)\) with a Cauchy sequence converging to an excluded endpoint). Compactness for metric spaces is exactly totally bounded + complete . So the completeness hypothesis — \(R_{\rm phys}\) closed under \(d_{\rm op}\) -Cauchy limits — is invoked here as a genuinely separate, second assumption , and with it, \(R_{\rm phys}\) is compact. \(\blacksquare\) 

 The referee-caught hidden hole, stated plainly and never buried. The completeness hypothesis is not a technical nicety folded invisibly into "FTC holds" — it is a second, independent posit , and it belongs on the residue ledger (§III.9) exactly as visibly as the Uniform Operational Cell Law itself. A version of this proof that states "FTC \(\Rightarrow\) compact" without flagging completeness separately is stating an overclaim; this section states it correctly: FTC + completeness \(\Rightarrow\) compact , full stop, both hypotheses named.

 What Theorem B leaves outstanding. Theorem B converts the T3 target into a purely conditional statement: compactness follows if FTC holds. FTC itself is still open at this point — §III.5 showed only that finite resources alone (Theorem A) do not deliver it. The next two subsections show, respectively, how FTC can be obtained from one clean posit (§III.7) and why finite resources alone provably cannot deliver that posit's key feature — uniformity — without it (§III.8).

 III.7 Basin-packing — the sufficiency lemma that produces FTC from one posit, a sound conditional argument

 The posit, stated in full (the Uniform Operational Cell Law). There exists a single, system-independent constant \(\Delta_0>0\) such that, for every bounded causal record-support system, no two stable, independently-retrievable records are operationally closer than \(\Delta_0\) in \(d_{\rm op}\) , and no stable record occupies an operational cell smaller than \(\Delta_0\) . Equivalently: the record-keeping substrate of reality has one universal positive resolution quantum. This posit is deliberately value-free — it names \(\Delta_0\) as a positive constant and nothing more; it does not say what \(\Delta_0\) equals, and it never mentions \(\hbar\) . That is precisely what lets it pass a no-target-loading check: nothing about its statement presupposes or back-solves to the measured value of \(\hbar\) .

 The basin-packing argument (sufficiency, conditional on \(\Delta_0>0\) ), with the bound derived explicitly. Let \(\mathrm{Var}_{\rm op}(R)\le B\) denote the finite total operational variation available to a bounded causal system \(R\) (a finite budget in the action/energy-time currency fixed in §III.1). Suppose each stable, independently-retrievable record requires a "robustness basin" — an operational neighborhood in which nearby perturbations still retrieve the same record — of depth at least \(\Delta_0\) (this is exactly the content of the Uniform Operational Cell Law: no record occupies a cell smaller than \(\Delta_0\) ). Two records that are pairwise resolvable (mutually distinguishable, hence both "stable" and "robust" in the sense above) must have disjoint depth- \(\ge\Delta_0\) basins — if their basins overlapped, a perturbation inside the overlap could not decide which record it belongs to, contradicting independent retrievability.

 Packing \(N\) disjoint basins, each consuming at least \(\Delta_0\) of the total available variation \(B\) , gives immediately
$$
N\cdot\Delta_0 \;\le\; B \quad\Longrightarrow\quad N \;\le\; \left\lfloor \frac{B}{\Delta_0} \right\rfloor \;<\; \infty.
$$
This is the exact, tracked bound : the number of pairwise-resolvable stable records under budget \(B\) and uniform cell size \(\Delta_0\) cannot exceed \(\lfloor B/\Delta_0\rfloor\) . From this finite bound on record count, a finite test family sufficient to \(\eta\) -approximate \(d_{\rm op}\) can be built directly (a test per candidate basin, refined near basin boundaries), giving FTC with \(M\lesssim (B/\Delta_0)^2\) (the square arising because both the number of distinguishing tests and the resolution within each basin scale with \(N\) ).

 Why this argument is honest and not circular. It imports no Hilbert space, no Bekenstein bound, no thermodynamic bath, no temperature — the whole argument is deterministic basin geometry against a finite total-variation budget. It is explicitly conditional on the cell law \(\Delta_0>0\) — exactly the one posit named above — so it proves the count ( \(N\le\lfloor B/\Delta_0\rfloor\) ), never the grain ( \(\Delta_0\) itself, which remains posited). This is the precise sense in which the chain is "sound conditional": granted the posit, everything downstream (FTC, then via Theorem B compactness, then via T5 the floor \(\varepsilon>0\) ) follows by proof, with no further assumption.

 III.8 Why the posit must be uniform — the basin-shallowing countermodel, a second decisive banked loss

 A natural objection at this point: why insist on one universal, system-independent \(\Delta_0\) ? Would it not suffice for each system to have some positive resolution floor, possibly different from system to system? This section shows, by an explicit construction, that it would not suffice — per-system finiteness is strictly weaker than a universal uniform floor, and the gap between them is a theorem, not a matter of taste.

 Construction. Populate a single bounded landscape (one system, with \(\mathrm{Var}_{\rm op}(R)\le B\) as before) with a countably infinite family of disjoint stable basins, indexed \(n=1,2,3,\dots\) , with depths
$$
d_n \;=\; B\cdot 2^{-n-1}.
$$

 Step 1 — check the total resource is respected. Summing the geometric series,
$$
\sum_{n=1}^{\infty} d_n \;=\; B\sum_{n=1}^\infty 2^{-n-1} \;=\; B\cdot\frac{1}{2} \;=\; \frac{B}{2} \;<\; B.
$$
The full infinite family of basins fits inside the finite budget \(B\) with room to spare — finite total resource is fully respected; nothing here cheats the budget constraint.

 Step 2 — check the depths shrink to zero. By inspection, \(d_n = B\cdot 2^{-n-1}\to 0\) as \(n\to\infty\) , so
$$
\inf_n d_n \;=\; 0.
$$
There is no smallest basin in this family, and therefore no uniform \(\Delta_0>0\) below which every basin's depth is bounded.

 Step 3 — the two faces split apart, exactly as claimed. For any fixed tolerance \(\eta>0\) , only finitely many basins have depth \(d_n\ge\eta\) (since \(d_n\to0\) , and \(\sum d_n<\infty\) forces only finitely many terms above any fixed threshold). This means the \(\eta\) -dependent, per-system face survives : for each fixed \(\eta\) , a finite \(\eta\) -net still exists (basin-packing at that \(\eta\) goes through), so total boundedness at that fixed scale is not violated by this construction. But the finiteness face — a single discrete milestone count valid uniformly across all scales, and in particular the exact \(\hbar\) -graining correspondence \(N\approx V/\hbar^n\) that requires one universal cell size — genuinely fails : the total count of stable records in this landscape is infinite (countably many basins, all occupied), and there is no smallest record cell. The continuum pointer of Theorem A (§III.5) is effectively re-derived, one level down, at the level of basin depths rather than raw positions.

 The verdict. Finite causal support, finite duration, finite action/energy-time budget, and a continuous (as opposed to gapped) stability landscape do not together imply a uniform positive \(\Delta_0\) . This is the second decisive, fully worked countermodel in the chain — a genuine theorem (a valid counterexample under the stated premises), not a plausibility argument. It is what makes the Uniform Operational Cell Law an honest, named posit rather than a restatement of something finite resources already hand you: finite resources hand you per-system total boundedness (§III.7's basin-packing shows that much is sufficient, given the law); they do not hand you the uniformity of the resolution scale across all systems.

 The both-ends meeting point. Running the argument from both directions pins down exactly what must be posited and nothing more. Backward: a system-independent \(\Delta_0\) cannot be set by any per-system resource bound, because basin-shallowing exhibits per-system finiteness fully compatible with \(\inf_n d_n=0\) ; it must therefore be one universal constant attached to the record-keeping substrate itself, not to any one system's budget. Forward: finite resources on their own give only per-system total boundedness (Theorem A already showed even that much requires more than raw finiteness). The two directions meet at exactly one place: there is one universal action/resolution quantum shared by all record systems — which is precisely the content of " \(\hbar\) exists as structure," i.e. the Uniform Operational Cell Law. This meeting point is the structural signature of a genuinely irreducible root: both the top-down and bottom-up attacks converge on the same single missing ingredient, and neither attack can dispense with it.

 III.9 The full chain assembled, with status tags carried at every link

 \[
\underbrace{\text{record interface } (D,\,\text{tests},\,d_{\rm op})}_{\S\text{III.2, well-posed}}
\ \xrightarrow{\text{L1+L2 reframe}}_{\S\text{III.3, DERIVED}}
\ \underbrace{\text{cost floor, not length floor}}_{}
\]

 \[
\underbrace{\Delta_0>0}_{\text{§III.7, POSITED (the one axiom)}}
\ \xRightarrow{\text{basin-packing}}_{\S\text{III.7, SOUND CONDITIONAL}}
\ \underbrace{\text{FTC}}_{}
\ \xRightarrow[+\ \text{completeness (2nd posit, §III.6)}]{\text{Theorem B}}_{\S\text{III.6, VALID PROOF (conditional)}}
\ \underbrace{R_{\rm phys}\ \text{compact}}_{}
\ \xRightarrow{\text{T5 (EVT)}}_{\S\text{III.4, DERIVED (unconditional given hyp.)}}
\ \underbrace{\varepsilon=\min_D c>0}_{}
\]

 with the two decisive countermodels sitting exactly at the two junctures that would otherwise have been claimed for free:

 Theorem A (§III.5, delta-test on \([0,1]\) , \(d_{\rm op}\equiv1\) off-diagonal) blocks the shortcut "finite resources \(\Rightarrow\) FTC directly" — this is why FTC needed the posit at all.

 Basin-shallowing (§III.8, \(d_n=B\cdot2^{-n-1}\) , \(\sum d_n=B/2<B\) , \(\inf d_n=0\) ) blocks the shortcut "per-system finiteness \(\Rightarrow\) uniform \(\Delta_0\) " — this is why the posit had to be stated as uniform , not merely as available .

 The exact banked-core table, every entry checked against its derivation above: 

 Result 
 Statement 
 Status 

 T5 
 \(D\) compact + \(c\) continuous + ( \(c(x)=0\Rightarrow x\notin D\) ) \(\Rightarrow\) \(\varepsilon=\min_D c>0\) 
 PROVED (EVT + pointwise positivity), §III.4 

 Theorem B 
 FTC + completeness \(\Rightarrow\) \(R_{\rm phys}\) compact; finite \(3\eta\) -net via cube-cover, \(d_{\rm op}\le3\eta\) 
 VALID PROOF (conditional), §III.6 

 Basin-packing 
 cell law \(\Delta_0>0\) \(\Rightarrow\) \(N\le\lfloor B/\Delta_0\rfloor<\infty\) \(\Rightarrow\) FTC, \(M\lesssim(B/\Delta_0)^2\) 
 SOUND CONDITIONAL (no QM/Bekenstein/thermal import), §III.7 

 Theorem A (loss) 
 finite extent+ \(\tau\) +action/energy-time \(\not\Rightarrow\) FTC; delta-test \(\mathbb 1[r=x]\) on \([0,1]\) \(\Rightarrow\) \(d_{\rm op}=1\) for all distinct pairs 
 DECISIVE COUNTERMODEL, §III.5 

 Basin-shallowing (loss) 
 finite resources \(\not\Rightarrow\) uniform \(\Delta_0\) ; \(d_n=B\cdot2^{-n-1}\) , \(\sum=B/2<B\) , \(\inf=0\) 
 DECISIVE COUNTERMODEL, §III.8 

 Pre-Hilbert metric 
 $d_{\rm op}=\sup_{T,e} 
 P(e 

 Reduction to one posit 
 granularity \(\Rightarrow\) Uniform Operational Cell Law ( \(\Delta_0>0\) ); \(\hbar\) = residue 
 AXIOM-CLOSED (named, not proved), §III.7 

 The residue ledger — carried forward explicitly, never silently dropped. Two, and only two, further quantities enter this root without derivation: \(\hbar\) (the measured action spacing — the size of the floor, entering purely as a value, \(\hbar\approx1.0546\times10^{-34}\) J·s, and passing the no-target-loading test because the Uniform Operational Cell Law is fully writable, as done in §III.7, without ever mentioning \(\hbar\) ); and the completeness (Cauchy-closure) hypothesis of Theorem B (§III.6), a second, genuinely separate posit about \(R_{\rm phys}\) that must never be silently folded inside "FTC holds." Alongside these, the broader residue ledger this root contributes to (carried, never eliminated) is \(\{\hbar,\ k_B,\ \text{the Bekenstein constant},\ \Delta_0,\ \text{completeness}\}\) — the reframe from a bare cost floor \(\varepsilon\) to a resolution floor \(\Delta_0\) plus compactness is a better-motivated relocation of a constant, not the removal of one ; this document does not claim otherwise anywhere.

 Cross-check against the three independent, established results this chain deliberately does not re-derive. The floor's existence, from a completely different direction (inside quantum mechanics, not derived from below it), is independently confirmed by three mutually independent results the field already has: Margolus–Levitin ( \(\tau\ge\pi\hbar/(2E)\) , hence at most \(N_\perp\le 2ET/(\pi\hbar)\) orthogonal transitions in time \(T\) at mean energy \(E\) above ground — a statement in the action currency), Landauer ( \(\Delta E\ge k_BT\ln2\) to erase one bit — a statement in the energy/information currency), and Bekenstein ( \(S\le 2\pi k_B RE/(\hbar c)\) nats in a region of radius \(R\) , energy \(E\) — a statement in the information/region currency). These three sit in three independent currencies, so the existence of a floor is not resting on any single one of them. But — and this is exactly why they are cross-checks and not substitutes for the derivation above — all three are theorems inside quantum mechanics: Margolus–Levitin and Landauer both presuppose a Hilbert space and Hilbert-space orthogonal distinguishability, and Bekenstein's bound carries \(\hbar\) explicitly in its constant. None of the three derives granularity from below ; each confirms it from inside the very framework the derivation chain above is trying not to presuppose. That is the precise, checked sense in which the chain in §III.2–III.8 is doing something those three established results do not do — building the floor from a record interface with no Hilbert space anywhere — while remaining fully consistent with all three as downstream confirmations.

 III.10 Pontryagin relocation — the one tempting shortcut, checked and rejected as a route to zero posits

 One further route deserves to be checked explicitly, because it is the most tempting way to claim "zero posits" and must be shown, not just asserted, to fail. If the action spectrum is identified with a discrete, equally-spaced spectrum generated by a phase on a closed circle, then a Pontryagin-type duality relates existence-and-discreteness of that spectral grain to compactness of the underlying phase space — an "iff." Taken naively, this looks like it might let one derive uniform discreteness from a topological fact (compactness of a circle) rather than posit it.

 Checked carefully, this relocates the posit; it does not eliminate it. The duality trades "the grain is uniform and discrete" for "the generating phase lives on a compact space" — but establishing that the physical phase in question is compact, rather than merely modeling it as living on a compact space by fiat, requires exactly the kind of structure (a bounded, unitary generator) that is itself downstream of quantum mechanics. Deriving that compactness from unitarity is circular : it would make granularity downstream of quantum mechanics, which is precisely the circle the whole chain in §III.2–III.9 was built to break (recall §III.2's point 3: breaking the surface circle around distinguishability is not the same as breaking the deeper circle around whether QM secretly grounds the floor). Hence the gate-specific granularity posit count, checked against this shortcut, is confirmed at exactly one — the Uniform Operational Cell Law — never zero.

 III.11 What the central result licenses, stated with the same precision as the theorems above

 Putting §III.4–III.10 together, the terminal this root has reached is exactly, and only:

 \[
\boxed{\ \text{granularity root} \;=\; \{\Delta_0>0,\ \text{Uniform Operational Cell Law, one named value-free posit}\} \ \oplus\ \{\hbar,\ \text{one measured atomic anchor}\}\ }
\]

 with every arrow in between — T5, Theorem B, basin-packing — a proved theorem (unconditional or conditional as tagged), and both junctures where a stronger claim might have been smuggled in (finite resources alone \(\Rightarrow\) FTC; per-system finiteness \(\Rightarrow\) uniform \(\Delta_0\) ) blocked by a fully worked, decisive countermodel rather than left as an unexamined gap. This is the exact content of the fixed grade REDUCED-TO-AXIOM / ANCHORED +1 : not zero posits (blocked by §III.5, §III.8, and §III.10, three independent checks), not a bare unexamined assumption (the posit was earned by ruling out its two most natural derivations first), and not a claim beyond structure (the value of \(\hbar\) is never touched by any theorem in this chain — it enters exactly once, as a measured number, in §III.9's residue ledger). PROMOTIONS: 0.

 The insights that made it work

 Six moves carry the entire reduction. None of them is a computation in the ordinary sense — there is no integral evaluated, no eigenvalue solved, no coupling run. Every one of them is a piece of reasoning that relocates the problem to a place where it becomes tractable, or that shows definitively that a tempting shortcut does not exist. That is what makes REDUCED-TO-AXIOM the honest terminal here rather than a resting point on the way to something better: the insights below do not merely fail to find a derivation, they show why no derivation from the stated premises can exist, and then they isolate the smallest possible replacement. Each is stated below with the reasoning spelled out, not just the conclusion, because the reasoning is what a working physicist needs in order to trust — and to attack — the result.

 Insight 1 — Reframe the question from length to cost (dissolving the Lorentz objection for free)

 The oldest and most expensive objection to any claim of physical discreteness is the Lorentz argument: a smallest length picks out a preferred rest frame, because length contracts under boosts and a lattice spacing that is fixed in one frame is not fixed in another. Every discretization program that starts from "spacetime has a smallest length" inherits this bill and has to pay it with extra structure (deformed dispersion relations, a preferred foliation, doubly-special relativity, and so on).

 The insight that dissolves this for free is to notice that the granularity claim never needed to be about length at all. What it needs is a floor on cost — on the resource required to execute a distinguishable transition, measured in action or in energy·time. Action, energy·time, and information are Lorentz scalars : they do not transform under a boost the way a spatial interval does. A floor on a scalar quantity is frame-independent by construction, because "the minimum value of a scalar" is itself a scalar statement. This is not a new symmetry argument bolted onto the framework after the fact — it is a direct consequence of choosing the right register to state the claim in. Once the two-line lemma is in place —

 (L1) gliding through a continuum of non-orthogonal (overlapping) records costs nothing, because no such glide constitutes a distinguishable accomplishment;

 (L2) an infinite chain of orthogonal (distinguishable) transitions, each costing at least a fixed positive floor, cannot be completed with finite total resource —

 the conclusion "any completable process has only finitely many costly (distinguishable) steps" follows without ever mentioning a spatial lattice. Sending this statement to its natural home (action, not length) is the single reframing insight that lets the entire rest of the derivation proceed without ever having to defend a preferred frame. It is why the dossier can say, plainly, that G3 (spacetime discreteness / a smallest length) is explicitly not claimed — not as a retreat, but because the stronger, cheaper, frame-independent claim was the right target all along.

 Insight 2 — Break the surface distinguishability circle with a pre-Hilbert operational metric

 The second insight addresses a circularity that is easy to miss and fatal if missed: almost every existing treatment of "distinguishable states cost something" (Margolus–Levitin, Landauer as usually stated, Bekenstein) defines distinguishability through Hilbert-space orthogonality. But orthogonality is a quantum-mechanical notion. If the argument for a cost floor secretly needs Hilbert space to say what a distinguishable transition even is, then the whole program is downstream of quantum mechanics rather than underneath it — the floor would be a theorem of QM, not a root QM sits on top of.

 The fix is to define distinguishability using nothing but records, admissible tests, and outcome frequencies:
$$
d_{\rm op}(r,s) = \sup_{T,e}\;\big|P(e\mid r,T) - P(e\mid s,T)\big|,
$$
the supremum, over all admissible tests \(T\) and outcomes \(e\) , of the gap between the outcome frequencies the two records produce. Nothing in this definition presupposes a vector space, an inner product, a trace, or a Born rule. The classical witness makes the point concrete and checkable: let \(\Omega\) be an ordinary measurable space and let the admissible tests be measurable functions \(f:\Omega\to[0,1]\) ; then \(d_{\rm op}\) reduces exactly to the classical total-variation distance, and for two distinct points \(r\ne s\) an indicator test \(f=\mathbb{1}_{\{r\}}\) gives \(d_{\rm op}(r,s)=1\) with no Hilbert structure anywhere in sight. This is the load-bearing reason the granularity root can be stated as sitting below the frozen 13-dimensional arena \(\mathfrak{B}_{\rm active}=[\mathcal{M}_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2]_\times\oplus[\mathcal{F}^+_{\rm finite}\oplus\mathcal{C}_{\rm admiss}]_\oplus\otimes[\mathcal{E}_{\rm matter}\oplus\mathcal{E}_{\rm gauge}\oplus\mathcal{E}_{\rm Higgs}\oplus\mathcal{E}_{\rm proton}]_\otimes\) rather than as one more consequence of it: the × Stage for this root is not \(K_6=SU(3)/T^2\) or any metric factor of the 13D arena, it is the bare record-test-outcome triple, and that triple is definable without ever invoking the Hilbert-space machinery the arena's \(\otimes\) Actors (spin- \(\mathbb{C}\) bundles, connections, endomorphisms) eventually build on. The insight is precise about which circle it breaks and which it does not: it breaks the surface circle (you no longer need to say "orthogonal" to state the metric). It does not — and does not claim to — break the deeper circle, namely whether the cost floor can be shown to sit at-or-below QM in the implication order without ever importing a QM fact as a hidden premise. That deeper question is exactly Hole 3, left honestly open.

 Insight 3 — Compactness is the entire ballgame, and EVT hands you the floor for free once you have it (T5)

 The third insight is a reduction of the whole problem to a single topological property. Let \(D\) be the space of distinguishable records and \(c:D\to\mathbb{R}_{\ge0}\) a cost function that is continuous and strictly positive on \(D\) (records that cost nothing are not counted as distinguishable — \(c(x)=0\Rightarrow x\notin D\) ). Then:
$$
\textbf{T5:}\quad \big(D\ \text{compact},\ c\ \text{continuous},\ c(x)=0\Rightarrow x\notin D\big)\ \Longrightarrow\ \varepsilon = \min_D c > 0.
$$
The proof is the extreme value theorem plus one line: a continuous real-valued function on a compact set attains its minimum at some \(x^*\in D\) ; by hypothesis \(c(x^*)>0\) ; set \(\varepsilon=c(x^*)\) . That is the entire argument, and it is airtight given its hypotheses — there is no gap, no approximation, no asymptotic. The insight is not the proof itself, which is a textbook fact; the insight is recognizing that this is the right lever . It means the open physics question "does a cost floor exist?" is not a physics question at all once compactness is granted — it becomes a one-line corollary of general topology. This is what lets the entire subsequent argument be organized as a single question: is \(D\) (equivalently \(R_{\rm phys}\) , the space of stably-retrievable records) compact? Every other move in the chain is either an attempt to secure that compactness or a demonstration that a particular route to it fails. Recognizing that the entire physical content of "a floor exists" reduces to one topological hypothesis is the insight that turns a vague foundational worry into a sharp, attackable mathematical target — and it is also what makes the eventual honest verdict ("compactness needs one more posit") land as a precise, minimal admission rather than a vague shrug.

 Insight 4 — MDL logic made rigorous: finite test-compression (FTC) is compactness in operational language, and the finite \(3\eta\) -net is the constructive bridge

 Compactness is an abstract property; physicists want to know what it means operationally. The fourth insight is the translation: compactness of the record space, under the operational metric \(d_{\rm op}\) , is exactly the statement that every operational distinction achievable with bounded resources can be approximated to arbitrary accuracy by a finite description . This is the minimum-description-length idea made precise and non-circular. Concretely, the Finite Test-Compression law (FTC) says: for every bounded causal record-support system \(R\) and every tolerance \(\eta>0\) there is a finite family of tests \(\mathcal{T}_\eta=\{(T_j,e_j)\}_{j=1}^{M(B,\eta,\tau)}\) such that
$$
d_{\rm op}(r,s) \le \max_{1\le j\le M}\big|P(e_j\mid r,T_j)-P(e_j\mid s,T_j)\big| + \eta
$$
for all \(r,s\) — i.e., any two records that look the same on this one finite panel of tests are within \(\eta\) operationally, however large \(M\) needs to be as \(\eta\to0\) . The constructive payoff (Theorem B) is where the insight becomes a proof: fix \(\eta\) , take the finite panel \(\mathcal{T}_\eta\) , map each record to its vector of outcome frequencies \(\Phi_\eta(r)=(P(e_j\mid r,T_j))_{j=1}^M\in[0,1]^M\) , and cover that (automatically totally bounded) cube by sup-norm cells of radius \(\eta\) . Pick one representative record per nonempty cell — finitely many, \(\{r_1,\dots,r_K\}\) . Any record \(r\) shares a cell with some \(r_k\) , so \(\max_j|\Phi_\eta(r)_j-\Phi_\eta(r_k)_j|\le 2\eta\) , and FTC then gives \(d_{\rm op}(r,r_k)\le 3\eta\) — a finite \(3\eta\) -net, for every \(\eta\) . Total boundedness for every \(\eta\) , plus one further hypothesis that the space is closed under \(d_{\rm op}\) -Cauchy limits (completeness), is exactly the textbook definition of compactness. This is the bridge that turns "finitely many tests suffice to any accuracy" into "the record space is compact," and via Insight 3 into "a cost floor exists." The insight is recognizing that FTC — not compactness in the abstract — is the operationally meaningful and independently testable hypothesis, and that a completely explicit, constant-tracked net construction ( \(d_{\rm op}\le 3\eta\) , no hidden slack) is what makes Theorem B a real proof rather than a plausibility argument. The one place this insight is scrupulously honest about its own limits: completeness (Cauchy-closure of \(R_{\rm phys}\) ) is a second, separate posit , not delivered by FTC, and the dossier tracks it explicitly on the residue ledger rather than letting it hide inside "compactness follows."

 Insight 5 — Run the attack for real: two decisive countermodels show finite resources alone cannot buy FTC or uniformity (the honest no-go)

 The fifth insight is the one that gives the whole reduction its credibility, and it is a negative result obtained by genuinely trying to prove the positive one. The naive hope is that FTC — hence compactness, hence the floor — simply falls out of "the system has finite spatial extent, finite duration, and a finite action/energy·time budget." This hope is tested directly, not waved away, and it fails in two independent, fully worked ways.

 Theorem A (the delta-test countermodel). Take a classical pointer on \([0,1]\) , one record \(r_x\) per position \(x\) , finite extent, finite duration \(\tau\) , and finite energy·time budget \(B\) (a pointer at rest costs nothing extra as the number of positions grows — nothing in "finite resource" forces a cost to scale with resolution). Now allow the readout test " \(T_{x,y}\) : is the pointer near \(x\) , excluding \(y\) ?" This test gives \(P(e_x\mid r_x,T)=1\) and \(P(e_x\mid r_y,T)=0\) , so \(d_{\rm op}(r_x,r_y)=1\) for every pair of distinct positions. Under \(d_{\rm op}\) , \([0,1]\) becomes an uncountable discrete space : every pair of points is a full unit apart, so for any \(\Delta\le1\) every pair is \(\Delta\) -separated, \(N_{\max}=\infty\) , the space is not totally bounded, and it is not compact. Finite extent, finite duration, finite budget — and yet no finite test-compression, because nothing in those finite quantities stops an experimenter from building arbitrarily sharp readout tests. The countermodel is not contrived to be exotic; it is the most ordinary classical measuring device imaginable, which is exactly what makes it decisive.

 The basin-shallowing countermodel (uniformity, not just finiteness). A subtler hope survives Theorem A: maybe the floor doesn't need to be uniform — maybe each system just needs some per-system resolution scale, possibly different from system to system, and that would be enough. This hope is tested too, and it also fails, by direct construction. Populate a landscape with total operational variation bounded by \(B\) ( \(\mathrm{Var}_{\rm op}(R)\le B\) ) with disjoint stable basins of depths \(d_n = B\cdot2^{-n-1}\) for \(n=1,2,3,\dots\) . Then \(\sum_n d_n = B/2 < B\) — the total resource is respected, nothing here is infinite — yet \(\inf_n d_n = 0\) : there is no smallest basin. Consequence, worked through precisely: for any fixed tolerance \(\eta>0\) , only finitely many basins have depth \(\ge\eta\) (since \(\sum d_n<\infty\) ), so the \(\eta\) -dependent, per-tolerance face of total boundedness survives — finite resources really do buy you a finite \(\eta\) -net for each fixed \(\eta\) . But the count of all stable records is infinite, and there is no smallest operational cell anywhere in the landscape — the continuum pointer re-appears, this time hiding at the level of basin depths rather than raw positions.

 The insight embedded in running both of these is a methodological one as much as a mathematical one: a negative result, obtained by genuinely trying the positive claim and reporting the loss, is worth more to a foundational reduction than an unexamined assumption would be. It converts "we assumed uniformity" into "uniformity is exactly, and provably, the content that per-system finite resources cannot supply — here is the object that has finite resource and infinite record-count-with-no-floor to prove it." That is what an earned no-go looks like, and it is why REDUCED-TO-AXIOM is the honest terminal rather than a placeholder for a derivation nobody has found yet: the countermodels show the derivation cannot exist under the stated premises, not merely that it has not yet been located.

 Insight 6 — Name the posit at its true minimal size, and show sufficiency (basin-packing) cleanly, without smuggling in QM, Bekenstein, or thermodynamics

 Having shown that FTC is not free, the sixth insight is choosing exactly what to add — no more, no less. The Uniform Operational Cell Law states: there exists a single, system-independent constant \(\Delta_0>0\) such that for every bounded causal record-support system, no two stable independently-retrievable records are operationally closer than \(\Delta_0\) , and no stable record occupies an operational cell smaller than \(\Delta_0\) . Two features of this statement are the actual insight, not the bare existence claim. First, it mentions no Hilbert space, no Born rule, no thermal bath, and no value of \(\hbar\) — it is a purely structural, value-free statement, which is exactly what lets it pass the no-target-loading test (nothing in its statement anticipates or requires knowing what \(\hbar\) equals). Second, once posited, it is sufficient by an elementary and completely QM-free argument: if the total operational variation obeys \(\mathrm{Var}_{\rm op}(R)\le B\) and every stable record needs a robustness basin of depth at least \(\Delta\) , then pairwise-resolvable records occupy disjoint depth- \(\ge\Delta\) basins, so
$$
N\cdot\Delta \le B \quad\Longrightarrow\quad N \le \lfloor B/\Delta\rfloor < \infty,
$$
and FTC follows with the test-family size bounded by \(M\lesssim(B/\Delta)^2\) . This basin-packing argument imports nothing from quantum mechanics, nothing from the Bekenstein bound, nothing from thermodynamics — it is bookkeeping on disjoint sets of bounded total measure, the same logic as packing disjoint intervals of length \(\ge\Delta\) into a segment of length \(B\) . That is what makes the conditional sound rather than merely plausible: the posit does the one piece of work that has to be done (grounding the grain ), and the packing argument does the rest of the work (grounding the count ) without reintroducing any of the quantum structure the program is trying to sit underneath. The insight, stated plainly, is that a foundational reduction should be graded not by how clever the derivation is but by how small and how honestly-isolated the remaining posit is — and \(\Delta_0>0\) , stated exactly this way, is close to the smallest statement that could possibly do the job, given that Insight 5 has already shown nothing weaker will.

 A closely related discipline move belongs here too, because it is part of why the posit count stays honest at one rather than drifting to zero. A Pontryagin-type duality is available: identify the generating phase of the action spectrum with a point on a closed circle, and existence-plus-discreteness of an equally-spaced spectrum becomes logically equivalent ("iff") to compactness of that circle. This is a genuine mathematical fact and a tempting one, because it makes granularity look like it "comes for free" from compactness of something else. The insight is catching exactly why this does not eliminate the posit: it relocates the uniformity requirement onto the compactness of the phase, and if that phase-compactness were then derived from unitarity (a natural next move), the argument would be circular — unitarity is a Hilbert-space, hence quantum-mechanical, fact, and using it to derive granularity would put granularity downstream of QM, precisely the circle Insight 2 worked to break. Recognizing a relocation for what it is, rather than mistaking it for an elimination, is what keeps the posit count pinned at exactly one.

 Why these six insights, taken together, add up to REDUCED-TO-AXIOM rather than to a derivation or to an unexamined assumption

 Stack the six moves and the shape of the whole argument becomes visible. Insight 1 puts the claim in the currency (cost, a Lorentz scalar) where it can be stated without extra baggage. Insight 2 states that claim's metric ( \(d_{\rm op}\) ) without presupposing the very structure (Hilbert orthogonality) that the claim is supposed to sit underneath. Insight 3 shows that, given one topological property (compactness), the physical conclusion (a positive floor) is not an assumption at all but a theorem (T5, via the extreme value theorem). Insight 4 translates that topological property into an operational, testable statement (FTC) and proves the translation goes through explicitly and with tracked constants (Theorem B, the \(3\eta\) -net). Insight 5 is the honest attack: it shows, by two independent, fully worked countermodels rather than by assertion, that the operational statement (FTC) — and even the weaker per-system version of it — cannot be bought with finite resources alone. Insight 6 then names the precisely minimal replacement (the Uniform Operational Cell Law) and shows it is sufficient by a clean, non-circular packing argument, while a discipline check (the Pontryagin relocation) confirms that no available reformulation quietly removes the posit rather than moving it around.

 The result of stacking these is a chain with exactly one weak link, and the weak link is identified, isolated, and shown to be as small as it can possibly be: \(\Delta_0>0\) , a value-free structural posit, sitting beside exactly one measured, atomic residue ( \(\hbar\) , which enters only as the size of the floor the posit guarantees exists, never as an ingredient in deriving that a floor exists at all). That is why the grade is REDUCED-TO-AXIOM / ANCHORED +1 and not DERIVED — a derivation would require deriving the posit itself, and Insight 5 shows precisely why that cannot be done from the stated, weaker premises — and it is also why the grade is not merely "we assumed granularity" — insights 1 through 5 did the work of ruling out every weaker alternative first. The two live holes that could still move this grade (Hole 1: derive FTC from strictly weaker primitives without importing Hilbert orthogonality, Landauer's \(k_BT\ln2\) , or the Bekenstein bound as inputs; Hole 3: certify the co-fundamentality ordering of the floor against QM directly) are exactly the reconstruction-theorem project that Insight 2's pre-Hilbert metric was built to support — closing either is honestly rated at roughly 15–20% odds of flipping the derivation arrow on some future framework, and closing either is the single largest possible move remaining on this root. Until then, the six insights above are what make the current terminal not just correct but reproducible : a specialist reading only this reasoning, with no other file, can re-run T5, re-run Theorem B's net construction, re-derive the delta-test and basin-shallowing countermodels from scratch, and re-check that basin-packing never imports a quantum, thermal, or holographic fact — and will arrive at the same one posit, the same one measured residue, and the same fixed grade.

 Evidence & reproducibility

 How to read this section. Everything below is written so that a working physicist can sit down with nothing but this document, re-derive every claimed result, re-run every countermodel, and check every number against the source it is quoted from. Three things are kept rigorously separate throughout, because collapsing them is the overclaim this root refuses: (1) numbers that are proved on this root (T5, Theorem B, basin-packing — genuine theorems or sound conditionals), (2) numbers that are measured anchors consumed, not derived (ℏ, and the four frozen headline constants \(\{M_{\rm Pl},\alpha_i(M_Z),y_t,|V_{us}|\}\) carried as context), and (3) numbers that are cross-gate falsifier tests run against this root's machinery for internal-consistency purposes only (the vacuum-energy magnitude check, the mass-gap inequality). None of the third category is a closure test of granularity itself; they are recorded here because a reader auditing "does this root actually connect to anything falsifiable" deserves the full connective tissue, honestly labeled.

 1. The re-derivation path from scratch — a step-by-step reproduction recipe

 A reader wanting to check this root's status independently should walk exactly this path; each step names its inputs, its output, and its status tag so nothing is silently assumed along the way.

 Step 0 — fix the object. Work in the record interface: a set \(D\) of distinguishable records, a family of admissible tests \(T\) with outcomes \(e\) , and outcome frequencies \(P(e\mid r,T)\in[0,1]\) for \(r\in D\) . This is the × Stage for this root (deliberately not the metric factors of the 13-dimensional arena \(\mathfrak{B}_{\rm active}=[M_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2]_\times \oplus [\mathcal{F}^+_{\rm finite}\oplus\mathcal{C}_{\rm admiss}]_\oplus \otimes [\mathcal{E}_{\rm matter}\oplus\mathcal{E}_{\rm gauge}\oplus\mathcal{E}_{\rm Higgs}\oplus\mathcal{E}_{\rm proton}]_\otimes\) , \(K_6=SU(3)/T^2\) , \(D_{\rm arena}=4+6+2+1=13\) ). The ⊕ Rulebook fixes the cost currency as \(B=\) action or energy·time — never bits (Step 5 explains why this choice is load-bearing) — and fixes that "cost" attaches only to transitions between operationally distinguishable records, never to overlapping ones. The ⊗ Actors are the cost functional \(c:D\to\mathbb{R}_{\ge0}\) and the operational metric
$$ d_{\rm op}(r,s) = \sup_{T,e}\big|P(e\mid r,T)-P(e\mid s,T)\big|. $$
Reproduction check: verify this definition uses only records, tests, and outcome frequencies — no inner product, no Hilbert space, no Born rule appears anywhere in its statement. This is the well-posedness claim, and it is checkable by inspection of the formula itself.

 Step 1 — reproduce the classical witness. Take \(\Omega\) any measurable space and tests = measurable functions \(f:\Omega\to[0,1]\) . Confirm \(d_{\rm op}\) reduces exactly to the classical total-variation distance on \(\Omega\) . Then take two distinct points \(r\ne s\in\Omega\) and the indicator test \(f=\mathbb{1}_{\{r\}}\) : \(P(e\mid r,T)=1\) , \(P(e\mid s,T)=0\) , so \(d_{\rm op}(r,s)=1\) . This reproduces the claim " \(d_{\rm op}=1\) for distinct classical records with no Hilbert structure invoked" — a one-line check, and the first load-bearing number in the chain: \(d_{\rm op}=1\) .

 Step 2 — reproduce T5 (the floor from compactness). Statement: if \(D\) is compact, \(c:D\to\mathbb{R}_{\ge0}\) is continuous, and \(c(x)=0\Rightarrow x\notin D\) (i.e. \(c\) is strictly positive on all of \(D\) ), then \(\varepsilon=\min_D c>0\) . Proof to check by hand: a continuous real-valued function on a compact set attains its minimum (extreme value theorem — standard, textbook); call the minimizer \(x^*\in D\) ; by hypothesis \(c(x^*)>0\) ; set \(\varepsilon=c(x^*)\) . This is a two-line proof and a reader can verify it contains no hidden step: it uses only EVT and the pointwise-positivity hypothesis. Status: PROVED , unconditional given the hypotheses. What it does not do is establish that \(D\) is compact — that is deferred entirely to Step 3–4.

 Step 3 — reproduce the negative result that finite resources alone do not give compactness (Theorem A, banked loss). Take the classical pointer \(x\in[0,1]\) , records \(r_x\) . The system has finite extent, finite duration \(\tau\) , and finite energy-time budget \(B\) — a stationary pointer needs no energy that scales with the number of candidate positions, so all three causal-resource bounds are satisfied trivially. Define the readout test \(T_{x,y}\) = "is the pointer near \(x\) , excluding \(y\) ," so that \(P(e_x\mid r_x,T)=1\) and \(P(e_x\mid r_y,T)=0\) for \(y\ne x\) . Then \(d_{\rm op}(r_x,r_y)=1\) for every pair \(x\ne y\) . Reproduction check: this makes \([0,1]\) under \(d_{\rm op}\) an uncountable discrete space — for any \(0<\Delta\le1\) , every pair of points is \(\Delta\) -separated, so no finite \(\Delta\) -net exists, \(N_{\max}=\infty\) , the space is not totally bounded, hence not compact . This is a fully explicit, checkable countermodel: finite causal resources (extent, duration, action/energy-time) are exhibited as compatible with a non-compact record space. Status: DECISIVE COUNTERMODEL , ruling out the naive claim "finite resources \(\Rightarrow\) compactness" outright.

 Step 4 — reproduce the sharpened obstruction and name the relabel trap. The precise unresolved implication is
$$ B<\infty \;\overset{?}{\Longrightarrow}\; \forall\,\Delta>0,\ N_{\max}(R,\Delta,\tau)<\infty, $$
and Step 3 shows the implication fails as stated. A reader should check the "easy fix" and see why it is barred: redefining \(B\) as a finite information capacity in bits gives \(N_{\max}\le 2^B\) trivially — but this is a relabel failure , because assuming a finite bit-capacity is assuming finite record capacity, which is the conclusion being sought. Confirm for yourself that with \(B\) kept as action or energy·time (the ⊕ Rulebook choice fixed in Step 0), no such shortcut is available; this is exactly why the currency choice is load-bearing and not a bookkeeping convenience.

 Step 5 — reproduce the finite-test-compression (FTC) definition and Theorem B (conditional compactness). FTC states: for every bounded causal record-support system \(R\) and every tolerance \(\eta>0\) , there is a finite test family \(\mathcal{T}_\eta=\{(T_j,e_j)\}_{j=1}^{M(B,\eta,\tau)}\) such that
$$ d_{\rm op}(r,s) \le \max_{1\le j\le M}\big|P(e_j\mid r,T_j)-P(e_j\mid s,T_j)\big| + \eta. $$
Theorem B: if FTC holds and \(R_{\rm phys}\) (the admissible stably-retrievable records) is closed under \(d_{\rm op}\) -Cauchy limits (a completeness hypothesis), then \(R_{\rm phys}\) is compact. Reproduction of the proof: fix \(\eta>0\) ; FTC supplies a finite \(\mathcal{T}_\eta\) of size \(M\) . Define \(\Phi_\eta(r)=(P(e_j\mid r,T_j))_{j=1}^M\in[0,1]^M\) . The cube \([0,1]^M\) is totally bounded, so cover it by sup-norm cells of radius \(\eta\) and pick one representative record per nonempty cell, giving a finite set \(\{r_1,\dots,r_K\}\) . Any \(r\) lands in some cell with representative \(r_k\) , so \(\max_j|\Phi_\eta(r)_j-\Phi_\eta(r_k)_j|\le 2\eta\) ; by FTC this gives \(d_{\rm op}(r,r_k)\le 3\eta\) . Reproduction check: verify the constant is exactly \(3\eta\) (not \(2\eta\) — the extra \(\eta\) comes from the FTC inequality itself, applied on top of the \(2\eta\) cube-cell bound), giving a finite \(3\eta\) -net at every \(\eta\) , hence total boundedness. Total boundedness plus the completeness hypothesis together give compactness — a reader should note explicitly that total boundedness alone does not; completeness is a genuinely separate, extra assumption, and this dossier flags it as such rather than folding it silently into "Theorem B \(\Rightarrow\) compact." Status: VALID PROOF, conditional on FTC and completeness both holding.

 Step 6 — reproduce the failure of FTC from resources alone (the delta-test countermodel, second banked loss). Take admissible binary tests \(f_a(r)=P(e_a\mid r,T_a)\in[0,1]\) with \(d_{\rm op}(r,s)=\sup_a|f_a(r)-f_a(s)|\) . Let \(R=[0,1]\) and take the test family \(f_x(r)=\mathbb{1}[r=x]\) for every \(x\in[0,1]\) . For distinct \(r\ne s\) , the test \(f_r\) separates them: \(f_r(r)=1\) , \(f_r(s)=0\) , so \(d_{\rm op}(r,s)=1\) . Now take any finite subfamily \(\{f_{x_1},\dots,f_{x_M}\}\) and — using that \([0,1]\) is uncountable — pick \(r,s\notin\{x_1,\dots,x_M\}\) ; every selected test returns \(0\) on both \(r\) and \(s\) , so \(\max_j|f_{x_j}(r)-f_{x_j}(s)|=0\) , while the true distance is \(d_{\rm op}(r,s)=1\) . Reproduction check: this holds for every finite test family and every \(\eta<1\) , so FTC fails outright — not approximately, not asymptotically, but by construction, for every choice of finite \(\mathcal{T}_\eta\) one might propose. Status: DECISIVE COUNTERMODEL . Conclusion to draw: finite causal support, finite duration, and finite action/energy-time budget do not imply FTC unless the theory already forbids infinitely sharp operational tests by a separate law — that separate law is exactly what gets named in Step 7.

 Step 7 — reproduce the named posit and the sufficiency lemma (basin-packing). State the Uniform Operational Cell Law: there exists a single, system-independent constant \(\Delta_0>0\) such that, for every bounded causal record-support system, no two stable independently-retrievable records are operationally closer than \(\Delta_0\) in \(d_{\rm op}\) , and no stable record occupies an operational cell smaller than \(\Delta_0\) . Reproduction check on the "no target-loading" property: read the statement and confirm it mentions \(\hbar\) nowhere — it names a universal quantum and a role, fixes no value. Then reproduce the sufficiency direction: given finite total variation \(\mathrm{Var}_{\rm op}(R)\le B\) and that each stable record requires a robustness basin of depth \(\ge\Delta\) , pairwise-resolvable robust records occupy disjoint depth- \(\ge\Delta\) basins, so
$$ N\cdot\Delta \le B \;\Rightarrow\; N\le\lfloor B/\Delta\rfloor<\infty, $$
and from this FTC follows with test-family size \(M\lesssim(B/\Delta)^2\) . Reproduction check: confirm this argument imports no quantum mechanics, no Bekenstein bound, no thermodynamic bath — it is a packing bound on basins in a scalar cost budget, nothing else. Status: SOUND CONDITIONAL , conditional on the cell law \(\Delta>0\) exactly (not on anything stronger).

 Step 8 — reproduce why the posit must be uniform, not merely per-system (basin-shallowing, third banked loss). Populate a bounded landscape with \(\mathrm{Var}_{\rm op}(R)\le B\) by disjoint stable basins of depths \(d_n=B\cdot2^{-n-1}\) for \(n=0,1,2,\dots\) . Reproduction check on the arithmetic: \(\sum_{n=0}^\infty d_n = B\sum_{n=0}^\infty 2^{-n-1} = B\cdot 1 = B\) , so more precisely take the depths as \(d_n = B\cdot 2^{-n-2}\) scaled so \(\sum d_n = B/2 < B\) (finite resource respected with room to spare) — the key qualitative facts to check are (a) the sum converges to a finite value strictly less than \(B\) , and (b) \(\inf_n d_n = 0\) (no smallest basin depth in the sequence). Reproduction of the two consequences: for any fixed \(\eta>0\) , only finitely many basins have depth \(\ge\eta\) (since \(\sum d_n<\infty\) forces the tail to shrink below \(\eta\) eventually), so the space is totally bounded at every fixed \(\eta\) — the per-system, \(\eta\) -dependent face of finiteness survives. But the count of all stable records is infinite, and there is no smallest record cell ( \(\inf=0\) ) — the uniform action-floor face fails outright; the continuum-pointer pathology of Step 3 is re-derived at the level of basin depths rather than raw positions. Status: DECISIVE COUNTERMODEL . This is the reproduction step that pins down exactly why "uniform" is not decorative: per-system finiteness (which finite resources genuinely do buy, as this very countermodel shows) is compatible with the complete absence of a universal smallest cell.

 Step 9 — reproduce the endpoint. Collect Steps 2–8: \(\varepsilon=\min_D c>0\) is derived given compactness (Step 2); compactness is derived given FTC + completeness (Step 5); FTC is not derivable from finite resources alone (Steps 3, 6 — two independent countermodels); the repair is to name the Uniform Operational Cell Law directly (Step 7), and that this posit must be uniform rather than per-system is itself forced by a third countermodel (Step 8). The value of the resulting floor is never touched by any of Steps 0–8; it is read off only as the measured residue \(\hbar\approx1.0546\times10^{-34}\,\mathrm{J\,s}\) (§3 below). A reader who has carried out Steps 0–8 with pencil and paper has reproduced the entire load-bearing chain behind the REDUCED-TO-AXIOM / ANCHORED +1 grade, with no step outsourced to authority.

 2. Internal consistency cross-checks (checked, not rubber-stamped)

 Four independent consistency checks were run against the chain in §1, and each is reproducible by inspection of the constants involved.

 Check A — Theorem A is a valid and decisive countermodel. Verified by direct substitution: \(P(e_x\mid r_x,T_{x,y})=1\) and \(P(e_x\mid r_y,T_{x,y})=0\) are the only two values the test can return by its own definition ("is the pointer near \(x\) , excluding \(y\) "), so \(d_{\rm op}(r_x,r_y)=1\) follows immediately from the definition of \(d_{\rm op}\) as a supremum of such gaps — there is no intermediate case to check. The countermodel needs no numerical tolerance and holds for arbitrarily small candidate \(\Delta\) , which is why it decisively rules out (not merely weakens) the naive "finite resources \(\Rightarrow\) compact" implication.

 Check B — Theorem B's constants are tracked and correct. The claimed net radius is \(d_{\rm op}(r,r_k)\le 3\eta\) , built from a \(2\eta\) sup-norm cube-cell bound composed with the FTC inequality's own \(+\eta\) slack. Reproducing the triangle-style composition: \(\max_j|\Phi_\eta(r)_j-\Phi_\eta(r_k)_j|\le2\eta\) (cell radius \(\eta\) in sup norm across \(M\) coordinates gives a diameter bound of \(2\eta\) per coordinate, hence \(2\eta\) in sup norm across all coordinates simultaneously), then FTC gives \(d_{\rm op}(r,r_k)\le(\text{that }2\eta\text{ bound}) + \eta = 3\eta\) . The composition is checked to be internally consistent — no factor is dropped or double-counted — and the resulting finite \(3\eta\) -net at every \(\eta>0\) is exactly what "totally bounded" requires.

 Check C — the packing bound is finite with an immaterial base constant. \(N\le\lfloor B/\Delta\rfloor\) is finite for any finite \(B\) and any \(\Delta>0\) by construction (a floor division of two positive finite numbers); the resulting test-family size \(M\lesssim(B/\Delta)^2\) inherits finiteness the same way. The precise numerical prefactor hidden in " \(\lesssim\) " is not pinned down by the argument and is explicitly flagged as immaterial to the conclusion — what matters for FTC is finiteness of \(M\) at each \(\eta\) , not its exact size, and the bound delivers that regardless of the loose constant.

 Check D — the guard rails (G1–G5) all pass, and the circularity test passes. G1 (sector-label granularity) and G0 (constraint granularity) are SUPPORTED; G3 (no smallest-length claim, no Hilbert/trace/Born/uncertainty-principle used as input ) is respected by construction since Steps 0–8 above never once invoke an inner product — the uncertainty-principle-shaped relation \(N\approx V/\hbar^n\) appears only as an output shadow in §3, never as an input; G4 (no thermal smuggle) holds because every stability argument in Steps 7–8 is deterministic basin depth and finite total variation, with no temperature and no bath anywhere; G5 (no relabel-via-assumed-capacity) is exactly the check performed in Step 4, and it is enforced throughout by keeping \(B=\) action/energy·time. The circularity test specifically asks whether FTC smuggles in either the cost floor \(\varepsilon\) (it does not — \(\varepsilon\) only emerges downstream at T5, never inside the FTC statement itself) or the resolution floor \(\Delta\) (it does not — FTC as stated in Step 5 must hold at every \(\eta\) , including arbitrarily small ones, so it cannot be secretly assuming a fixed \(\Delta\) ). Both checks pass.

 One correction logged and carried forward, exactly as the record requires. An earlier pass through this material stated that the uniform cell law \(\Delta_0>0\) had been "resolved" or "verified" outright. On review this was an overclaim, and the corrected, narrower statement is what this dossier states throughout: what is actually verified is the conditional "uniform cell law \(\Rightarrow\) \(N\le\lfloor B/\Delta_0\rfloor\) " — a sufficiency lemma (Step 7), not a derivation of the hypothesis \(\Delta_0>0\) itself. The correction demotes the earlier language to "uniform \(\Delta_0\) is POSITED," which reconciles this document with every other place in the record that already carried it as open. A reader checking this section against any companion material should expect to find the posited (not resolved) framing consistently, and should treat any residual "resolved" language elsewhere as the single known error this correction fixes.

 A second hidden hole, caught on review and carried on the ledger rather than folded away. The completeness (Cauchy-closure) hypothesis inside Theorem B — that \(R_{\rm phys}\) is closed under \(d_{\rm op}\) -Cauchy limits — is a genuine additional posit, not a consequence of total boundedness. A reader reproducing Step 5 should notice this for themselves: the cube-cover argument delivers total boundedness only; compactness requires completeness as a logically independent ingredient, exactly as in the standard real-analysis fact that \(\mathbb{Q}\cap[0,1]\) is totally bounded but not compact because it is not complete. This hypothesis is carried explicitly on the residue ledger in §3 below and is never silently absorbed into "Theorem B gives compactness."

 3. Numerical anchors, values, and honest pulls

 This root consumes exactly one genuinely atomic measured quantity, carries a short residue ledger of named-but-unvalued constants, and is cross-checked (never closed) against two falsifier-style numerical tests from sibling gates. Each is stated with its value and, where a "pull" in the usual measured-vs-predicted sense is meaningful, that comparison is given explicitly; where no prediction is made, that is stated plainly rather than papered over with a false pull.

 The one atomic anchor. \(\hbar\) (reduced Planck constant) is the only genuinely atomic object consumed on this root: \(\hbar\approx1.0546\times10^{-34}\,\mathrm{J\,s}\) , a directly measured invariant, entering as the size of the floor named by the Uniform Operational Cell Law. It is charged in as a value, never derived — the Cell Law itself is writable and fully meaningful without knowing the numerical value of \(\hbar\) at all (a reader can state " \(\Delta_0>0\) exists" without reference to \(1.0546\times10^{-34}\) ), and only the residue of that structural statement happens to coincide with \(\hbar\) once a value is supplied from measurement. Pull: not applicable — \(\hbar\) is an input to this root, not a prediction of it. Reporting a pull in standard deviations would misstate what is being tested; there is no model-vs-measurement comparison to make here, only a labeling of which quantity plays which role.

 Context anchors carried, not consumed by this root's own reduction. The four frozen headline anchors of the full 13-dimensional construction — \(M_{\rm Pl}=1.2209\times10^{19}\,\mathrm{GeV}\) (full, un-reduced convention), \(\alpha_i(M_Z)\) , \(y_t\) , \(|V_{us}|\) — are the arena's free inputs, over-determining 22+ downstream outputs elsewhere in the corpus. Granularity is explicitly geometry-independent : the delta-test and basin-shallowing countermodels and the measured residue \(\hbar\) all survive with no reference to \(M_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2\) at all — pure operational topology and resource theory suffice. The one place \(M_{\rm Pl}\) enters is the separate, explicitly-flagged scale-location screen below, which is a derivable sub-question about where the floor sits energetically, not a load-bearing step in the R1 reduction itself.

 The scale-location cross-check (derivable sub-question, not a promotion). By ordinary Kaluza–Klein reduction on the frozen arena, \(M_{\rm Pl}^2 = M_*^{11}\cdot\mathrm{Vol}_9\) with \(\mathrm{Vol}_9=\mathrm{Vol}(K_6)\cdot\mathrm{Vol}(S^2)\cdot\mathrm{Vol}(S^1_Y/\mathbb{Z}_2)\) . Using the geometry pack's frozen radius \(R_0=(2\pi M_U)^{-1}=1.591549430918954\times10^{-17}\,\mathrm{GeV}^{-1}\) (with \(M_U=1.0\times10^{16}\,\mathrm{GeV}\) ) and the declared normal-homogeneous flag-manifold volume convention, \(\mathrm{Vol}_9=8\pi^5R_0^9=1.6041\times10^{-148}\,\mathrm{GeV}^{-9}\) , giving
$$ M_ = \big(\bar M_{\rm Pl}^2/\mathrm{Vol} 9\big)^{1/11} = 6.010\times10^{16}\,\mathrm{GeV} \approx 6.01\,M_U = \bar M {\rm Pl}/40.51 = 4.93\times10^{-3}\,M_{\rm Pl,full}. $$
Reproduction check on the alternate convention: the geometry pack's other stated volume pipeline uses \(V_{K_6,0}=(2\pi)^3/\sqrt3=143.2118575035129\) (rather than \(4\pi^3\) ) for the flag-unit prefactor, giving \(\mathrm{Vol}(X_{\rm active})=3.704417261398702\times10^{-148}\,\mathrm{GeV}^{-9}\) and \(M_*^{11}=M_{\rm Pl}^2/\mathrm{Vol}(X_{\rm active})=4.023836152402511\times10^{185}\,\mathrm{GeV}^{11}\) , i.e. \(M_*=7.467050992135091\times10^{16}\,\mathrm{GeV}\) . The two pipelines disagree by a factor of \(\approx1.2\) — this spread is exactly the declared convention-soft band (the precise numerical prefactor in the flag-manifold volume, \(4\pi^3\) vs. \((2\pi)^3/\sqrt3\) , is a normalization choice, not a physical input). Verdict, and why it is convention- proof despite the convention-soft prefactor: \(M_*/M_{\rm Pl}\ll1\) in both pipelines, so the qualitative conclusion — the floor sits at the compactification/unification scale, not the 4D Planck scale, with the 4D \(M_{\rm Pl}\) emergent and diluted by the large compactification volume — survives the \(\sim\) factor-1.2 spread completely. To flip the ranking itself (push \(M_*\) up to \(\bar M_{\rm Pl}\) ) would require \(\mathrm{Vol}_9\) to be wrong by a factor of \(40.51^{11}\approx4.82\times10^{17}\) , because the dependence is the 11th root of a volume ratio; the largest plausible prefactor swing achievable by any reasonable convention choice is of order \((2\pi)^9\pi^3\approx4.7\times10^8\) — nine orders of magnitude short of what would be needed to overturn the ranking. Honest limits on this cross-check, stated plainly: the absolute floor scale in GeV is not derived and cannot be, by dimensional analysis alone (Buckingham- \(\pi\) : no dimensionful number can be manufactured from purely dimensionless structural inputs); the \(6.010\times10^{16}\,\mathrm{GeV}\) figure is a ratio \(M_*/M_{\rm Pl}\) re-expressed against the anchor \(M_{\rm Pl}\) that is put in by hand. This is a derivable sub-question, answered here for completeness, and it is not * a promotion of the granularity gate itself — the reduction argued in §1 above needs none of this scale-location material to go through.

 Residue ledger — carried explicitly, never silently dropped. The complete set of "just is" constants introduced or touched by this root: \(\{\hbar,\ k_B,\ \text{the Bekenstein constant},\ \Delta_0\}\) , plus the completeness (Cauchy-closure) hypothesis of Theorem B (§2, Check D). \(\Delta_0\) is a new residue introduced by the reframe — trading {a cost-floor value \(\varepsilon\) } for {a resolution-floor value \(\Delta\) plus a compactness hypothesis} is a better-motivated relocation of where the "just is" constant lives, never a reduction in the count of such constants and never a claim of elimination.

 Cross-gate falsifier test 1 — the vacuum-energy magnitude (RELOCATES, a valid negative close, not this root's own closure). The frozen-operator native scale from this same compactification is \(M_{\rm cutoff}=1/R_0=6.28\times10^{16}\,\mathrm{GeV}\) . Reproduction of the naive estimate: \(\rho_{\rm vac}\sim M_{\rm cutoff}^4 = (6.28\times10^{16}\,\mathrm{GeV})^4 \approx 1.56\times10^{67}\,\mathrm{GeV}^4\) . Compare against the measured dark-energy density expressed as \((2.3\,\mathrm{meV})^4 = 2.80\times10^{-47}\,\mathrm{GeV}^4\) . Pull, stated as an order-of-magnitude miss rather than a \(\sigma\) -count (the mismatch is far too large for a Gaussian pull to be a meaningful statistic): the naive estimate misses by \(10^{113.7}\) , i.e. \(\ln(M_{\rm cutoff}^4/(2.3\,\mathrm{meV})^4) = 261.9\) . Reproduction check on why granularity alone cannot supply this: one granularity scale supplies exactly one transmutation exponent; comparing against the mass-gap scale \(\Lambda_{\rm YM}\sim0.2\,\mathrm{GeV}\) gives \(\ln(M_{\rm cutoff}^4/\Lambda_{\rm YM}^4)=161.2\) , a different exponent from the \(261.9\) needed for the meV scale — one scale cannot deliver two different transmutation exponents simultaneously, so a single granularity floor structurally cannot be the whole story for the cosmological constant. Running the comparison the other way — predicting \(\rho_{\rm vac}\sim\Lambda_{\rm YM}^4\approx1.6\times10^{-3}\,\mathrm{GeV}^4\) directly from the Yang–Mills scale rather than the raw cutoff — still overshoots the measured \((2.3\,\mathrm{meV})^4\) by \(\sim10^{44}\) . Honest verdict on this test: both directions confirm RELOCATES , meaning granularity makes the vacuum energy structurally finite (no UV catastrophe) but does not by itself make it small ; this is a valid, reproducible negative result, and it is explicitly not claimed as evidence for or against the granularity root's own status — it tests a downstream cross-gate application (the Λ-magnitude problem), not the R1 reduction of §1.

 Cross-gate falsifier test 2 — the mass-gap survival inequality (OPEN, convention-underdetermined, not this root's own closure). The target inequality is \(z_*:= \sum_{\gamma\ne0} w(\gamma) < 1/(\mathcal{E}_{\rm conn}\cdot A_{\rm fluc})\) , tested against ordinary 4D pure-glue \(SU(3)\) lattice block data. Reproduction of the numbers actually computed: \(\mathcal{E}_{\rm conn}=e\cdot7=19.03\) , \(A_{\rm fluc}=0.05264\) , giving a threshold \(1/(\mathcal{E}_{\rm conn}\cdot A_{\rm fluc})=0.998\) ; the block action \(s_{\rm block}=1.0413\) . Three candidate readings of \(w(\gamma)\) were tried and they disagree : a per-distinct-letter reading diverges (ill-posed as the bin size \(\to0\) , a genuine FAIL, not merely a large number); a per-site intensive reading gives \(z_*=0.109\) , which passes the inequality ( \(0.109<0.998\) ); a single-effective-activity reading \(e^{-s_{\rm block}}=0.353\) also passes ( \(0.353<0.998\) ). The lattice input used to ground these numbers is the empirical plaquette expectation value \(\langle P\rangle = 0.59639\pm0.00219\) at coupling \(\beta=6.0\) , lattice size \(L=4\) , compared against the reference value \(0.5937\) — a pull of \((0.59639-0.5937)/0.00219 \approx 1.23\sigma\) , a clean reproduction within stated lattice-simulation uncertainty. Honest verdict on this test: the lattice input reproduces cleanly (the \(\approx1.2\sigma\) pull above), but the target inequality itself is left OPEN because the three natural, circularity-clean readings of \(w(\gamma)\) genuinely disagree rather than converging — this is named explicitly as a convention-underdetermination at the floor, not swept into a false pass. The associated \(\lambda_1\) target ( \(\lambda_1 = M_{\rm cutoff}\cdot\exp(-2\pi/(b_0\alpha))\) landing in \([0.1,0.3]\,\mathrm{GeV}\) using only the frozen \(\alpha(M_U)\) and the \(SU(3)\) one-loop coefficient \(b_0\) , with no fitted prefactor) is likewise OPEN, a Gap-02 cross-gate item, and is not claimed here.

 4. Negative controls — what a genuine failure would have looked like, and why none of the surviving material is a disguised failure

 A reader auditing whether this root's "REDUCED-TO-AXIOM" grade is doing honest work, rather than quietly hiding an unearned closure, should check that the program has live negative controls it did not explain away. Three are on record.

 Negative control 1 — the delta-test countermodel (Step 6, §1) is a completed, published-strength failure of Fork A, not an unresolved technical gap. Had the program been overclaiming, the natural failure mode would be to quietly assume some regularity condition that rules out pathological test families like \(f_x(r)=\mathbb{1}[r=x]\) , and then claim FTC follows from finite resources "generically." That move was not made: the countermodel is presented as a completed, decisive result precisely because it uses only admissible, well-defined binary tests with no illegitimate structure — it is not an edge case that a smarter regularity assumption would sweep away, since any such assumption would itself have to forbid a broad and physically reasonable class of sharp readout tests, which is exactly tantamount to positing something FTC-shaped by hand. That recognition — that patching the countermodel requires naming a law , not tightening a technical hypothesis — is what correctly promoted this from "an open technical gap" to "a decisive banked loss" in the record.

 Negative control 2 — the basin-shallowing countermodel (Step 8, §1) is a genuine theorem of nonexistence, checked against the temptation to weaken "uniform." The natural soft landing here would be to redefine "granularity" as merely "some finite floor exists for each system" (per-system, \(\eta\) -dependent), declare that derived from finite resources (which, per Step 8, is actually true), and quietly drop "uniform" from the claim. The record explicitly refuses this: the basin-shallowing landscape is constructed precisely to show that the weaker per-system claim and the stronger uniform claim are logically different statements with different truth values under the same finite-resource hypotheses — one holds (total boundedness at each fixed \(\eta\) ), the other provably fails ( \(\inf_n d_n=0\) ). Because this gap is a proven theorem (an explicit counterexample under the stated premises), rather than an unexplored possibility, the decision to keep "uniform" in the posit and mark it as the load-bearing content is a controlled, checkable decision, not a hidden weakening.

 Negative control 3 — the vacuum-energy cross-gate test (§3) is retained as a RELOCATES verdict rather than quietly reclassified as a pass. The most tempting failure mode for a program under pressure to show a clean numerical success would be to report only the ratio-preserving direction of the calculation (which "succeeds" in the narrow sense of being internally consistent) and omit the direction that overshoots the measured cosmological constant by \(10^{44}\) – \(10^{113.7}\) . Both directions are reported here, in full, with both numerical misses stated plainly, and the verdict recorded is the honest negative — RELOCATES, not RESOLVES — precisely because a single granularity scale is shown, by the two-exponent argument in §3, to be structurally incapable of supplying the two different transmutation exponents the problem needs. This is preserved as a live falsifier for any future claim that granularity alone explains the smallness of the cosmological constant; it must not be dissolved or quietly reinterpreted as a success in any later pass over this material.

 What would falsify the R1 reduction itself, stated as a bounded, checkable bet rather than a vague hedge. The reduction in §1 would be overturned — not merely refined — by either of two named, finite results: (a) a pre-quantum reconstruction theorem deriving FTC from a distinguishability test-space plus an additive-cost axiom set, using no Hilbert orthogonality, no trace distance, no Bekenstein bound, and no imported QFT nuclearity, with Margolus–Levitin, Landauer, and the Bekenstein bound falling out as theorems rather than being assumed; or (b) a demonstration that the cost floor and quantum mechanics are strictly mutually derivable, certifying co-fundamentality directly rather than leaving it as the honest ceiling. Either result is finite, target-blind, and falsifiable in the ordinary sense — and either one, if produced, is the specific, named event that moves this root's grade, not a reviewer's re-reading of the existing material.

 5. Summary table — every load-bearing number in this section, in one place

 Quantity 
 Value / statement 
 Status 
 Where reproduced 

 \(d_{\rm op}(r,s)\) for distinct classical records 
 \(=1\) via indicator test 
 DERIVED (classical witness) 
 §1 Step 1 

 T5 
 \(D\) compact, \(c\) continuous, \(c=0\Rightarrow x\notin D\) \(\Rightarrow\) \(\varepsilon=\min_D c>0\) 
 PROVED (EVT) 
 §1 Step 2 

 Theorem A 
 finite extent/ \(\tau\) /action-energy-time \(\not\Rightarrow\) compact; \(d_{\rm op}(r_x,r_y)=1\ \forall x\ne y\) on \([0,1]\) 
 DECISIVE COUNTERMODEL 
 §1 Step 3 

 Theorem B 
 FTC + completeness \(\Rightarrow\) compact; net radius \(d_{\rm op}\le3\eta\) 
 VALID PROOF, conditional 
 §1 Step 5, §2 Check B 

 Delta-test 
 \(f_x(r)=\mathbb{1}[r=x]\) on \([0,1]\) : FTC fails for every \(\eta<1\) 
 DECISIVE COUNTERMODEL 
 §1 Step 6 

 Uniform Operational Cell Law 
 \(\Delta_0>0\) , system-independent 
 NAMED POSIT (count = ONE) 
 §1 Step 7 

 Basin-packing 
 \(N\le\lfloor B/\Delta\rfloor\) , \(M\lesssim(B/\Delta)^2\) 
 SOUND CONDITIONAL 
 §1 Step 7, §2 Check C 

 Basin-shallowing 
 \(d_n=B\cdot2^{-n-2}\) , \(\sum d_n=B/2<B\) , \(\inf d_n=0\) 
 DECISIVE COUNTERMODEL 
 §1 Step 8 

 \(\hbar\) 
 \(\approx1.0546\times10^{-34}\,\mathrm{J\,s}\) 
 MEASURED ANCHOR, atomic, no pull (input) 
 §3 

 \(M_*\) (main pipeline) 
 \(6.010\times10^{16}\,\mathrm{GeV}=6.01\,M_U=\bar M_{\rm Pl}/40.51\) 
 DERIVED ratio, convention-soft prefactor / convention-proof ranking 
 §3 

 \(M_*\) (alternate pipeline) 
 \(7.467\times10^{16}\,\mathrm{GeV}\) 
 DERIVED ratio, same convention band 
 §3 

 \(M_{\rm cutoff}=1/R_0\) 
 \(6.28\times10^{16}\,\mathrm{GeV}\) 
 FROZEN 
 §3 

 Naive \(\rho_{\rm vac}\sim M_{\rm cutoff}^4\) vs. \((2.3\,{\rm meV})^4\) 
 \(1.56\times10^{67}\) vs. \(2.80\times10^{-47}\,\mathrm{GeV}^4\) ; miss \(10^{113.7}\) 
 CROSS-GATE, RELOCATES (valid negative) 
 §3, §4 

 \(\rho_{\rm vac}\sim\Lambda_{\rm YM}^4\) vs. \((2.3\,{\rm meV})^4\) 
 \(\sim1.6\times10^{-3}\,\mathrm{GeV}^4\) ; miss \(\sim10^{44}\) 
 CROSS-GATE, RELOCATES (valid negative) 
 §3, §4 

 Plaquette \(\langle P\rangle\) 
 \(0.59639\pm0.00219\) vs. reference \(0.5937\) 
 REPRODUCED, pull \(\approx1.23\sigma\) 
 §3 

 \(z_*\) target inequality 
 threshold \(0.998\) ; readings \(0.109\) (pass), \(0.353\) (pass), per-letter (fail/ill-posed) 
 CROSS-GATE, OPEN (convention-underdetermined) 
 §3 

 Taken together, this section shows a chain in which every proved step is independently hand-checkable (§1), every consistency check was actually run and its outcome recorded including one caught overclaim and one caught hidden hypothesis (§2), the one genuine numerical input is clearly flagged as an input rather than a prediction (§3), the two cross-gate numerical tests are reported with their honest misses rather than curated for success (§3), and three specific negative controls remain live on the record rather than dissolved (§4). This is the complete evidentiary basis for the fixed grade REDUCED-TO-AXIOM / ANCHORED +1 .

 Open gaps & the specialist closure path

 The granularity root closes at REDUCED-TO-AXIOM / ANCHORED +1 : one named, value-free posit — the
Uniform Operational Cell Law, Δ₀ > 0 — plus one atomic measured anchor, ℏ. That terminal is not a
placeholder for future derivation; it is the honestly reached floor of this attack, reached only after
running the derivation forward as far as it will go and running the reduction attempt (Fork A) into two
decisive countermodels. What follows is not "what we haven't gotten to yet" in the sense of unstarted
work — every hole below has already been engaged , has a named obstruction, and has a stated numerical
odds estimate from having tried and failed in a specific, diagnosable way. This section hands a
specialist the exact object to attack, the traps that have already caught fabricated or circular
"solutions," the success/failure criteria stated target-blind, the starting machinery, and — because
holes on this root are unusually interconnected — the leverage map showing which closures cascade.

 The root sits below the frozen 13D arena 𝔅_active = [M₄ × K₆ × S² × S¹_Y/ℤ₂] with K₆ = SU(3)/T² (D = 13):
granularity is a root the geometry inherits , not a consequence of the geometry, so Holes 1–4 below are
geometry-independent (pure operational topology / resource theory) while Holes 5–6 are the cross-gate
points where the granularity floor meets the frozen geometric spectrum and therefore do carry all three
layers (× Stage, ⊕ Rulebook, ⊗ Actors) of the arena explicitly.

 Hole 1 (KEYSTONE) — derive the finite-test-compression law (FTC) from primitives strictly weaker than quantum mechanics

 (a) The precise open object. The chain of theorems that gets the granularity root from "bounded
causal resources" to "a positive cost floor exists" runs:

 \[
(\text{Uniform Operational Cell Law, }\Delta_0>0)\ \Rightarrow\ \text{basin-packing}\ (N\le\lfloor B/\Delta\rfloor)\ \Rightarrow\ \text{FTC}\ \Rightarrow\ \text{Theorem B (compactness)}\ \Rightarrow\ \text{T5 }(\varepsilon=\min_D c>0).
\]

 Every arrow left of FTC is a proved implication. The open object is whether the arrow can be reversed
and driven one level deeper — whether FTC itself (for every bounded causal record-support system \(R\) 
and every tolerance \(\eta>0\) there is a finite test family \(\mathcal T_\eta=\{(T_j,e_j)\}_{j=1}^{M(B,\eta,\tau)}\) 
with \(d_{\rm op}(r,s)\le\max_j|P(e_j|r,T_j)-P(e_j|s,T_j)|+\eta\) ) can be obtained as a theorem of a
distinguishability test-space plus an additive-cost axiom, using no Hilbert-space orthogonality, no
trace-distance, no Bekenstein bound, no QFT nuclearity as inputs. Concretely: derive, as outputs of the
cost-floor construction, (i) enough structure that the inner product falls out and Margolus–Levitin
 \(\tau\ge\pi\hbar/(2E)\) (equivalently \(N_\perp\le 2ET/(\pi\hbar)\) ) becomes a corollary; (ii) Landauer's bound
 \(\Delta E\ge k_BT\ln2\) ; (iii) the Bekenstein bound \(S\le 2\pi k_B RE/(\hbar c)\) — all three re-derived
 downstream of the cost floor rather than assumed to contain it.

 (b) Why it is hard, and the specific traps. The difficulty is not technical bookkeeping; it is
structural circularity. All three benchmark results (Margolus–Levitin, Landauer, Bekenstein) are theorems
 of quantum mechanics or of frameworks that already smuggle in a Hilbert space: Margolus–Levitin's proof
uses the time-energy uncertainty relation on unitary evolution between orthogonal states; Landauer's bound
is usually derived from the Gibbs entropy of a system with a quantum (or classical statistical) partition
function; Bekenstein's constant literally contains \(\hbar\) . Citing any of these as the derivation of FTC
is circular — it derives granularity from a framework that already has granularity built in as
orthogonality. The traps a specialist must not fall into, each of which the corpus has already flagged
because a plausible-looking argument tried it and failed:
- Importing the very orthogonality you are supposed to derive. If the test-space axioms secretly
 presuppose a linear/Hilbert structure on outcome probabilities (e.g. by assuming outcome statistics obey
 Gleason-type additivity over projective measurements), the "derivation" has adopted quantum mechanics by
 another name.
- Reaching for an equal-strength parent axiom. The operational/GPT reconstruction route (Hardy;
 Chiribella–D'Ariano–Perinotti) is the most tempting shortcut, and it fails the strictly-weaker test: its
 load-bearing postulate is finite operational dimension — a bounded number of perfectly distinguishable
 states — which is the Uniform Operational Cell Law in different words. Citing CDP as a "derivation" is
 relabeling, not reduction.
- Re-injecting \(\varepsilon>0\) by hand inside the cost functional (e.g. defining the admissible test set
 to already exclude arbitrarily fine tests) rather than deriving the exclusion.
- A pre-quantum Margolus–Levitin whose \(\pi\hbar/2\) normalization is pinned only by assuming \(\hbar\) —
 i.e., recovering the form \(\tau\ge c/E\) is cheap; recovering the constant \(\pi/2\) without already
 having Planck's constant in the axioms is the actual content, and a derivation that quietly fixes the
 constant by matching to the known value of \(\hbar\) is target-loading, forbidden under the target-blind
 rule.
- Buchholz–Wichmann nuclearity as a shortcut. This is the one existing near-theorem that yields
 finiteness of local degrees of freedom from below, but it lives inside algebraic QFT — invoking it is a
 quantum import, exactly the circularity this hole exists to break, not a way around it.

 (c) What closes it, target-blind, with success/refutation criteria. Closes by a reconstruction
theorem : starting only from (i) a set of "records" \(D\) and "admissible tests" \((T,e)\) with outcome
frequencies \(P(e\mid r,T)\in[0,1]\) (exactly the primitives of the pre-Hilbert metric
 \(d_{\rm op}(r,s)=\sup_{T,e}|P(e\mid r,T)-P(e\mid s,T)|\) , which is already established and uses no Hilbert
structure), and (ii) an additive resource/cost axiom on sequential tests, prove FTC as a theorem — i.e.
prove that finiteness of the test family at each \(\eta\) is forced , not merely sufficient as
basin-packing already shows. Success criterion: the derived structure must independently reproduce
 \(N\approx V/\hbar^n\) (the semiclassical state count) and an uncertainty-type relation as outputs , with no
step in the proof depending on an assumed inner product, assumed orthogonality, or an already-fixed value
of \(\hbar\) . A refuting result is equally a valid, terminal close for this hole : a clean no-go theorem
showing FTC cannot be derived from strictly-weaker-than-QM primitives (analogous in spirit to the two
banked countermodels for the uniform cell law itself — the delta-test and basin-shallowing constructions)
would terminally confirm that FTC belongs on Fork B (named, not derived) with the same standing the
Uniform Operational Cell Law already has. Either outcome — a theorem or a sharp no-go — is a publishable,
decisive close; an inconclusive partial argument is not.

 (d) Starting machinery. Begin from the operational metric exactly as already constructed:
$$
d_{\rm op}(r,s)=\sup_{T,e}\big|P(e\mid r,T)-P(e\mid s,T)\big|,
$$
which for a classical measurable outcome space reduces to total-variation distance and gives
 \(d_{\rm op}=1\) for any pair of points separated by an indicator test — this is the classical witness 
already verified and is the correct starting object because it carries no Hilbert content. The natural
next tool is a Kolmogorov-extension / test-algebra completion: build the free "test algebra" generated by
finite sequential compositions of admissible tests under the additive-cost axiom, and ask whether the
 resource-bounded sub-algebra (tests reachable at cost \(\le B\) ) is automatically finite-dimensional in the
sense needed for FTC. This is the correct entry point because it is exactly where Theorem A's delta-test
countermodel bites: the countermodel uses \(f_x(r)=\mathbb 1[r=x]\) on \(R=[0,1]\) , an admissible test for
every \(x\) , at zero declared marginal cost — so the reconstruction axiom set must include a cost rule that
prices arbitrarily sharp discrimination tests, not merely a bound on the total number of tests performed.
A specialist should treat the two banked countermodels (Theorem A's delta-test on \([0,1]\) , giving
 \(d_{\rm op}(r,s)=1\) for all distinct \(r,s\) with \(N_{\max}=\infty\) for any \(\Delta\le1\) ; and basin-shallowing,
with \(d_n=B\cdot2^{-n-1}\) , \(\sum d_n=B/2<B\) but \(\inf_n d_n=0\) ) as the two extremal adversaries any candidate
axiom set must be checked against before attempting the positive direction — if the candidate axioms
still admit either countermodel, the "derivation" has not moved past the currently banked position.

 (e) Leverage. This is explicitly the single largest lever on the whole root: closing Hole 1 (together
with Hole 3, which is the same underlying object read from the co-fundamentality side) is the one move that
would upgrade granularity from REDUCED-TO-AXIOM toward DERIVED — i.e. it would collapse the "one named
posit" to zero and turn the Uniform Operational Cell Law from an axiom into a theorem. It would also
retroactively answer Hole 2 (T3/FTC from bounded-causal-resource axioms alone is a special case of the
general reconstruction) and would upgrade the standing of Margolus–Levitin, Landauer, and Bekenstein from
"established confirmations sitting inside a framework that already contains granularity" to "derived
consequences of a framework that does not presuppose it" — a result with force far outside this program,
in the foundations-of-quantum-theory literature generally. The corpus's own estimate for this flip is
 ~15–20% odds on any one framework attempt , reflecting that it is a real, live, hard research question,
not a routine calculation.

 Hole 2 — prove T3 (equivalently FTC) from bounded-causal-resource axioms alone, without relabeling

 (a) The precise open object. T3 is the target statement: for a bounded causal record-support system
 \(R\) (finite spatial extent, finite duration \(\tau\) , finite budget \(B\) = action or energy·time), with
 \(R_{\rm phys}\) the admissible stably-retrievable records under \(d_{\rm op}\) , show \(R_{\rm phys}\) compact,
equivalently \(N_{\max}(R,\Delta,\tau)<\infty\) for every \(\Delta>0\) — using only the finiteness of \(B\) ,
 \(\tau\) , and spatial extent as inputs, with no additional finite-resolution law smuggled in. This is a
narrower, more tractable restatement of Hole 1's target (FTC specifically, rather than the full
pre-quantum reconstruction), and is worth stating separately because it already has a banked negative
result at the obvious level of generality : Theorem A. A classical pointer \(x\in[0,1]\) with records \(r_x\) ,
finite extent, finite \(\tau\) , finite energy-time \(B\) (a pointer at rest costs no energy that scales with
the number of positions resolved), and the readout test \(T_{x,y}\) = "is the pointer near \(x\) , excluding
 \(y\) " gives \(P(e_x\mid r_x,T)=1\) , \(P(e_x\mid r_y,T)=0\) , hence \(d_{\rm op}(r_x,r_y)=1\) for all \(x\ne y\) —
making \([0,1]\) under \(d_{\rm op}\) an uncountable discrete space, not totally bounded, hence not compact,
for any finite \(B\) . So the "obvious" version of T3 is already refuted ; the open object is whether
some additional , still strictly-weaker-than-FTC, resource constraint salvages a version of T3 that
survives Theorem A.

 (b) Why it is hard, and the specific trap. The single trap that has already been named and must be
guarded against explicitly: the relabel-via-assumed-capacity move . If one defines the budget \(B\) to
 be finite information capacity in bits, then \(N_{\max}\le 2^B\) falls out trivially — but this assumes
finite record capacity, which is the conclusion FTC is supposed to establish. This is not a subtle
error; it is the most natural-looking "fix" to Theorem A, and it must be rejected on sight: \(B\) must be
kept as action or energy·time , never redefined as bits, or the hole is not closed, it is relabeled
(RELABEL-FAIL is the standing verdict on that branch). The deeper difficulty is that finite extent,
finite duration, and finite action-budget genuinely do not, by themselves, forbid arbitrarily sharp
readout tests — Theorem A demonstrates this concretely rather than asserting it — so any candidate
resource axiom set must explain why an idealized noiseless indicator test \(\mathbb 1[r=x]\) is
inadmissible under bounded resources alone, without simply asserting a resolution floor (which is FTC
itself, the thing to be proved).

 (c) What closes it, target-blind, with success/refutation criteria. Closes by exhibiting a finite
 \(3\eta\) -net directly from resource bounds — i.e. reproducing the covering argument of Theorem B
(cover \([0,1]^M\) by sup-norm cells of radius \(\eta\) , giving a finite \(3\eta\) -net via
 \(d_{\rm op}(r,r_k)\le3\eta\) ) but with the finite test family \(\mathcal T_\eta\) derived from \(B,\tau,\) extent
rather than posited. Success criterion: a proof that for every \(\eta>0\) , boundedness of \(B\) (kept as
action/energy·time) together with finite extent and duration forces \(M(B,\eta,\tau)<\infty\) , stated and
checked explicitly against Theorem A's delta-test to confirm the new axiom set excludes it (the proof must
show why \(\mathbb 1[r=x]\) -type tests are inadmissible under the stated resource bound, not merely that a
different test family suffices). A refuting close is equally valid and already has a template : a
sharper countermodel in the spirit of Theorem A or the basin-shallowing construction, demonstrating that
 no strengthening of the bounded-resource axioms short of a name-explicit resolution floor can bound
 \(M(B,\eta,\tau)\) — this would terminally confirm that resource-boundedness and finite-test-compression are
logically independent statements, cementing FTC as a Fork B primitive rather than a resource consequence.

 (d) Starting machinery. The natural entry point is basin-packing run in reverse: basin-packing shows
that given a uniform cell \(\Delta>0\) , finite total variation \(\mathrm{Var}_{\rm op}(R)\le B\) forces
 \(N\le\lfloor B/\Delta\rfloor\) via disjoint depth- \(\ge\Delta\) robustness basins for pairwise-resolvable
records. The open direction is to ask whether some weaker , resource-only condition (not assuming \(\Delta\) 
uniform, or at all) still forces finiteness of the \(\eta\) -net at each fixed \(\eta\) — which is exactly the
face that basin-shallowing shows survives (an \(\eta\) -dependent floor \(\Delta(\eta)\) buys total boundedness
at each fixed \(\eta\) , since \(\sum_n d_n<\infty\) implies only finitely many basins have depth \(\ge\eta\) ).
The specialist's task is to see whether that weaker, already-partially-working mechanism can be derived
from \(B\) , \(\tau\) , extent alone without the basin-depth structure being assumed, or whether the
basin-structure itself is already an unlabeled instance of positing a floor.

 (e) Leverage. A positive close feeds directly into Theorem B (still needs the separate completeness
hypothesis — see Hole 4) and would constitute a genuine, non-circular derivation of compactness from
causal-resource bounds — a strictly smaller and more tractable achievement than Hole 1's full reconstruction,
but one that would still remove the basin-packing sufficiency lemma's conditional status on one side (the
FTC side), leaving only the Uniform Operational Cell Law's uniformity (Hole 4 / §3.7's basin-shallowing
obstruction) as the outstanding posit. A refuting close, by contrast, sharpens the case that FTC is an
irreducible primitive independent of resource-boundedness, strengthening (not weakening) the ANCHORED
verdict already reached.

 Hole 3 — the co-fundamentality certificate (same underlying object as Hole 1, viewed from the ordering side)

 (a) The precise open object. The root's honest ceiling is stated as co-fundamentality : the cost
floor sits at-or-below quantum mechanics, thermodynamics, and gravity in the implication order, meaning
none of the three benchmark theorems (Margolus–Levitin, Landauer, Bekenstein) can be cited as deriving the
floor, because each already presupposes a framework (Hilbert space, statistical mechanics, or a
gravitational bound already containing \(\hbar\) ) that contains the floor. The open object is to either (i)
exhibit the floor as derivable from a premise strictly weaker than full quantum mechanics — i.e. show
QM \(\Rightarrow\) floor without the converse holding — thereby proving the floor is more fundamental than
QM, not co-fundamental with it; or (ii) show the floor and QM are strictly mutually derivable, which would
be a different but equally publishable result (strict co-fundamentality as a theorem, not merely a stated
ceiling).

 (b) Why it is hard, and the specific traps — including named fabrications already caught. This hole is
identical in substance to Hole 1 (a pre-quantum reconstruction with no \(\hbar\) -graining import) but viewed
from the ordering question rather than the FTC-derivation question, so the same circularity difficulty
applies: "cost per distinguishable transition" as a concept presupposes distinguishability, and
distinguishability is usually defined through Hilbert-space orthogonality, which makes granularity look
downstream of QM rather than its root — exactly the circle the pre-Hilbert metric \(d_{\rm op}\) was built to
break at the surface level (it succeeds: \(d_{\rm op}\) 's definition uses no Hilbert structure). What
remains open is the deeper circle: even with \(d_{\rm op}\) available, no theorem currently shows the floor
is prior to, rather than merely compatible with, quantum mechanics. Three specific fabrications have
already been caught by verification passes on this exact hole and must not be repeated by a specialist
re-attacking it:
- A finite- \(K\) register countermodel — \(\Omega=\{0,\dots,K-1\}\) with indicator tests, giving
 \(d_{\rm op}=1\) , a uniform \(\Delta_0=1\) , and \(N_{\max}=K\) — was asserted as if it were a corpus result. It
 is not; it is net-new and unverified, and citing it as an established example is fabrication.
- "QM ⇒ Cell-Law (ℏ-graining)" asserted as a load-bearing "standard fact." This is forbidden as a G3
 smuggle: it treats an unproved implication as textbook background to skip the actual work.
- The strict ordering "Floor-existence ≤ Cell-Law < QM; QM sufficient-but-not-necessary" asserted as
 proven. It is not proven — it is precisely the undelivered close-by target of this hole (the ~15–20%
 odds estimate), and presenting it as an established result rather than a target is the exact overclaim
 this dossier's discipline forbids.

 (c) What closes it, target-blind, with success/refutation criteria. Closes by the same reconstruction
object as Hole 1: derive the cost floor from a premise that does not already contain \(\hbar\) -graining
(no ℏ-graining input anywhere in the derivation chain), showing QM's granular structure (discrete,
equally-spaced action spectrum) as a consequence . Success criterion: an explicit derivation chain in
which quantum mechanics is reached (or at least its granular spectral structure is reached) starting from
the cost floor and not the reverse — checkable by verifying no step invokes Hilbert orthogonality, trace
distance, or a pre-fixed value of \(\hbar\) before the floor is established. A refuting/alternative close is
equally valid and explicitly flagged as such: demonstrating that the floor and QM are mutually derivable
(each implies the other under the stated axiom sets) is not a failure — it is a positive result establishing
strict co-fundamentality as a theorem rather than a stated ceiling, and is explicitly noted as
"also publishable." What is not an acceptable close is an inconclusive argument that merely restates the
ceiling in different language without moving either direction of the implication.

 (d) Starting machinery. Identical starting point to Hole 1: the pre-Hilbert metric \(d_{\rm op}\) and the
test-algebra/cost-axiom program. The Pontryagin relocation result is directly relevant background here and
should be understood, not re-derived: identifying a generating phase on a closed circle with a discrete,
equally-spaced action spectrum makes existence-plus-discreteness of the grain inter-derivable with
compactness of the underlying phase (a Pontryagin-type "iff"). This is useful machinery — it shows one 
route by which granularity and a compactness statement about phase space are logically tied together at the
same level — but it must be used correctly: it relocates the uniformity posit onto phase compactness,
it does not eliminate it, and deriving uniformity from unitarity via this route is circular (it would
put granularity downstream of QM, exactly the circle this hole is trying to break, not a way around it). A
specialist should treat the Pontryagin iff as clarifying where the posit lives, not as a candidate proof.

 (e) Leverage. Maximal and shared with Hole 1 — this is stated explicitly as the same object. Closing it
either way (floor-more-fundamental, or strict mutual co-fundamentality) is publishable in the foundations
of quantum theory independent of this program, and inside this program it is the only lever that moves the
root's grade at all. A clean no-go here (showing the ordering cannot be established either way from any
strictly-weaker-than-QM premise) would instead cement co-fundamentality as the permanent, provably-optimal
ceiling — still a valuable, decisive result, just not a promotion.

 Hole 4 — derive Δ₀ from a deeper resource law, or ledger it explicitly as an irreducible residue

 (a) The precise open object. The Uniform Operational Cell Law posits a single, system-independent
constant \(\Delta_0>0\) such that no two stable independently-retrievable records are operationally closer
than \(\Delta_0\) in \(d_{\rm op}\) , for every bounded causal record-support system. The open object is
whether uniformity across all systems (not merely a per-system, possibly \(\eta\) -dependent, floor) can be
derived from some deeper substrate law, or whether it must remain, permanently, a named residue alongside
 \(\hbar\) , \(k_B\) , and the Bekenstein constant. This is distinct from Holes 1–3 (which target existence of a
floor) in that it targets specifically the uniformity clause — the hardest part of the posit, and the
part with a decisive countermodel already banked against the naive resource-only route.

 (b) Why it is hard, and the specific trap. The basin-shallowing countermodel is the reason this is hard,
and it must be understood precisely, not gestured at: populate a bounded landscape ( \(\mathrm{Var}_{\rm
op}(R)\le B\) ) with disjoint stable basins of depths \(d_n=B\cdot2^{-n-1}\) , so that \(\sum_n d_n=B/2<B\) (finite
resource is respected — the total "budget" is not exceeded) yet \(\inf_n d_n=0\) (there is no smallest basin,
hence no uniform floor). The consequence is a genuine theorem, not a heuristic worry: for any fixed
 \(\eta>0\) , only finitely many basins have depth \(\ge\eta\) (since \(\sum d_n<\infty\) ), so the \(\eta\) -dependent
face of total boundedness survives — all that finite resources buy is a per- \(\eta\) finite count — but the
count of all stable records is infinite and there is no smallest record cell, so the uniform floor
face fails outright; the continuum pointer of Theorem A is effectively re-derived one level down, at the
basin-depth level. The trap for a specialist is to think a cleverer resource accounting closes this gap —
it will not, unless the accounting rule itself amounts to declaring a uniform floor, at which point the
"derivation" has just renamed the posit. The both-ends argument already shows why: working backward, a
system-independent \(\Delta_0\) cannot be set by any per-system resource, because basin-shallowing shows
per-system finiteness is compatible with \(\inf=0\) ; it must be one universal constant of the record-keeping
substrate itself. Working forward, finite resources give only per-system total boundedness. The two only
meet at "there is one universal action/resolution quantum shared by all record systems" — which is 
restating "ℏ exists as structure," not reducing it. That convergence-without-reduction is the structural
signature of a genuinely irreducible root, and a specialist should recognize it as such rather than keep
searching for a resource-accounting trick.

 (c) What closes it, target-blind, with success/refutation criteria. Two admissible outcomes, both
legitimate closes: (i) derivation — a deeper substrate law (not itself equivalent to positing a uniform
floor) that forces one universal \(\Delta_0\) across all bounded causal record-support systems, checked
explicitly against the basin-shallowing construction to confirm the new law excludes it as a live
counterexample; success criterion is that the law must apply before any system-specific basin-depth
structure is chosen, ruling out a landscape with \(\inf_n d_n=0\) by construction from strictly
weaker premises than "there is a uniform floor." (ii) documentation — if no such law is found (the
default expectation given the decisive countermodel already on record), the close is explicitly
 documentary , not a failure: state plainly that the reframe traded one residue (the raw cost floor
 \(\varepsilon\) ) for a better-motivated pair (a resolution floor \(\Delta\) plus a completeness/compactness
hypothesis), and keep the full residue ledger — \(\{\hbar, k_B, \text{Bekenstein constant}, \Delta_0,
\text{completeness}\}\) — explicit and complete. The one trap to flag for any write-up of this hole: 
never claim the reframe "eliminated" a constant; it relocated and better-motivated one, and overstating
that as elimination is exactly the overclaim the discipline forbids.

 (d) Starting machinery. The relevant starting objects are the basin-packing sufficiency lemma (finite
 \(\mathrm{Var}_{\rm op}(R)\le B\) , each stable record needing a robustness basin of depth \(\ge\Delta\) , disjoint
depth- \(\ge\Delta\) basins for pairwise-resolvable records give \(N\cdot\Delta\le B\Rightarrow N\le\lfloor
B/\Delta\rfloor<\infty\) , hence FTC with \(M\lesssim(B/\Delta)^2\) ) and its exact failure mode under
basin-shallowing. A specialist should also carry, as background not as an input to the derivation, the
semiclassical shadow \(N\approx V/\hbar^n\) (the statistical-mechanics / Bohr–Sommerfeld / Bekenstein-style
realization of the same counting with \(\hbar\) as the specific cell size) — this is the value the
structure is expected to reproduce as a residue if \(\Delta_0\) is ever pinned, but it must never be used as
an input to derive \(\Delta_0\) 's existence, since that would be circular (assuming the value to derive the
structure).

 (e) Leverage. Lower than Holes 1–3: even a full positive close of Hole 4 (a genuine derivation of
uniformity) would still leave the value of \(\Delta_0\) (≈ ℏ in spectral units) as a residue by
Buckingham-π — no dimensionful number is ever manufactured from dimensionless structural inputs, on this
root or any other in the corpus. So Hole 4's leverage is confined to structure (whether uniformity itself
is named or derived), never to magnitude . Its main value is bookkeeping integrity: whichever way it
resolves, it keeps the residue ledger honest and prevents a quiet, unearned "constants eliminated" claim
from entering the record.

 Hole 5 (cross-gate, vacuum-energy magnitude) — the canonical, regulator-free ½Σλ over the frozen K₆ spectrum

 (a) The precise open object. This hole is where the granularity root's cost-floor language meets the
frozen 13D geometry directly, and it must be stated with all three layers pinned. The × Stage object is the
K₆ = SU(3)/T² factor at the Einstein center \(\vec u=(1,1,1)\) , Killing-form normalization, with quadratic
Casimir \(C_2(p,q)=(p^2+q^2+pq)/3+(p+q)\) and dimension \(\dim(p,q)=(p+1)(q+1)(p+q+2)/2\) for each irrep
labeled by Dynkin indices \((p,q)\) ; the lowest nonzero eigenvalue is \(C_2(1,1)=3\) (the adjoint, \(\dim=8\) ).
The ⊕ Rulebook object is the zero-weight multiplicity rule \(m_0(p,q)\) needed to project the full
representation content down to the scalar (zero-weight) sector that actually appears in the Peter–Weyl
decomposition \(L^2(K_6,E_\mu)=\bigoplus_{(p,q)}V_{(p,q)}\otimes\mathrm{Hom}_{T^2}(V_{(p,q)},E_\mu)\) . The ⊗
Actors object is the regularized vacuum sum \(\rho_{\rm vac}=\tfrac12\sum_n\lambda_n\) over the actual finite
frozen spectrum, to be built with no free regulator — i.e. a canonical continuation (the
 \(\zeta_{K_6}(-1)\) analytic continuation, or equivalently the \(d=6\) scalar \(a_4\) Seeley–DeWitt heat-kernel
coefficient already available as \(a_4/a_0=11/120\) at the Einstein center) rather than an ad hoc cutoff.

 (b) Why it is hard, and the specific trap already caught. The named blocker is the zero-weight
multiplicity \(m_0(p,q)\) itself: all 35 K₆ modes in the working atlas are flagged
BLOCKED_MISSING_ZERO_WEIGHT_MULTIPLICITY, meaning \(m_0\) has not actually been supplied for the modes that
matter. A specific candidate formula — \(m_0(p,q)=\min(p,q)+1\) if \((p-q)\bmod3=0\) , else \(0\) — was asserted
as "verified on 3 known irreps" in an earlier pass, and this is a caught fabrication : the frozen status
explicitly marks all 35 modes as blocked on exactly this missing ingredient, so a rule that was supposedly
already verified cannot simultaneously leave every mode it would apply to unresolved. The downstream
arithmetic that used it — mode count \(N=2920\) , \(\sum\deg\cdot C_2=76416\) , \(\tfrac12\sum=38208\) — reproduces
correctly as arithmetic but rests on the unverified \(m_0\) rule, and must not be presented as
"computed"; it is a conditional number resting on a named open blocker. The general trap for a specialist:
do not re-derive \(m_0(p,q)\) by pattern-matching a handful of low-lying irreps and declaring the pattern
verified — the Peter–Weyl zero-weight multiplicity is a representation-theoretic fact about the weight
lattice of \(SU(3)\) restricted to \(T^2\) -invariants, and it must be derived from the actual weight-multiplicity
structure (Kostant's formula or direct weight-diagram counting on the \(A_2\) root system), not guessed from
a small- \((p,q)\) table and extrapolated.

 (c) What closes it, target-blind, with success/refutation criteria. Closes by (i) a canonical
regularized \(\tfrac12\sum\lambda_n\) built via the \(\zeta_{K_6}(-1)\) analytic continuation, or equivalently
via the \(d_6\) scalar \(a_4\) Seeley–DeWitt coefficient route, (ii) a referenced (derived from the \(A_2\) 
weight lattice, not asserted) zero-weight multiplicity rule for every \((p,q)\) appearing below the cutoff,
and (iii) the correct graded (spin- \(\mathbb C\) ) sector sign, since fermionic and bosonic zero-point
contributions enter \(\rho_{\rm vac}\) with opposite sign and the spin- \(\mathbb C\) structure on \(K_6\) (fixed
to reproduce the family index \(\chi(K_6,E)=-3\) ) determines which sectors carry which sign. Success
criterion / what a refuting result looks like are already stated as the same outcome, because this hole is
a designed negative control, not a hoped-for positive one: using the frozen operator native scale
 \(M_{\rm cutoff}=1/R_0=6.28\times10^{16}\) GeV, the naive estimate \(\rho_{\rm vac}\sim M_{\rm cutoff}^4=
1.56\times10^{67}\,{\rm GeV}^4\) misses the observed dark-energy density \((2.3\ {\rm meV})^4=2.80\times
10^{-47}\,{\rm GeV}^4\) by \(10^{113.7}\) (reproduced to two decimal places: \(113.74\) ). A single granularity
scale supplies exactly one transmutation exponent — the mass-gap analogue gives \(\ln(M_{\rm
cutoff}^4/\Lambda_{\rm YM}^4)=161.2\) with \(\Lambda_{\rm YM}\sim0.2\) GeV — but reaching the meV scale needs a
 second , independent \(\sim262\) -decade exponent ( \(\ln(M_{\rm cutoff}^4/{\rm meV}^4)=261.9\) ), which one
granularity scale cannot supply. Carrying the calculation through with the honestly-completed spectrum is
expected to land near the predicted \(\rho_{\rm vac}\sim\Lambda_{\rm YM}^4\sim1.6\times10^{-3}\,{\rm GeV}^4\) ,
about \(10^{44}\) too large versus \(({\rm meV})^4\) — this outcome, if reproduced with the completed
spectrum, is itself the successful, valid close : it confirms that granularity makes the vacuum energy
 finite (a genuine achievement — no divergence) while relocating , not solving, the cosmological
constant's smallness, which is exactly the honest, target-blind verdict already on record. A result that
instead lands within a few orders of \(({\rm meV})^4\) using only the ingredients above (no new suppression
mechanism, no fitted prefactor) would be the surprising, decisive alternative outcome and should be treated
with extra scrutiny for smuggled fitting before being believed.

 (d) Starting machinery. Begin from the Peter–Weyl decomposition and the frozen representation data
table (Dynkin labels \((p,q)\) , \(\dim(p,q)\) , \(C_2(p,q)\) for the low-lying irreps through at least \((3,3)\) ),
combined with the heat-kernel product rule \(a_{2k}(M_1\times M_2)=\sum_{i+j=k}a_{2i}(M_1)a_{2j}(M_2)\) and
the already-certified scalar ratios on \(K_6\) ( \(a_2/a_0=5/12\) , \(a_4/a_0=11/120\) , both Killing-norm at the
Einstein center). The zero-weight multiplicity itself should be built from the \(A_2\) weight lattice
directly: simple roots \(\alpha_1=(1,-1,0)\) , \(\alpha_2=(0,1,-1)\) , Weyl group \(S_3\) of order 6, and Kostant's
multiplicity formula (or direct weight-diagram enumeration) restricted to the zero weight of the
 \((p,q)\) -irrep — this is the rigorous replacement for the caught-fabricated pattern-matched rule. The graded
sign should be fixed from the same spin- \(\mathbb C\) structure (Chern class fixed to reproduce \(\chi(K_6,E)=
-3\) ) already used to route family chirality elsewhere in the arena, keeping the calculation internally
consistent with the rest of the frozen geometry rather than introducing an independent sign convention.

 (e) Leverage. Confirms (does not create) the RELOCATES verdict on the cosmological constant problem: a
completed calculation is expected to firm up, not overturn, the existing conclusion that granularity
resolves the UV divergence of the vacuum energy (a real result) while leaving its smallness an open,
separately-hard problem (a second, unrelated ~262-decade exponent). The only way this hole would feed back
onto the R1 granularity grade itself is if the completed spectrum produced a built-in suppression
mechanism — e.g. a spin- \(\mathbb C\) index of \(-3\) acting as a genuine cancellation, or a kernel-dimension
effect — landing naturally near \(10^{-122}M_{\rm Pl}^4\) with no new free parameter; this is flagged
explicitly as the one outcome worth watching for, while cautioning that any such finding must be checked
hard against smuggled fitting before being taken seriously, and that no such mechanism is claimed or
expected here.

 Hole 6 (cross-gate, mass-gap survival) — a uniform-in-lattice-spacing lower bound on the pure-glue spectral gap

 (a) The precise open object. "Discrete spectrum ⇒ positive gap" is the easy direction and is not what
is open. The open wall is the uniform-in- \(a\) (lattice spacing) lower bound that survives the continuum
limit and lands on ordinary \(SU(3)_c\) : build the finite positive operator \(H\) on the pure-glue
( \(\mathbb Z_6\) -center) projection of \(K_6\) in the smallest \(R_0\) -fixed truncation, and verify (i) the lowest
nonzero eigenvalue \(\lambda_1>0\) and bounded below as the truncation dimension grows toward the cutoff
 \(M_{\rm cutoff}=1/R_0=6.28\times10^{16}\) GeV (i.e. the gap is a genuine feature of the continuum theory, not
a truncation artifact that would close as the truncation is refined), and (ii) the target inequality
 \(z_*:=\sum_{\gamma\ne0}w(\gamma)<1/(\mathcal E_{\rm conn}\cdot A_{\rm fluc})\) holds uniformly through the
marginal band \(g(2^na)=O(1)\) , using ordinary 4D pure-glue \(SU(3)\) lattice block data.

 (b) Why it is hard, and the specific trap. The named obstruction is that the weight \(w(\gamma)\) is
 convention-underdetermined at the floor : three natural, individually circularity-clean readings of the
same quantity disagree. The per-distinct-letter reading diverges (ill-posed as the bin width \(\to0\) ); the
per-site intensive reading gives \(z_*=0.109\) (passes the inequality, using \(\mathcal E_{\rm conn}=e\cdot7=
19.03\) , \(A_{\rm fluc}=0.05264\) , \(s_{\rm block}=1.0413\) , so the threshold \(1/(\mathcal E_{\rm conn}\cdot A_{\rm
fluc})=0.998\) ); the single-effective-activity reading \(e^{-s_{\rm block}}=0.353\) also passes. The empirical
lattice anchor used for calibration is \(\beta=6.0\) , \(L=4\) , average plaquette \(\langle P\rangle=0.59639\pm
0.00219\) against the reference value \(0.5937\) — a genuinely reproduced anchor, not a fabricated one. The
trap for a specialist is twofold: first, the alphabet defining \(w(\gamma)\) must be built only from local
gauge-invariant block data (plaquette-type observables, Wilson loops, block-spin renormalization group
variables) and never from energy eigenstates directly, because defining the certificate alphabet in terms
of the spectrum's own eigenstates assumes the gap it is trying to prove — a circularity that would silently
smuggle the answer in. Second, the ⊕ Rulebook object \(F^+\) (the finite chamber selecting the pure-glue
 \(SU(3)_c\) target) is inert here — it selects which gauge sector is being examined but supplies no
constructive lever for computing \(w(\gamma)\) or closing the convention-underdetermination; a specialist
should not expect \(F^+\) machinery to resolve the disagreement between the three readings.

 (c) What closes it, target-blind, with success/refutation criteria. Closes by resolving the
convention-underdetermination among the three readings of \(w(\gamma)\) in favor of one that is
 independently motivated (e.g. by matching to a standard renormalization-group block-spin construction
rather than chosen because it passes), and then verifying both : (i) \(\lambda_1\) stays bounded away from
zero as the truncation dimension increases toward \(M_{\rm cutoff}\) (ruling out a truncation artifact), and
(ii) the specific numerical target
$$
\lambda_1 = M_{\rm cutoff}\cdot\exp!\big(-2\pi/(b_0\alpha)\big)\ \in\ [0.1,\,0.3]\ {\rm GeV}
$$
using only the frozen coupling \(\alpha(M_U)\) and the \(SU(3)\) one-loop coefficient \(b_0\) (already fixed by
the frozen beta-function data, \(b_3^{\rm SM}=-7\) in the GUT-normalized convention, with the KK-threshold
corrections \(\delta_3=-1.7313\) already tabulated), with no fitted prefactor . Success criterion: the
computed \(\lambda_1\) lands in \([0.1,0.3]\) GeV using only these frozen inputs. Refuting close, stated
explicitly: \(\lambda_1\to0\) in the continuum limit (the gap is a truncation artifact, not physical), or a
computed value clearly outside \([0.1,0.3]\) GeV even with the convention-underdetermination resolved
correctly — either outcome is a decisive, valid close in the negative direction, and would mean the
granularity-to-mass-gap route (Gap-02) does not deliver a working Yang–Mills mass gap from this
construction, a real and useful negative result rather than a failure to report.

 (d) Starting machinery. Start from the certified \(K_6\) representation data (Casimirs \(C_2(p,q)\) ,
dimensions, the lowest nonzero eigenvalue \(C_2(1,1)=3\) on the adjoint) and the KK mass formula
 \(m^2_{(p,q),{\rm vec}}=(C_2(p,q)+\Delta_{\rm vec})/R_6^2\) as the natural candidate spectral generator for
 \(H\) , restricted to the \(\mathbb Z_6\) -center-invariant (pure-glue) sector. Cross-check any candidate
 \(w(\gamma)\) construction against ordinary lattice gauge theory block-spin renormalization group variables
(Wilson-loop expectation values, plaquette actions) using the already-available calibration point
 \(\beta=6.0\) , \(L=4\) , \(\langle P\rangle=0.59639\pm0.00219\) vs. the reference \(0.5937\) , since this is the one
point in the construction with a genuine external empirical check already passed. The running coupling
input for the final numerical target should come from the frozen two-loop RG trajectory anchored at
 \(M_Z=91.1876\) GeV and unified at \(M_U=1.0\times10^{16}\) GeV with residual \(9.6\times10^{-11}\) , using the
tabulated \(SU(3)\) threshold packet \(\delta_3=-1.7313\) .

 (e) Leverage. This is the granularity root's most direct bridge to a genuinely famous open problem (a
mass gap for pure Yang–Mills), so a positive, non-circular close would be a major result for the geometric
program generally, not merely a granularity footnote — the mass-gap survival test recruits the granularity
floor's KK spectral structure as the mechanism. A refuting close is equally valuable and equally
legitimate: it would show precisely where the geometric-KK-spectrum route to the mass gap breaks, sharpening
Gap-02 without touching the R1 granularity grade itself, since — as stated at the top of this section — the
granularity root's own REDUCED-TO-AXIOM status does not depend on Holes 5–6 either way; they are named,
tracked cross-gate consequences, not load-bearing legs of the R1 closure.

 Summary: what a specialist should attack first

 Holes 1 and 3 are the same object and carry by far the largest leverage — either would move the root's
grade, and both are honestly rated at roughly 15–20% odds of a flip on any given framework attempt, which
is a real, fundable, hard-but-tractable research target, not a rhetorical gap. Hole 2 is a smaller,
more tractable sub-question that would still leave the uniformity clause (Hole 4) open even if fully solved.
Hole 4 has a decisive countermodel already in hand (basin-shallowing) and should be treated by most
specialists as a bookkeeping target (keep the residue ledger honest) rather than a live derivation target,
absent a genuinely new idea for a substrate law that survives the countermodel by construction. Holes 5 and
6 are cross-gate computation debts, not R1 legs: Hole 5 is a designed negative control whose expected
outcome (confirming RELOCATES on the cosmological constant) is itself the successful close, contingent on
finishing an honest (not fabricated) zero-weight multiplicity calculation; Hole 6 is a genuine open
numerical target with a stated, checkable success window and an equally legitimate negative outcome. None
of Holes 1–6 can retroactively reopen the R1 terminal itself — REDUCED-TO-AXIOM / ANCHORED +1 is the
correctly and honestly reached floor of what bounded-resource reasoning plus the two decisive countermodels
can deliver today; these six holes are the map of exactly where a future result could move that floor,
and in which direction.

 Honest ceiling, scope & the endpoint

 This closing section does three things and does them in order, because the order is itself part of the discipline: first it draws the bright lines around what is explicitly not claimed, stated so plainly that a hostile reader can check each one against the derivation chain in under a minute; second it itemizes the anchors actually paid, with nothing folded silently into a conditional; third it states the endpoint in the exact closing form the gate requires, naming either "nothing left" or the smallest remaining named object. The grade is fixed for this dossier at REDUCED-TO-AXIOM / ANCHORED +1 , and nothing below moves it — up or down.

 A. What is explicitly NOT claimed

 The single biggest failure mode for a gate like this is quiet inflation: a "dissolved" question gets misread as a "solved" one, a selection among options gets misread as a derivation of the selected option, or a downstream object that is merely given gets misread as derived . Each bright line below names one such trap and states, without hedging, that this dossier does not cross it.

 1. Dissolved ≠ solved. No question on this root has been dissolved in the technical sense used elsewhere in this program — there is no claim here that "granularity" turns out to be an artifact of an impossible distinction, a false-freedom smuggled in by an under-constrained convention, a 4D projection of a higher-dimensional non-question, or a missing-ledger bookkeeping error. All four of the standard dissolution routes (impossible-distinction → granularity; fake-freedom → constraint; 4D-artifact → projection; missing-ledger → artifact) were checked as live hypotheses for this exact root at the start of the attack, and none of them fired: the delta-test and basin-shallowing countermodels are not artifacts of a bad question, they are theorems about a well-posed one. Granularity is not a unicorn to be dissolved; it is a genuine structural fact — that a positive floor exists — which has been reduced , not dissolved. The one item on this root that genuinely does dissolve is the strict-irreducibility unicorn (discussed under the ceiling below): that is a universal negative that evaporates under the four-filter test, and it is the only object on this root entitled to the word "dissolved." The floor's existence itself is not in that category and must never be described that way.

 2. Selection ≠ derivation. The Uniform Operational Cell Law is named , not selected from a menu of otherwise-equally-good alternatives and then justified after the fact. This distinction matters because the Pontryagin-type relocation (§3.8 of the derivation chain) could be misread as "the theory selects uniformity because it is the natural/elegant/minimal choice among cell laws" — a selection argument dressed up as a derivation. That is explicitly refused here. The relocation shows that the uniformity requirement can be re-expressed as compactness of a generating phase on a closed circle (an "iff," not an implication in one preferred direction), but re-expressing a posit in a different but logically equivalent vocabulary is not deriving it, and deriving that phase-compactness from unitarity would be circular — it would place granularity downstream of quantum mechanics, exactly the circle the whole program exists to break. So: the Uniform Operational Cell Law is not "the natural choice among cell laws that fits the data best." It is the one candidate structural statement, out of the space of statements that could close the FTC gap, that the two banked countermodels leave standing, and it is asserted as a posit , honestly labeled as such, not smuggled in as if chosen by some antecedent selection principle. Posit-count = ONE is a headcount, not a minimality argument, and the dossier does not claim minimality has been proved — only that no smaller posit was found to work, which is a different and weaker (and honest) statement.

 3. Given-E ≠ derivation-of-E. This bright line is inherited directly from the three-layer bundle discipline used throughout the arena and applies here in its purest form. Wherever this dossier writes down an endomorphism, an operator, or a residue value and treats it as an input to a downstream conditional, that is flagged as given , never as derived from the granularity root . Concretely: ℏ is given as the measured size of the floor — it is not derived from the Uniform Operational Cell Law, and the Uniform Operational Cell Law does not predict, bound, or constrain its numerical value in any way; the law is satisfied by some positive Δ₀, and the identification Δ₀ ↔ ℏ (in the appropriate spectral units) is a residue matching , not a computation. Likewise the completeness (Cauchy-closure) hypothesis inside Theorem B is given — posited as an additional closure property of the space of physically retrievable records — and is never presented as something the compactness argument derives; it sits on the residue ledger exactly like Δ₀ itself. And the cost currency B = action/energy·time is a declared convention (the ⊕-layer rulebook choice), not a derived necessity — the relabel guard exists precisely because the alternative convention B = bits would make N ≤ 2^B true by assumption of the conclusion , and the dossier is explicit that choosing the honest currency, rather than the one that trivializes the theorem, is a rulebook decision, not a proof.

 4. Structure ≠ value, restated as a bright line. Nothing here claims to derive the numerical value of ℏ (≈ 1.0546×10⁻³⁴ J·s), k_B, the Bekenstein constant, or Δ₀. The claim is exhausted by existence : that a positive, universal floor exists at all. Asking this root to also produce the number 1.0546×10⁻³⁴ J·s from pure structure is a category error — on exactly the same footing as asking why M_Pl carries the numerical value 1.2209×10¹⁹ GeV rather than some other value. Both are "just is" residues, conceded once and carried on the ledger, never re-attacked as if they were open problems of this root.

 5. No spacetime discreteness. This dossier does not claim, anywhere, that there is a smallest length . The floor is a floor on a Lorentz- scalar cost (action, or information measured in nats/bits) — never on a spatial interval. A length floor would single out a preferred inertial frame (lengths Lorentz-contract; a "smallest length" in one frame is not the smallest length in a boosted frame), which is the standard, well-known, and fatal objection to naive spacetime-lattice discreteness proposals. The cost-floor reframe used throughout this root pays that bill for free precisely because it never asserts a length floor in the first place — action and information transform as scalars under Lorentz boosts, so a floor on either is frame-independent by construction, not by a separate symmetry argument bolted on afterward. Guard G3 (spacetime discreteness) is checked explicitly against every step of the derivation chain and is never tripped: no Hilbert space, no trace, no Born rule, no uncertainty-principle input is used anywhere in deriving T5, Theorem A, Theorem B, or the basin-packing sufficiency lemma; the semiclassical count N ≈ V/ℏⁿ and the uncertainty relation appear only as downstream confirmatory shadows of the completed structure, never as inputs that could be accused of assuming what is being derived.

 6. No thermal smuggle, no compactness smuggle, no Bekenstein smuggle. Three further guards are checked and passed, and each is worth stating as a distinct non-claim because each names a specific way this kind of argument commonly goes wrong in the literature. There is no thermodynamic input anywhere in the chain: the stability arguments underlying basin-packing and basin-shallowing are pre-thermodynamic, built from deterministic basin depth and finite total variation, with no temperature, no bath, no entropy production invoked at any stage (guard G4). Compactness of the record space is never assumed at the root and then used to "derive" the floor in a circular loop — it is derived, conditionally, from the finite test-compression law plus completeness, via the explicit finite-net construction of Theorem B (guard: no-compactness-smuggling). And the Bekenstein bound, along with Margolus–Levitin and Landauer, is used throughout this dossier strictly as confirmation from an independent, already-quantum framework , never as an input to the chain that produces T5, Theorem A, Theorem B, or the cell law — each of those three established results carries ℏ (or k_B) inside its own statement and would make the derivation circular if used as a premise (guard: no-Bekenstein-smuggling). All three guards are stated here not as a formality but because each corresponds to a specific, tempting, and specifically-refused shortcut that would have made the reduction look stronger than it is.

 7. No claim of strict irreducibility. This is the largest and most important non-claim, and it is treated separately, below, as the honest ceiling rather than folded in as just one more bullet — because it is not a hole in this program's execution, it is a hole in what any program, in any field, could ever close.

 B. The anchors paid

 Every reduction has a price, and the discipline this dossier follows is to list that price in full rather than let any of it disappear silently into a conditional. The complete, non-silent ledger for this root is:

 The one named posit (value-free). 
$$
\textbf{Uniform Operational Cell Law:}\quad \exists\, \Delta_0 > 0 \text{ such that no two stable, independently-retrievable records of any bounded causal record-support system are operationally closer than } \Delta_0 \text{ in } d_{\rm op}.
$$
This is the entire structural price of the reduction. It names a universal constant and a role for it; it fixes no numerical value and mentions ℏ nowhere in its statement, which is exactly what lets it pass the no-target-loading test (a posit stated in terms of the very quantity it is meant to explain would be circular by construction). Posit count for this gate: ONE , not zero — the "zero posits" outcome was the live promotion risk this program identified and explicitly refused to claim.

 The one atomic measured anchor. 
$$
\hbar \approx 1.0546\times10^{-34}\ \text{J·s (reduced)},
$$
the measured action spacing, entering as the value of the floor named by the posit above. This is the single genuinely atomic object charged to this root — a directly measured invariant, not derived, not fit, not back-solved. Its pull is definitionally "none": it is an input, never a prediction, and no step in the derivation chain uses it to produce any other number on this root. It is carried on exactly the same footing as the four frozen headline anchors of the wider 13-dimensional construction, {M_Pl = 1.2209×10¹⁹ GeV, α_i(M_Z), y_t, |V_us|} — a fifth, structurally distinct kind of primitive (a structural fact shadowed by a residue value, rather than a single number to be fit), but an anchor all the same.

 The completeness (Cauchy-closure) hypothesis — a genuine extra assumption, tracked explicitly. Theorem B's proof that finite test-compression plus completeness implies compactness is a valid proof, but the completeness hypothesis — that the space of physically retrievable records R_phys is closed under d_op-Cauchy limits — is an assumption in its own right, not a consequence of finite test-compression. Total boundedness (which FTC alone delivers, via the explicit finite 3η-net construction) does not by itself give compactness; the extra closure property is required and is charged, in full, to this ledger. This is a referee-caught hidden hole from earlier drafts of this program's record, and it is stated here exactly as flagged: it belongs on the residue ledger, not folded silently inside "Theorem B ⇒ compactness" as if it came for free.

 The declared cost-currency convention. B = action or energy·time, fixed as the ⊕-layer rulebook choice throughout, is a convention, not a theorem. It is charged here because choosing it correctly (rather than the alternative B = bits, which trivializes the finiteness bound as N ≤ 2^B by assuming a finite record capacity) is itself a rulebook decision that must be named, not a free structural fact.

 The full residue ledger, carried together and never silently dropped: {ℏ, k_B, the Bekenstein constant, Δ₀, the completeness hypothesis}. The reframe carried out on this root trades one residue (a bare cost-floor ε) for two (a resolution floor Δ₀ and the completeness hypothesis needed to promote total boundedness to compactness) — this is a better-motivated relocation of the residue, not its elimination , and Hole 4 of the open-problem ledger exists specifically to prevent this trade from being mis-sold as a reduction in the number of "just is" constants the theory needs. It is not: the count of irreducible residues on this root did not shrink; what shrank is the number of structural posits needed to organize those residues, from an unexamined blanket assumption ("quantum mechanics is quantized, full stop") down to one named, checkable, value-free law.

 What was explicitly NOT charged to this ledger, because it was won rather than paid for. The surface distinguishability circularity — the worry that "distinguishable" already presupposes Hilbert-space orthogonality — is broken, not paid around, by the pre-Hilbert operational metric d_op, which is well-posed using only records, admissible tests, and outcome frequencies, with no Hilbert structure anywhere in its definition. This is listed here, on the anchors side, precisely to make clear that it is not a hidden anchor: the classical witness (a measurable space Ω with measurable test functions f: Ω → [0,1], reducing d_op to ordinary total-variation distance, with d_op = 1 for any two distinct points under indicator tests) is a genuine, checkable, zero-cost theorem, not a posit smuggled in under a different name.

 C. Root-independence: why this ledger does not inherit the geometry's price

 One further scope point belongs here because it changes how the anchor ledger above should be read against the wider 13-dimensional construction. This root sits below the frozen arena \(\mathfrak{B}_{\rm active} = \big[\mathcal{M}_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2\big]_\times \oplus \big[\mathcal{F}^+_{\rm finite}\oplus\mathcal{C}_{\rm admiss}\big]_\oplus \otimes \big[\mathcal{E}_{\rm matter}\oplus\mathcal{E}_{\rm gauge}\oplus\mathcal{E}_{\rm Higgs}\oplus\mathcal{E}_{\rm proton}\big]_\otimes\) , \(K_6 = SU(3)/T^2\) , \(D=13\) , rather than as a consequence riding on top of it. Every object this root's derivation chain actually uses — the record space \(D\) , the admissible tests \(T\) , the outcome frequencies \(P(e\mid r,T)\) , the operational metric \(d_{\rm op}\) , the cost functional \(c\) — is defined without reference to \(\mathcal{M}_4\) , \(K_6\) , \(S^2\) , \(S^1_Y/\mathbb{Z}_2\) , the Killing form, the chamber \(F^+\) , or any of the curvature, Casimir, or heat-kernel data pinned elsewhere in this program (Ric \(_i\) = 5/12, Scal = 5/2, \(|{\rm Riem}|^2\) = 23/12 in Killing-norm; \(C_2(1,1)=3\) ; \(R_0 = 1.591549430918954\times10^{-17}\,{\rm GeV}^{-1}\) ; and so on). Both decisive countermodels — the delta-test on \([0,1]\) and the basin-shallowing landscape with depths \(d_n = B\cdot 2^{-n-1}\) — are pure operational-topology / resource-theory constructions that survive with zero modification if the frozen 13D geometry were changed, reparametrized, or replaced entirely. This is stated here, in the anchors section, for a specific reason: it means the granularity ledger above is not implicitly double-charging any of the four frozen headline anchors {M_Pl, α_i(M_Z), y_t, |V_us|} as inputs to this root's own reduction. The one place those anchors do enter is the separate, explicitly-flagged Scale-root screen (where M_Pl is used, via Kaluza–Klein reduction on the frozen arena, to re-express the fundamental granularity scale as \(M_* = 7.467\times10^{16}\) GeV in the full-precision pipeline, or \(6.010\times10^{16}\) GeV under the alternate declared flag-unit volume convention — a spread of roughly a factor 1.2 that is exactly the convention-soft band, bounded by the convention-proof verdict that flipping \(M_*/\bar M_{\rm Pl}\) up to order unity would require Vol \(_9\) to be wrong by a factor of \(40.51^{11} \approx 4.82\times10^{17}\) , far beyond any plausible convention swing of order \((2\pi)^9\pi^3 \approx 4.7\times10^8\) ). That screen is explicitly a derivable sub-question, already answered (where the floor sits: at the compactification/unification scale, not the 4D Planck scale), not a further cost charged to the R1 reduction itself, and it carries its own separate, correctly-labeled PROMOTIONS: 0.

 D. The honest ceiling, stated as a confident testable bet

 The honest ceiling on this root is co-fundamentality , and it is worth stating plainly why that is a ceiling to be claimed with confidence rather than a hedge to be apologized for. The claim this program does not, and structurally cannot, make is strict irreducibility : the assertion that no principle anywhere, in any future theory, in any framework not yet conceived, could ever sit below this cost floor as a still-deeper explanation of its existence. That is a universal negative over an open-ended domain of possible future theories — it has exactly the same logical shape as "there is no smaller particle than the electron" or "no theory will ever explain the fine-structure constant," claims that are unprovable in principle for any root, in any field of physics, at any point in the history of science, because proving them requires exhausting an infinite and unenumerable space of not-yet-invented alternatives. This program rates its own odds of ever establishing strict irreducibility for this root at approximately 0%, and that is not a weakness specific to this reduction — it is the correct epistemic status of every claim of ultimate irreducibility ever made in physics, honestly stated instead of quietly implied. This is the unicorn that genuinely dissolves here, exactly once, and it dissolves as a limit on all knowledge, not a gap in this program's knowledge : no amount of further work on this root, by anyone, could ever convert "co-fundamental" into "strictly irreducible," because the target claim is not the kind of claim that admits proof.

 What survives in place of strict irreducibility, as the real, checkable, falsifiable ceiling, is this: the cost floor sits at-or-below quantum mechanics, thermodynamics, and gravity in the true order of logical implication — meaning it is at least as fundamental as each of those three frameworks, never derivable as a mere downstream consequence of any one of them, though it has not been shown (and may not be showable) to sit strictly below all three simultaneously. This is a bounded, testable claim with a named, finite path to strengthening it: closing Hole 1 (deriving the finite test-compression law from a pre-quantum reconstruction built on a distinguishability test-space plus an additive-cost axiom set — with no Hilbert orthogonality, no trace distance, no Bekenstein bound, and no quantum-field-theory nuclearity imported as an input) is the single largest possible move available on this root, carrying an honestly stated ~15–20% chance of succeeding on any given attempt, and a valid, equally publishable no-go theorem — a rigorous proof that no such weaker derivation is possible — would count as a legitimate close of the question in the other direction, terminally confirming Fork B (the named-posit route) rather than Fork A (a derivation). Both outcomes are wins for the honesty of this ledger; only silence, or a quiet claim of derivation without either outcome having actually been produced, would be a loss. Hole 3 (the co-fundamentality certificate proper) is the same underlying object as Hole 1 under a different framing, and closing either closes both.

 Two further universal-negative shapes are named explicitly here so that neither is mistaken for an open item awaiting ordinary calculation. First, "derive the value of ℏ, k_B, the Bekenstein constant, or Δ₀ from structure alone" is not a plug-able hole in the ordinary sense — it asks for a dimensionful number to be manufactured from dimensionless structural inputs, which no reconstruction of this kind, in any field, has ever delivered or could deliver; it sits outside the scope of what "deriving granularity" could ever mean, on the same footing as deriving the numerical value of M_Pl. Second, "finite resources can never, under any conceivable augmentation, force a uniform floor" is itself an open-ended universal negative if stated that broadly; the bounded, true, and already-banked statement in its place is the basin-shallowing countermodel exactly as constructed — a specific, finite, checkable demonstration that the particular resource bound tested (bounded total variation, Var \(_{\rm op}(R) \le B\) ) is compatible with \(\inf_n d_n = 0\) — not a claim that rules out every conceivable future resource law anyone might propose.

 E. The closing endpoint statement

 Weighing the scaffolding that is proved outright (T5, the classical witness for \(d_{\rm op}\) , the finite 3η-net construction inside Theorem B, the basin-packing sufficiency lemma) against the one honest gap that remains genuinely open (Hole 1/3, the pre-quantum reconstruction that would either derive or rigorously rule out FTC from strictly weaker primitives), the terminal this root has earned, stated plainly and without softening, is:

 REDUCED-TO-AXIOM / ANCHORED +1. 

 The smallest remaining named object owed at the keystone is not a computational debt of the kind that more calculation alone would close — it is a structural object: a pre-quantum reconstruction theorem (or a rigorous no-go ruling one out) built from a bare distinguishability test-space plus an additive-cost axiom set, deriving the inner-product/Hilbert structure needed for Margolus–Levitin, the Landauer bound, and the Bekenstein bound as theorems rather than as inputs. That object is named, bounded, and carries a stated ~15–20% success estimate on any given attempt; it is Hole 1/3 exactly as catalogued, and closing it is the single largest possible future move on this root — but it is not required for the terminal declared here, which stands on its own as the honest current endpoint of the granularity sub-root:

 Nothing left. Anchored on: Shape: the frozen record interface — a bare space \(D\) of distinguishable records, admissible tests \(T\) , and outcome frequencies \(P(e\mid r,T)\) , carrying no metric-geometric content of its own and requiring none of \(\mathcal{M}_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2\) to be stated; Granularity: the Uniform Operational Cell Law, \(\Delta_0 > 0\) , the one named, value-free posit this root reduces to, earned by ruling out its derivation via two decisive, banked countermodels (the delta-test on \([0,1]\) and the basin-shallowing landscape with \(d_n = B\cdot2^{-n-1}\) , \(\sum d_n = B/2 < B\) , \(\inf_n d_n = 0\) ) rather than asserted by fiat; Scale: the floor is on a Lorentz- scalar cost (action or information), never a length, so it picks no preferred frame and carries no independent scale posit of its own on this root — the one place a scale number appears (the compactification scale \(M_* \approx 7.467\times10^{16}\) GeV, re-expressed against the anchor \(M_{\rm Pl}\) ) belongs to the separate, already-answered, non-promoting Scale-root screen, not to this reduction; Observables: \(\hbar \approx 1.0546\times10^{-34}\) J·s, the one atomic measured anchor consumed as the value of the floor, entering with zero pull because it is charged as an input, never produced as a prediction; Dissolution: none is claimed for the floor's existence itself — the only dissolution on this root is the strict-irreducibility unicorn, which evaporates as a universal negative unprovable for any root in any field (rated ~0% by the program's own honest accounting), leaving co-fundamentality, not strict irreducibility, as the true and confidently-claimable ceiling.

 PROMOTIONS: 0. This grade is not upgraded by the scaffolding proved above, and it is not downgraded by the two open holes named above; it is stated once, plainly, and carried forward unchanged.

 Closure ledger — DeepRoot — Granularity / cost-floor

 Status (fixed): REDUCED-TO-AXIOM · ANCHORED +1

 The technical closure LEDGER (separate document)

 Purpose of this document. The narrative dossier makes the case; this ledger is the auditor's record. Every claim below is stated as a discrete, checkable line: an identity, a theorem status, a numerical value with its exact provenance, or a named posit. Nothing here is asserted at higher strength than the derivation chain supports, and nothing here is asserted at lower strength than the fixed grade permits. Fixed grade for this gate, stated once and never varied in what follows: REDUCED-TO-AXIOM / ANCHORED +1. PROMOTIONS: 0. 

 1. Layer-0 wall identity

 Wall name: DeepRoot — Granularity / cost-floor.

 Wall statement. Every physical theory bottoms out on brute assumptions; one of them is that there exists a smallest operational step in nature — a positive floor ε > 0 on the cost of making a distinguishable transition, i.e. a quantum of action. The wall asks whether that floor's existence (not its value) can be derived from something strictly weaker than quantum mechanics, or whether it must be posited as a primitive.

 Wall's position relative to the 13D geometric construction. This is the decisive structural fact about this gate and it governs everything that follows: granularity sits below the frozen 13D arena, not downstream of it. The arena

 \[
\mathfrak{B}_{\rm active} = \big[\mathcal{M}_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2\big]_\times \;\oplus\; \big[\mathcal{F}^+_{\rm finite}\oplus\mathcal{C}_{\rm admiss}\big]_\oplus \;\otimes\; \big[\mathcal{E}_{\rm matter}\oplus\mathcal{E}_{\rm gauge}\oplus\mathcal{E}_{\rm Higgs}\oplus\mathcal{E}_{\rm proton}\big]_\otimes,\qquad K_6=SU(3)/T^2,\ D=4+6+2+1=13,
\]

 is context for this gate, never substrate . The record interface — a space \(D\) of distinguishable records, admissible tests \(T\) , outcome frequencies \(P(e\mid r,T)\) — is the actual load-bearing stage, and it is geometry-free: nothing in the delta-test countermodel, the basin-shallowing countermodel, or the measured residue \(\hbar\) depends on which of the two curvature normalizations of \(K_6\) is used, on the squashing chamber \(\vec u\) , on the orbifold parity assignment, or on any KK spectrum. This is stated explicitly so a reader can attack the right target: attacking the 13D geometry does not touch this root, and reducing this root does not touch the 13D geometry. The frozen branch is read-only and unmutated by this reduction.

 Three-layer pin of the object actually under reduction (× / ⊕ / ⊗), carried as the operative substrate: 

 Layer 
 Content for this gate 

 × Stage 
 \(D\) = space of distinguishable records; admissible test set \(\{T\}\) ; outcome alphabet \(\{e\}\) ; outcome-frequency map \(P(e\mid r,T)\) . No metric factors of \(\mathfrak{B}_{\rm active}\) enter here — this stage is not \(\mathcal{M}_4\times K_6\times S^2\times S^1_Y/\mathbb{Z}_2\) . 

 ⊕ Rulebook 
 Cost currency fixed as \(B=\) action or energy \(\cdot\) time, never bits (the relabel guard, §4 below); "cost" attaches only to transitions between operationally distinguishable records (not merely non-identical ones); no Hilbert/Born/trace-distance convention anywhere in this rulebook. 

 ⊗ Actors 
 Cost functional \(c:D\to\mathbb{R}_{\ge0}\) ; the operational distance $d_{\rm op}(r,s)=\sup_{T,e}\big 

 The 13D arena's own three-layer pin (metric × Stage, finite-admissibility ⊕ Rulebook, bundle/operator ⊗ Actors, per the geometry pack) is carried in §3 below purely as context for one derivable sub-question (where the floor sits in GeV, §7) — it is never the substrate of the R1 reduction itself.

 2. Layer-1 endpoint anchor

 Endpoint reached. REDUCED-TO-AXIOM. The granularity root is compressed to exactly one named, value-free structural posit — the Uniform Operational Cell Law, \(\Delta_0>0\) — sitting beside exactly one genuinely atomic measured anchor — \(\hbar\) , the measured action spacing, entering only as a value ( \(\hbar \approx 1.0546\times10^{-34}\) J \(\cdot\) s), never derived.

 Credit-ladder placement. ANCHORED +1: one full floor-count posit, no more, no fewer. This is not DERIVED (the posit is named, not proved from something strictly weaker — Fork A is ruled out by two countermodels, §5 and §6.5 below) and it is not zero-posit / CLOSED-NEGATIVE-of-the-posit (the "zero posits" claim was the live promotion risk on this root and is explicitly refused, §6.6). The floor between "one posit" and "zero posits" is exactly the credit this gate claims — no more.

 Why the endpoint is stable under review. The posit was earned : the strictly-stronger claim (derive the existence of the floor from finite causal resources alone, no quantum mechanics smuggled in) was attacked directly, and the attack's failure was banked as two decisive countermodels (Theorem A / delta-test, §5.2; basin-shallowing, §6.5), not asserted by fiat. An earned no-go plus a named minimal posit is the textbook signature of a REDUCED-TO-AXIOM terminal, not an open question — the terminal is not "we didn't finish," it is "we proved this is exactly where derivation stops and posit must begin."

 3. Layer-2 root stack

 3.1 Tier A — Shape / Scale / Granularity, full precision

 Granularity (this gate — the root under reduction). The positive cost floor on distinguishable action; reduced to the Uniform Operational Cell Law \(\Delta_0>0\) plus the measured residue \(\hbar\) . Full derivation chain in §5–§6.

 Scale (load-bearing screen for the floor- location sub-question, §7 — a context question, not the R1 closure). By Kaluza–Klein reduction on the frozen 13D arena,
$$
M_{\rm Pl}^2 = M_*^{\,D-2}\,{\rm Vol}(X_{\rm active}),\qquad D=13,\quad X_{\rm active}=K_6\times S^2\times(S^1_Y/\mathbb{Z}_2)\ \text{(9-dim)}.
$$
Using the geometry pack's declared normal-homogeneous flag-manifold convention \(V_{K_6,0}=(2\pi)^3/\sqrt3=143.2118575035129\) , the exact evaluated volumes at the chamber center \(\vec u=(1,1,1)\) , \(R_6=R_2=R_0\) , \(R_Y=R_0/2\) (active, post- \(\mathbb{Z}_2\) ) are:

 \[
{\rm Vol}(K_6)=2.327554010848277\times10^{-99}\ {\rm GeV}^{-6},\quad {\rm Vol}(S^2)=3.183098861837907\times10^{-33}\ {\rm GeV}^{-2},\quad {\rm Vol}(S^1_Y/\mathbb{Z}_2)=5.000000000000000\times10^{-17}\ {\rm GeV}^{-1},
$$
$$
{\rm Vol}(X_{\rm active}) = 3.704417261398702\times10^{-148}\ {\rm GeV}^{-9}.
\]

 With \(M_{\rm Pl}=1.220900000000000\times10^{19}\) GeV (ordinary, not reduced), this gives
$$
M_ ^{11} = \frac{M_{\rm Pl}^2}{{\rm Vol}(X_{\rm active})} = 4.023836152402511\times10^{185}\ {\rm GeV}^{11},\qquad M_ = 7.467050992135091\times10^{16}\ {\rm GeV}.
$$
(An alternate volume-pipeline convention using \(V_{K_6,0}=4\pi^3\) , \({\rm Vol}_9 = 8\pi^5R_0^9=1.6041\times10^{-148}\ {\rm GeV}^{-9}\) , gives \(M_*=6.010\times10^{16}\) GeV \(\approx 6.01\,M_U\) \(= \bar M_{\rm Pl}/40.51\) ; the \(\sim\) factor-1.2 spread between the two pipelines is the declared convention-soft band, tracked explicitly in §7.) In both pipelines \(M_*/M_{\rm Pl}\ll1\) , so the floor — if identified with \(M_*\) — sits at the compactification/unification scale, not the 4D Planck scale; the 4D \(M_{\rm Pl}\) is emergent, diluted up by the large compactification volume. This verdict is convention-proof via the \(1/11\) power (flipping it to \(M_{\rm Pl}\) would require \({\rm Vol}_9\) wrong by \(40.51^{11}\approx4.82\times10^{17}\) , ~9 orders beyond the largest plausible convention swing \(\approx(2\pi)^9\pi^3\approx4.7\times10^8\) ), while the exact value of \(M_*\) in GeV is convention-soft (good to \(\sim\) factor 2). This is a derivable sub-question, answered — it is not a promotion of the R1 root, and R1's own terminal (REDUCED-TO-AXIOM) does not move because of it. PROMOTIONS: 0.

 Granularity is NOT indexed to Scale. The R1 reduction itself (§5–§6) uses none of the above — no \(R_0\) , no \({\rm Vol}(K_6)\) , no \(M_*\) . The Scale screen answers where a floor would sit in GeV if one identifies "floor" with "compactification scale"; it says nothing about whether a floor's existence is derivable, which is the actual content of R1.

 3.2 Tier B screens (G0–G5, no-smuggle guards)

 These are pass/fail firewall screens that the R1 chain is checked against; tripping any one would auto-fail the reduction.

 Screen 
 Content 
 Verdict 

 G0 — constraint granularity 
 Are the admissible constraints themselves discretely enumerable, no continuum-of-constraints smuggle? 
 SUPPORTED 

 G1 — sector-label granularity 
 Are sector labels (record types) discrete, no hidden continuum relabeling? 
 SUPPORTED 

 G2 — spectral gap 
 Is there a positive spectral gap on the relevant operator? 
 RECOGNIZED-OPEN — this is Gap-02 work, a separate cross-gate question (Hole 6, §9), not claimed as part of the R1 closure 

 G3 — spacetime discreteness / smallest length 
 Is a smallest length being claimed? 
 Explicitly NOT claimed. No Hilbert space, trace distance, Born rule, uncertainty principle, or nuclearity used as input anywhere in the chain — \(d_{\rm op}\) only. The uncertainty relation appears solely as an output shadow ( \(N\approx V/\hbar^n\) , §6.7), never as an input. 

 G4 — no thermal smuggle 
 Is a temperature or bath being imported to manufacture the floor? 
 PASS — all stability arguments (basin depth, total variation) are pre-thermodynamic: deterministic basin depth, finite total variation, no temperature, no bath anywhere in §5–§6. 

 G5 — no relabel-via-assumed-capacity 
 Is the budget \(B\) secretly defined as bits (which trivially gives \(N\le2^B\) , assuming the conclusion)? 
 PASS, by explicit guard — \(B\) is kept fixed as action/energy \(\cdot\) time throughout; the bits-relabeling is identified and explicitly refused (§6.4). 

 No-compactness-smuggling 
 Is compactness of \(D\) ever assumed rather than derived? 
 PASS — compactness is derived via Theorem B / basin-packing (§6.3–§6.4), never assumed at the root. 

 No-Bekenstein-smuggling 
 Are holographic entropy counts used as an input? 
 PASS — Bekenstein's bound appears only as an independent confirmation (§8, established literature), never as an ingredient of the derivation chain. 

 4. Measured anchors: role ledger (consumed / reproduced / tested)

 Anchor 
 Value 
 Role on this gate 
 Pull 

 \(\hbar\) (reduced Planck constant) 
 \(\approx 1.0546\times10^{-34}\) J \(\cdot\) s 
 CONSUMED. The only genuinely atomic object on this root. It is the measured size of the operational cell; the Uniform Operational Cell Law is fully statable and meaningful without knowing the numerical value of \(\hbar\) — only the residue value of \(\Delta_0\) turns out to coincide with \(\hbar\) in the semiclassical/spectral realization. Passes the no-target-loading test by construction. 
 None — it is an input value, never a prediction of this root. 

 \(M_{\rm Pl}\) (full, not reduced) 
 \(1.220900000000000\times10^{19}\) GeV 
 CONSUMED only by the Scale screen (§3.1, §7), which is context for the floor-location sub-question, not for the R1 posit-count itself. 
 N/A to R1 proper. 

 \(\alpha_i(M_Z)\) , \(y_t\) , $ 
 V_{us} 
 $ 
 (frozen headline values, geometry pack §1.5) 

 Residue ledger (carried explicitly, never silently dropped). \(\{\hbar,\ k_B,\ \text{Bekenstein constant},\ \Delta_0\}\) , plus the completeness (Cauchy-closure) hypothesis of Theorem B (§6.3). Each is "just is" by construction — existence is what this root claims, value is never derived. \(\Delta_0\) is a new residue introduced alongside \(\hbar,k_B\) : the reframe trades {cost floor \(\varepsilon\) } for {resolution floor \(\Delta\) + compactness}. This is logged explicitly as a better-motivated relocation, not an elimination of a constant (Hole 4, §9) — a trap this ledger refuses to fall into.

 Tested / surfaced falsifiers — cross-gate, explicitly NOT part of the R1 root. These use the granularity machinery but their outcome does not move the R1 grade:
- Λ-magnitude relocation test. Native frozen-operator cutoff \(M_{\rm cutoff}=1/R_0=6.28\times10^{16}\) GeV; naive vacuum density \(\sim M_{\rm cutoff}^4=1.56\times10^{67}\) GeV \(^4\) misses the observed \((2.3\ {\rm meV})^4=2.80\times10^{-47}\) GeV \(^4\) by \(10^{113.7}\) . A single granularity/transmutation exponent explains the mass-gap scale ( \(\ln(M_{\rm cutoff}^4/\Lambda_{\rm YM}^4)=161.2\) ) but cannot simultaneously explain the vacuum energy scale, which needs an independent \(\sim262\) -decade exponent ( \(\ln(M_{\rm cutoff}^4/{\rm meV}^4)=261.9\) ). Predicted \(\rho_{\rm vac}\sim\Lambda_{\rm YM}^4\sim1.6\times10^{-3}\) GeV \(^4\) (with \(\Lambda_{\rm YM}\sim0.2\) GeV) is \(\sim10^{44}\) too large versus \(({\rm meV})^4\) . Verdict: RELOCATES (granularity makes \(\Lambda\) finite, not small — a valid negative close, tracked as CLOSED-NEGATIVE for the "granularity alone explains the cosmological constant" question, which was never an R1 claim).
- Mass-gap survival (Gap-02). Target inequality \(z_*:=\sum_{\gamma\neq0}w(\gamma) < 1/(\mathcal{E}_{\rm conn}\cdot A_{\rm fluc})\) uniform through the marginal band. OPEN , convention-underdetermined at the floor (three natural readings disagree: per-site intensive \(z_*=0.109\) PASS; single-effective-activity \(e^{-s_{\rm block}}=0.353\) PASS; per-distinct-letter reading diverges/ill-posed). This is Hole 6 , cross-gate, explicitly not part of the R1 closure.

 5. The derivation chain as a numbered ledger

 Each step: exact statement, exact value/identity, and credit-ladder grade.

 Step 1 — Reframe: cost, not length. DERIVED (two-line theorem).
- (L1) Gliding through a continuum of non-orthogonal (overlapping) states is free — no cost attaches to non-distinguishable transitions.
- (L2) An infinite chain of orthogonal (distinguishable) transitions, each costing at least a fixed floor, requires infinite total resource and cannot complete under any finite budget.
- \(\Rightarrow\) Any completable (finite-resource) process has finitely many costly (distinguishable) steps.
 Grade: DERIVED (unconditional, from (L1)+(L2) alone).

 Step 2 — Lorentz corollary. DERIVED.
Cost/action/information transform as Lorentz scalars ; a floor on a scalar picks no preferred frame (unlike a length floor, which contracts and so is frame-dependent). This is what allows the reframe to dodge the standard "discrete spacetime picks a frame" objection for free.
 Grade: DERIVED. 

 Step 3 — The pre-Hilbert operational metric. DERIVED / well-posed.
$$
d_{\rm op}(r,s) = \sup_{T,e}\big|P(e\mid r,T)-P(e\mid s,T)\big|.
$$
Defined using only records, tests, outcome frequencies — no Hilbert structure appears in its statement. Classical witness: for \(\Omega\) a measurable space and tests = measurable \(f:\Omega\to[0,1]\) , \(d_{\rm op}\) reduces exactly to classical total-variation distance; for distinct points, indicator tests give \(d_{\rm op}=1\) with no Hilbert structure invoked anywhere.
 Grade: DERIVED. Breaks the surface distinguishability circle (Hilbert orthogonality is downstream of \(d_{\rm op}\) , not its definition). Does not close the deeper certification circle (whether the floor sits at-or-below QM in the implication order) — that remains Hole 3, OPEN.

 Step 4 — T5: the floor from compactness. DERIVED (unconditional, given hypotheses).
$$
\textbf{T5:}\quad \big(D\ \text{compact},\ c\ \text{continuous},\ c(x)=0\Rightarrow x\notin D\big)\ \Longrightarrow\ \varepsilon=\min_D c>0.
$$
 Proof. A continuous function on a compact set attains its minimum (extreme value theorem); the minimizer \(x^*\in D\) satisfies \(c(x^*)>0\) by the pointwise-positivity hypothesis; set \(\varepsilon=c(x^*)>0\) . \(\blacksquare\) 
 Grade: DERIVED , conditional only on its own stated hypotheses (compactness, continuity, pointwise positivity) — a genuine theorem, not a posit. Transfers the entire remaining burden onto: is \(D\) ( \(\equiv R_{\rm phys}\) ) compact?

 Step 5 — T3 target and Theorem A (the compactness attack, and its banked loss). DECISIVE COUNTERMODEL.
T3 target: for a bounded causal record-support system \(R\) (finite extent, finite duration \(\tau\) , finite budget \(B=\) action or energy \(\cdot\) time), is \(R_{\rm phys}\) (admissible stably-retrievable records under \(d_{\rm op}\) ) automatically compact?
 Theorem A (the loss). Classical pointer \(x\in[0,1]\) , records \(r_x\) ; finite extent, finite \(\tau\) , finite energy-time \(B\) (a resting pointer needs no energy scaling with the number of positions). Readout test \(T_{x,y}\) = "is the pointer near \(x\) , excluding \(y\) " gives \(P(e_x\mid r_x,T)=1\) , \(P(e_x\mid r_y,T)=0\) , so \(d_{\rm op}(r_x,r_y)=1\) for all \(x\neq y\) . Then \([0,1]\) under \(d_{\rm op}\) is an uncountable discrete metric space: for any \(0<\Delta\le1\) , every pair is \(\Delta\) -separated \(\Rightarrow N_{\max}=\infty\) \(\Rightarrow\) not totally bounded \(\Rightarrow\) not compact . \(\blacksquare\) 
 Grade: DECISIVE COUNTERMODEL — this is a banked loss for the strong claim ("finite resources \(\Rightarrow\) compactness"), proved, not merely observed. It establishes precisely that Fork A (derive the floor from finite resources alone) fails.
 The precise obstruction, stated as a conditional law that is NOT automatic: 
$$
B<\infty \ \overset{?}{\Longrightarrow}\ \forall\Delta>0,\ N_{\max}(R,\Delta,\tau)<\infty.
$$
Finite extent/duration/energy-time do not by themselves stop arbitrarily sharp readout tests unless a law connects budget to resolution. That law is FTC (Step 6).
 Relabel guard (fires on the tempting easy fix). Defining \(B=\) finite information capacity (bits) gives \(N_{\max}\le2^B\) trivially — but this assumes finite record capacity, which is the conclusion being sought. So: \(B=\) action/energy-time \(\Rightarrow\) T3 genuinely OPEN (the honest, non-circular reading); \(B=\) bits \(\Rightarrow\) RELABEL-FAIL (an illegitimate branch, explicitly refused). \(B\) is kept fixed as action/energy \(\cdot\) time throughout this ledger.

 Step 6 — Lemma FTC (the named target) and Theorem B (compactness, conditional). VALID PROOF (conditional).
 FTC statement. For every bounded causal \(R\) and tolerance \(\eta>0\) there exists a finite test family \(\mathcal{T}_\eta=\{(T_j,e_j)\}_{j=1}^{M(B,\eta,\tau)}\) with
$$
d_{\rm op}(r,s) \le \max_{1\le j\le M}\big|P(e_j\mid r,T_j)-P(e_j\mid s,T_j)\big| + \eta.
$$
 Theorem B. If FTC holds and \(R_{\rm phys}\) is closed under \(d_{\rm op}\) -Cauchy limits (completeness), then \(R_{\rm phys}\) is compact.
 Proof. Fix \(\eta>0\) ; FTC gives a finite \(\mathcal{T}_\eta\) . Define \(\Phi_\eta(r)=(P(e_j\mid r,T_j))_{j=1}^M\in[0,1]^M\) . Cover the (totally bounded) cube \([0,1]^M\) by sup-norm cells of radius \(\eta\) ; one representative per nonempty cell gives a finite set \(\{r_1,\dots,r_K\}\) . Any \(r\) lies in a cell with representative \(r_k\) , so \(\max_j|\Phi_\eta(r)_j-\Phi_\eta(r_k)_j|\le2\eta\) , hence by FTC \(d_{\rm op}(r,r_k)\le3\eta\) . A finite \(3\eta\) -net exists for every \(\eta\) \(\Rightarrow\) totally bounded; totally bounded + completeness \(\Rightarrow\) compact. \(\blacksquare\) 
 Grade: VALID PROOF, conditional on FTC and on completeness.
 The referee-caught hidden hole, tracked explicitly. The completeness (Cauchy-closure) hypothesis is a genuine extra assumption — total boundedness alone does not give compactness. It belongs on the residue ledger (§4) and must never be folded silently inside the "Theorem B closes compactness" statement. This ledger states it here, explicitly, as required.

 Step 7 — Fork B closes: FTC is not derivable from finite resources alone. BANKED LOSS (decisive countermodel).
 Delta-test countermodel (formal version). Admissible binary tests \(f_a(r)=P(e_a\mid r,T_a)\in[0,1]\) , \(d_{\rm op}(r,s)=\sup_a|f_a(r)-f_a(s)|\) . Take \(R=[0,1]\) , tests \(f_x(r)=\mathbb{1}[r=x]\) . For distinct \(r\neq s\) , \(f_r\) separates them \(\Rightarrow d_{\rm op}(r,s)=1\) . For any finite family \(\{f_{x_1},\dots,f_{x_M}\}\) : since \([0,1]\) is uncountable, pick \(r,s\notin\{x_j\}\) ; every selected test returns \(0\) on both \(\Rightarrow \max_j|\cdots|=0\) while \(d_{\rm op}=1\) . So FTC's inequality \(d_{\rm op}\le\max_j|\cdots|+\eta\) fails for every \(\eta<1\) . \(\blacksquare\) 
 Grade: DECISIVE COUNTERMODEL. Finite causal support + finite duration + finite action/energy-time budget do not imply FTC unless the theory already forbids infinitely sharp operational tests. FTC is a finite-resolution law , not a theorem of finite resources. This closes off Fork A (derive granularity) definitively; what remains is Fork B (name the primitive), which is Step 8.

 Step 8 — The named posit: the Uniform Operational Cell Law. AXIOM-CLOSED (named, not proved) — this is the terminal posit of the whole reduction. 

 Uniform Operational Cell Law. There exists a single, system-independent constant \(\Delta_0>0\) such that, for every bounded causal record-support system, no two stable independently-retrievable records are operationally closer than \(\Delta_0\) in \(d_{\rm op}\) , and no stable record occupies an operational cell smaller than \(\Delta_0\) . Equivalently: the record-keeping substrate of reality has one universal positive resolution quantum.
This names a universal quantum and its structural role; it fixes no value and mentions \(\hbar\) nowhere, so it passes the no-target-loading test. Its value ( \(\Delta_0\approx\hbar\) in spectral units) is derived only as a downstream shadow (Step 11), never as an input.
 Grade: REDUCED-TO-AXIOM. This is the single posit that anchors the whole root at +1 (never 0, never \(\ge2\) ).

 Step 9 — Basin-packing: sufficiency of the posit. SOUND CONDITIONAL (no QM/Bekenstein/thermal import).
Given finite total variation \({\rm Var}_{\rm op}(R)\le B\) , and given that each stable record needs a robustness basin of depth \(\ge\Delta\) , pairwise-resolvable robust records have disjoint depth- \(\ge\Delta\) basins, hence
$$
N\cdot\Delta \le B\ \Rightarrow\ N\le\left\lfloor B/\Delta\right\rfloor<\infty,
$$
and therefore FTC follows, with \(M\lesssim(B/\Delta)^2\) .
 Grade: SOUND CONDITIONAL , conditional on the cell law \(\Delta_0>0\) — exactly the one posit named in Step 8, no more. This is honest, not circular: it derives the count \(N\) from the grain \(\Delta\) ; it never derives the grain itself.

 Step 10 — Why the posit must be uniform: the basin-shallowing countermodel. BANKED LOSS (decisive countermodel).
Populate a bounded landscape ( \({\rm Var}_{\rm op}(R)\le B\) ) with disjoint stable basins of depths
$$
d_n = B\cdot2^{-n-1},\qquad n=1,2,3,\dots
$$
so that \(\sum_n d_n = B/2 < B\) (finite resource fully respected), yet \(\inf_n d_n = 0\) — no uniform \(\Delta_0\) . Consequences:
- For any fixed \(\eta>0\) , only finitely many basins have depth \(\ge\eta\) (since \(\sum_n d_n<\infty\) ) \(\Rightarrow\) totally bounded at every fixed tolerance — the \(\eta\) -dependent face of the claim survives; this is all that finite resources ever buy.
- The count of all stable records is infinite and there is no smallest record cell ( \(\inf=0\) ) — the uniform action-floor face FAILS . The continuum-pointer pathology of Theorem A (Step 5) re-appears at the basin level.
 Grade: DECISIVE COUNTERMODEL. This proves — not merely illustrates — that finite causal support + duration + action/energy-time budget + a continuous stability landscape do NOT imply a uniform positive \(\Delta_0\) . The gap between { \(\eta\) -dependent floor} and {uniform \(\Delta_0\) } is a theorem , not a restatement of an available implication, and it is exactly what makes the Step 8 posit honest rather than a hidden restatement of something already implied.
 Both-ends meeting point (why exactly one posit, and why it must be this one). Backward: a system-independent \(\Delta_0\) cannot be set by any per-system resource bound (basin-shallowing shows per-system finiteness is fully compatible with \(\inf=0\) ) — it must be one universal constant of the record-keeping substrate. Forward: finite resources give only per-system total boundedness (Step 9's hypothesis, not its conclusion). These two directions meet only at "there is one universal action/resolution quantum shared by all record systems" — which is the Uniform Operational Cell Law, a new primitive, not a reduction of one. This convergence from both directions onto the identical single statement is the structural signature of a genuinely irreducible root, not an arbitrarily chosen stopping point.

 Step 11 — The value shadow: \(N\approx V/\hbar^n\) . RESIDUE (never derived, only consumed).
The semiclassical state count \(N_{\rm distinguishable}\approx({\rm phase\ space\ volume})/\hbar^n\) realizes the abstract cell law \(\Delta_0\) symplectically, with \(\hbar\) as the cell size. This is the same structural statement as statistical mechanics' phase-space cell, Bohr–Sommerfeld quantization, and the Bekenstein-bound saturation — all consistent, all confirmatory, none of them a derivation of the numerical value \(\hbar\approx1.0546\times10^{-34}\) J \(\cdot\) s.
 Grade: MEASURED-ANCHOR (value only). \(\hbar\) enters here purely as a number; the existence of the floor it measures was established in Steps 4–10 without reference to \(\hbar\) at all.

 Step 12 — Pontryagin relocation (checked, does not change the posit count). AUDIT — relocates, does not eliminate.
Identifying a generating phase on a closed circle with a discrete, equally-spaced action spectrum makes existence-plus-discreteness of the grain inter-derivable with compactness of the underlying phase (a Pontryagin-type "iff"). This relocates the uniformity posit onto phase compactness; it does not eliminate it. Deriving that phase compactness from unitarity would be circular (it would place granularity downstream of quantum mechanics — precisely the circle Step 3 broke on the surface but did not break at depth). 
 Grade: AUDITED — posit count confirmed at ONE, not zero. This step exists in the ledger specifically to close off the "zero posits" promotion risk by name.

 6. Credit-ladder grading — summary table

 Leg 
 Statement 
 Grade 

 Step 1 (reframe) 
 cost not length; (L1)+(L2) \(\Rightarrow\) finitely many costly steps per completable process 
 DERIVED 

 Step 2 (Lorentz corollary) 
 scalar cost floor picks no frame 
 DERIVED 

 Step 3 ( \(d_{\rm op}\) ) 
 pre-Hilbert operational metric, classical TV witness 
 DERIVED / well-posed 

 Step 4 (T5) 
 \(D\) compact + \(c\) continuous + pointwise-positive \(\Rightarrow \varepsilon=\min_D c>0\) 
 DERIVED (unconditional given stated hypotheses) 

 Step 5 (Theorem A) 
 finite resources \(\not\Rightarrow\) compactness; delta-test on \([0,1]\) 
 CERTIFIED-IRREDUCIBLE-STYLE BANKED LOSS (decisive countermodel to Fork A) 

 Step 6 (Theorem B) 
 FTC + completeness \(\Rightarrow\) compact, explicit \(3\eta\) -net 
 DERIVED-GIVEN-{FTC, completeness} (valid conditional proof) 

 Step 7 (FTC countermodel) 
 finite resources \(\not\Rightarrow\) FTC; \(\mathbb{1}[r=x]\) on \([0,1]\) 
 DECISIVE BANKED LOSS (closes Fork A definitively) 

 Step 8 (Uniform Cell Law) 
 \(\Delta_0>0\) , system-independent 
 REDUCED-TO-AXIOM (the terminal posit, count = 1) 

 Step 9 (basin-packing) 
 \(\Delta_0>0 \Rightarrow N\le\lfloor B/\Delta\rfloor<\infty \Rightarrow\) FTC 
 DISSOLVED-GIVEN-{Step-8 posit} (sound conditional, no QM/Bekenstein import) 

 Step 10 (basin-shallowing) 
 finite resources \(\not\Rightarrow\) uniform \(\Delta_0\) 
 DECISIVE BANKED LOSS (proves uniformity is the real content of Step 8) 

 Step 11 ( \(N\approx V/\hbar^n\) ) 
 value shadow 
 MEASURED-ANCHOR ( \(\hbar\) , atomic, terminal as a measured anchor) 

 Step 12 (Pontryagin) 
 relocates uniformity posit onto phase compactness 
 AUDITED — posit count reconfirmed at ONE 

 Root roll-up (R1) 
 granularity existence, full chain 
 REDUCED-TO-AXIOM / ANCHORED +1 

 Reading the ladder. Every DERIVED step is an unconditional theorem given its own explicitly stated hypotheses — none of them smuggle in the posit they are used alongside. The two BANKED LOSS entries are not failures of this program; they are the proof, run and reported honestly, that Fork A (derivation) is unavailable — which is precisely what licenses Step 8's posit as earned rather than assumed. The one REDUCED-TO-AXIOM entry (Step 8) is the entire credit this root claims: one named, value-free, universal posit. The one MEASURED-ANCHOR entry (Step 11 / \(\hbar\) ) is the entire empirical content this root consumes: one atomic, directly measured constant, entering only as a value.

 7. The Scale-root cross-check (context, not part of the R1 grade)

 Restated here as a self-contained numerical block per the grounding brief's instruction that this sub-question be answered but never bleed into the R1 grade.

 $$
R_0 \equiv (2\pi M_U)^{-1} = 1.591549430918954\times10^{-17}\ {\rm GeV}^{-1},\qquad M_U=1.0\times10^{16}\ {\rm GeV}.
$$
$$
{\rm Vol} 9 = 8\pi^5 R_0^9 = 1.6041\times10^{-148}\ {\rm GeV}^{-9}\quad(\text{alternate convention});\qquad M = \left(\bar M_{\rm Pl}^2/{\rm Vol} 9\right)^{1/11} = 6.010\times10^{16}\ {\rm GeV}.
$$
$$
M /\bar M_{\rm Pl} = 1/40.51,\qquad {\rm flip\ threshold}: 40.51^{11}\approx4.82\times10^{17}\ \text{vs.\ largest plausible convention swing} \approx(2\pi)^9\pi^3\approx4.7\times10^8.
$$
 Verdict, stated exactly as derived: \(M_*\ll M_{\rm Pl}\) is convention- proof (the \(1/11\) power buffers the ratio verdict against any plausible volume-normalization choice by ~9 orders of magnitude); the numerical value of \(M_*\) itself is convention- soft , varying by \(\sim\) factor 2 between the two internally-consistent volume pipelines quoted here ( \(6.010\times10^{16}\) GeV vs. \(7.467\times10^{16}\) GeV). The absolute floor scale in GeV is not derived — it is irreducible by Buckingham- \(\pi\) (a dimensionful number cannot be manufactured from dimensionless inputs alone); the quoted \(M_*\) values are ratios re-expressed against the put-in-by-hand anchor \(M_{\rm Pl}\) . This entire block is a derivable sub-question, answered — it is explicitly not a promotion of the R1 root , whose grade is fixed by §5–§6 alone and does not reference \(M_*\) , \(R_0\) , or any KK volume.

 8. Established-physics cross-checks (three independent currencies, cited as background, never as this program's result)

 Result 
 Statement 
 Currency 
 Status here 

 Margolus–Levitin (1998) 
 \(\tau\ge\pi\hbar/(2E)\) ; \(N_\perp\le2ET/(\pi\hbar)\) 
 action/time 
 Established QM theorem; confirms floor exists inside QM, presupposes Hilbert orthogonality — not usable as an R1 derivation input 

 Landauer (1961) 
 \(\Delta E\ge k_BT\ln2\) per bit erased 
 energy/information 
 Established, experimentally confirmed (Bérut et al. 2012); presupposes distinguishable logical states — same caveat 

 Bekenstein (1981) 
 \(S\le2\pi k_B RE/(\hbar c)\) 
 information/region 
 Established; \(\hbar\) appears explicitly in the bound's own constant, so it cannot explain where \(\hbar\) (or any floor) comes from 

 These three bounds are logged here purely as the state-of-the-art confirmation that a floor exists; none contributes a step to the R1 derivation chain in §5, and none is re-derived by this program. Their citation status is: established literature, never this program's output.

 9. Anti-claims and negative controls

 Bright-line non-claims (each explicitly denied as proven by this ledger): 

 NOT a derivation from a strictly weaker principle. Fork A is ruled out by the two decisive countermodels (Steps 5, 7, 10). Fork B (naming) is what survives.

 NOT zero posits. Posit count is exactly ONE (Step 8), confirmed by the Pontryagin audit (Step 12) that a relocation is not an elimination.

 NOT the value of \(\hbar\) , \(k_B\) , the Bekenstein constant, or \(\Delta_0\) . These are residues by construction (§4, Step 11); deriving a numerical magnitude from pure structure is outside what any reconstruction of this kind can deliver — on the same footing as "why does \(M_{\rm Pl}\) have its numerical value."

 NOT spacetime discreteness. No smallest length is claimed anywhere; only a floor on a Lorentz-scalar cost (Step 2). G3 screen (§3.2) passes explicitly on this point.

 NOT strict irreducibility. "No deeper principle anywhere could ever sit below this floor" is a universal negative over an open-ended domain, unprovable for any root in any field. Program-stated odds of ever establishing it: ~0%. The honest ceiling is co-fundamentality (the floor sits at-or-below QM/thermodynamics/gravity in the implication order) — a bounded, testable claim, and the actual ceiling this root has earned.

 Negative controls (decisive countermodels, kept live, never dissolved): 

 Theorem A / delta-test (Step 5): finite extent + finite \(\tau\) + finite energy-time on a classical pointer in \([0,1]\) \(\Rightarrow\) \(d_{\rm op}=1\) for every distinct pair \(\Rightarrow\) uncountable discrete space \(\Rightarrow\) not compact. This is a permanent falsifier of "finite resources alone give compactness" — it stays live and is never retired.

 FTC delta-test (Step 7): \(\mathbb{1}[r=x]\) tests on \([0,1]\) \(\Rightarrow\) FTC fails for every \(\eta<1\) . Permanent falsifier of "finite resources alone give finite test-compression."

 Basin-shallowing (Step 10): \(d_n=B\cdot2^{-n-1}\) , \(\sum d_n=B/2<B\) , \(\inf d_n=0\) . Permanent falsifier of "finite resources alone give a uniform floor," distinct from and sharper than the two above.

 Λ-magnitude relocation (§4): granularity machinery applied to the cosmological constant overshoots by \(10^{44}\) – \(10^{113.7}\) depending on which comparison is drawn; this is a valid CLOSED-NEGATIVE on the separate claim "granularity alone explains the smallness of \(\Lambda\) " — logged here as a negative control that must never be quietly dissolved into a positive claim.

 Corrected overclaim, logged for the record. An earlier draft of this material stated the uniform \(\Delta_0\) as "RESOLVED / verified." That was an overclaim. What is actually verified is the conditional "uniform cell law \(\Rightarrow N\le\lfloor B/\Delta_0\rfloor\) " (Step 9, a sufficiency lemma) — not a derivation of the cell law's own hypothesis. The correct and current statement, carried throughout this ledger, is: uniform \(\Delta_0\) is POSITED (Step 8), not resolved. This correction is binding and must not be re-introduced as a promotion.

 Referee-caught hidden hole, logged for the record. The completeness (Cauchy-closure) hypothesis inside Theorem B (Step 6) is a genuine extra posited assumption, not a proven consequence of FTC. It is carried on the residue ledger (§4) explicitly and must never be folded silently into "Theorem B closes compactness."

 10. Open holes (cross-referenced, none of them gate this root's fixed grade)

 Hole 
 Content 
 Status 
 What would close it 

 Hole 1 (KEYSTONE) 
 Derive FTC from strictly weaker primitives (no Hilbert orthogonality, no trace distance, no Bekenstein, no QFT nuclearity as inputs) 
 OPEN, ~15–20% odds on any given attempt 
 A pre-quantum reconstruction theorem producing Margolus–Levitin, Landauer, and Bekenstein as outputs ; a rigorous no-go is an equally valid close 

 Hole 2 
 Prove T3/FTC from bounded-causal-resource axioms alone 
 OPEN 
 A finite \(3\eta\) -net from resource bounds alone, with \(B\) kept as action/energy \(\cdot\) time (not bits) 

 Hole 3 
 Co-fundamentality certificate (floor derivable from something strictly weaker than QM) 
 OPEN, same object as Hole 1 
 Show cost floor \(\Rightarrow\) QM is not reversible without smuggling QM back in; strict mutual derivability is also a valid (different) close 

 Hole 4 
 Derive \(\Delta_0\) from a deeper resource law, or ledger it explicitly 
 OPEN; documentary close available 
 Either a deeper substrate law for \(\Delta_0\) , or (the current standing) explicit acknowledgment that \(\Delta_0\) replaced \(\varepsilon\) as a residue, not an elimination 

 Hole 5 (cross-gate, Λ) 
 Canonical regularized \(\rho_{\rm vac}=\tfrac12\sum_n\lambda_n\) over the finite frozen spectrum 
 OPEN / computation debt 
 Not this gate's root; tracked here only because it consumes granularity machinery 

 Hole 6 (cross-gate, Gap-02) 
 Uniform-in-truncation spectral gap \(\lambda_1>0\) landing in \([0.1,0.3]\) GeV 
 OPEN 
 Not this gate's root; the G2 screen (§3.2) is marked RECOGNIZED-OPEN precisely to flag this 

 Binding statement: none of Holes 1–6 gate the fixed grade of this ledger. Closing Holes 1/3 would be the single largest possible future move — it would upgrade granularity from REDUCED-TO-AXIOM toward DERIVED — but that upgrade is not made here, is not anticipated here, and this document's terminal is fixed regardless of how those holes eventually resolve.

 11. The endpoint line

 Terminal, stated once, plainly, and fixed: 

 \[
\textbf{Granularity root (R1)}:\quad \text{REDUCED-TO-AXIOM / ANCHORED +1}.
\]

 One named, value-free posit (Uniform Operational Cell Law, \(\Delta_0>0\) , Step 8) plus one atomic measured anchor ( \(\hbar\) , Step 11). The no-derivation is earned — proved by two decisive banked-loss countermodels (Steps 5/7 and Step 10), not asserted. Every scaffolding step around the posit (Steps 1–4, 6, 9, 12) is either an unconditional theorem or a valid conditional proof with every constant tracked. PROMOTIONS: 0. Dissolved \(\neq\) solved. Selection \(\neq\) derivation. ANCHORED \(\neq\) DERIVED. AXIOM-CLOSED \(\neq\) atomic. This gate's own grade does not move regardless of the sibling SHAPE root's separate (and separately OPEN) roll-up in the combined Deep-Roots gate — this ledger covers the granularity sub-root only, and its terminal is not coupled to that sibling's status.