The Architecture of Identity-Eliminator-Conserved Paraconsistent HoTT

This is Paper 20 in the 20 Paper PHHT Series This paper gives the final certificate architecture for identity-eliminator-conserved bilateral paraconsistent homotopy type theory. It is the capstone of the twenty-paper sequence. The theory carries ordinary positive HoTT evidence together with a separate negative obstruction layer. At a retained identity position one may therefore have both positive identity evidence Γ ⊢⁺ p: IdA (a, b) and negative obstruction evidence Γ ⊢⁻ q: IdA (a, b). The pair (p, q) is an identity glut. Negative evidence is structured obstruction data, not the classical complement of positive evidence. The symbol J is reserved only for ordinary HoTT identity elimination, equivalently path induction. The central object is the protected certificate type. For a singleton identity glut (p, q), certification through dimension n is the retained null fibre of a dependent aggregate obstruction section over the tower of compatible lower fillers: Cert≤ₙ (p, q) ∑η≤ₙ ∈ Fill≤ₙ (p, q) Null≤ₙ (OAgg≤ₙ (p, q) (η≤ₙ) ;0p, q;η≤ₙ). The aggregate obstruction target records primary, filtered-shadow, secondary, polyhedral, and aggregate-compatibility residuals. Primary vanishing alone is not certification unless the stated non-interaction package identifies total aggregate nullity with the product of projected layerwise nullities. In the interacting case, the certificate is nullity in the total dependent aggregate target, including the compatibility coordinate. For a retained-store glut (p, R), the guarded identity-elimination gate is the store-compatible family certificate FamCert≤ₙ (p, R) ∑ (cq) {q∈R: ∏q∈R Cert≤ₙ (p, q) }CompatR≤ₙ ( (cq) q∈R). Equivalently, in the series-standard notation, FamCert≤ₙ (p, R) (∏ₐ∈ₑ Cert≤ₙ (p, q) ) × StoreCompat≤ₙ (p, R). The StoreCompat component is part of the gate. It records the retained-store interaction, lower-filler transport, indeterminacy transport, aggregate-interaction residuals, and truncation compatibility needed to assemble singleton certificates into a store-level certificate. Product decomposition into independent singleton certificates is available only when the relevant compatibility object is terminal or contractible. The guarded syntax has two positive transport heads. A non-glutty positive path uses the ordinary non-glutty identity eliminator IdElim⁺ₙg. A retained identity witness paired with negative obstruction evidence can be used for positive transport only through the certificate-guarded eliminator IdElim^+, cert≤ₙ (d;p, R, c), where c: FamCert≤ₙ (p, R). Thus an uncertified retained-store glut induces no positive identity transport. Gluts may exist; only certified gluts compute. The paper organizes the whole series through an edge-labeled architecture category Arch≤ₙ. Its objects are certification layers: finite detected data, retained-through-n certificates, tower certificates, aggregate certificates, family certificates, full retained certificates, spectral quotient-nullity presentations, semantic/classifying presentations, and protected completion/localization layers. Its generating edges are labeled preserving, reflecting, comparison-complete, or equivalence. Certification is transported according to the weakest edge label in a path: preserving paths give forward implication, reflecting paths give backward implication on compatible target data, comparison-complete paths give both directions with the required auxiliary data, and equivalence-edge paths give invariance. This edge discipline is central. Directed preserving comparisons are not equivalences. Finite detected outputs are not full certificates. Finite retained certification through a bound n becomes full certification only through a compatible finite-certificate thread together with the inverse-limit or homotopy-inverse-limit hypotheses imported from the finite-to-full gateway. In strict form, the family-thread object is ThreadˢtrFam (p, R) = limₘ FamCert≤ₘ (p, R), and in coherent form it is ThreadʰFam (p, R) = holimₘ FamCert≤ₘ (p, R). Full certification is a compatible thread through the finite certificate tower, not merely a separate certificate at every finite level. The dependent obstruction architecture is four-layered. A stage-k obstruction over lower fillers η_<k has the form oₖ (p, q;η_<k) = (ωₖ, Fₖ, Sₖ, Pₖ), where ωₖ is the primary obstruction class, Fₖ is the filtered-shadow refinement, Sₖ is the secondary primitive-compatibility datum, and Pₖ is the polyhedral higher-coherence residual. The stagewise aggregate target also contains a local aggregate-compatibility object, and the total aggregate target through dimension n contains global cross-stage compatibility. The obstruction section OAgg≤ₙ (p, q): ∏⏖≤䂸∈₅₈₋₋≤䂸 (₏, ₐ) AggOb≤ₙ (p, q;η≤ₙ) assembles the residuals of the four-layer tower after the chosen fillers have been applied. The capstone criterion identifies guarded identity-elimination admissibility for a retained-store glut (p, R) through dimension n with inhabitation of FamCert≤ₙ (p, R). Under the complete aggregate comparison package AggPkg≤ₙ, this is equivalent to a compatible family of aggregate null-filler packages in the retained aggregate presentation. Under store-empty positive syntax, the theory recovers ordinary HoTT. Under certified nonempty retained stores, the theory remains a bilateral paraconsistent extension whose positive identity transport is explicitly guarded. The paper also records the dependency index for the preceding nineteen papers. Papers I–VIII contribute reduced, cellular, filtered-shadow, secondary, polyhedral, algorithmic, and worked finite detected obstruction calculi. Papers IX–XIV contribute the bilateral syntax, type-former gates, semantic models, classifying models, and proof-theoretic normalization/no-bypass discipline. Papers XV–XVIII contribute the retained-family operation algebra, finite detected calculus, coefficient and indeterminacy quotients, spectral exact-couple machinery, and finite-to-full compatible-thread criterion. Paper XIX contributes small algebraic protected certificate completion and localization. Paper XX integrates these layers into one typed certificate architecture. The resulting synthesis is a paraconsistent HoTT framework in which ordinary identity elimination is conserved, contradiction-tolerant identity evidence is retained rather than erased, and positive computation through glutted identity data is possible exactly when the required protected certificate data have been supplied.