BSD Certificate Globalizer

Establishes a research control quantity that will not swallow a single uncertified curve just because "most curves are certified" — it is faithful to the certification status, not directly faithful to the BSD truth value. Using conductor and isogeny label to build a computable enumeration ℰ={E₁,E₂,…}, fix a target certificate level ℓ*∈{C6,...,C10}, and after the k-th round, let H_k(ℓ*) be the set of curves that have not yet reached ℓ*. Define the Faithful Unresolved Mass 𝔅_k(s;ℓ*)=Σ_{i∈H_k} i^(-s) (s>1): any fixed uncertified class leaves a positive mass. For an infinite enumeration, if the certificate system is monotonic, 𝔅_k→0 indicates that every fixed class eventually leaves the unresolved frontier. But even if 𝔅_k→0, it only means the adopted certificate system has covered the enumeration domain item by item. To truly deduce BSD, five additional conditions are needed: every certificate is sound, the target claim exactly equals the BSD component, the enumeration covers all E/ℚ, certificate generation does not use BSD as an oracle, and a finite stage is truly reached for all curves. Three independent dimensions can be defined separately: weak BSD backlog, Sha finiteness backlog, and strong formula backlog, to avoid a single total score masking situations like "rank is proven, but Sha is not closed."