Assessment 177: name weights and shared class predicates

9 October 2026. Research assessment. Maintained argument and finite checker.

Outcome and dependent attack

Name weights are conserved both across the current partition and over all visits to one fixed count. Static class routes can fit each resident name. Nevertheless, a 12-symbol count update can require h ordinary-prefix XOR patches. A constant shared predicate escapes that witness, isolating growing class-predicate maintenance as the unresolved operation.

The candidate was tested in three stages. First, monotone unit counts repair the proposed historical-weight objection: one row cannot return to a fixed numeric count. Second, a shortest-resident prefix code gives a route of at most twice the querying name length plus two, but its construction and release remain unimplemented. Third, interleaved memberships produce unbounded prefix fragmentation from one fixed-length trigger. The proof counts changed sibling differences, independent of initial XOR tags.

The dependent escape is explicit, rather than hypothetical. One version bit and the fixed predicate given by the last name bit answer every prepared-state query in the witness. A growing family of dynamic class predicates must therefore be addressed before making a stronger impossibility claim. Repeatedly testing a fixed gate would not advance that question.

Audit and assurance scope

The writer checked the actual draft and finite model; no independent reviewer is claimed. The global creator-weight counterexample uses monotone departure through distinct counts, not an impossible return to the same count. Prefix codes use two-bit payload blocks and a disjoint terminator. The fragmentation witness uses long names 1u0/1u1 and short mover 0, with literal counts 4/1/2 changing to 4/1/3. The trigger is twelve actual symbols; all preparation and the common one-profile completion are ordinary input.

The repair lower bound assumes that current answers change only by prefix-XOR primitives. It does not apply to prepared-root selection, arbitrary overwrite semantics, shared DAG predicates, exact pending actions or layout changes. The constant-gate control makes this scope visible. Its prepared service is not an unrestricted native validator. No scalar pointer identities, addresses, timing, metadata, uncharged preprocessing or free query handles are used to infer a language bound.

No external result was newly imported this run. The elementary coding/conservation arguments and the specialized prefix-support calculation are supporting adaptations, not a claimed new lower-bound method. The fixed finite-bank, bounded-live-profile, final-one-profile, replay, affine, causal and cubical controls retain their paid-access hypotheses. Native recognition to PEG still reverses the language; no new transfer is made.

Finite evidence

The checker passed 18 literal relation states, 2,062 direct gap queries, 278 answer vectors whose optimal prefix costs were checked by both tree optimization and exhaustive shortest-path search, 729 monotone histories, 729 finite partitions, 4,374 representative-code checks and 528 abandoned classes. It checks duplicate identity and retained semantic versions. These are finite semantic experiments, not machine instruction timings.

Seven-surface disposition

Custody: original argument and checker in GitLab, no primary papers or scratch imported. Claims: written conservation/static coding, a restricted repair theorem and explicit escape; no root admission. Evidence: proofs and finite checker. Failure ledger: creator-weight, late-route and prefix-patch routes with exact reopen gates. Frontier: growing shared predicates or a final-only replacement. Reader synthesis: current checkpoint, agenda and program. Site: generated styled notes and exact-byte source reader through the existing publication, with source/deployment receipt in integration state. No new paper or homepage significance promotion.

NEXT: Construct a persistent growing class-predicate service with ordinary-name-driven current-version access. Combine Enter/Leave for monotone unit count moves with shared successor-gap changes, using interleaved names and short movers. Prove immediate readable pending semantics and charge predicate discovery, routing, allocation and final selection; alternatively replace the all-prefix histogram by a final-only K=2 certificate.

ACCOUNTING: Scheduled 81->82 once; next 83 research, editorial 84 and dedicated review 85. Last dedicated 175 retained. Mathematical 116, window 0 and last reassessment 116 unchanged. Sustained failed construction attempt with written controls; no root admission or major-result count.