Claims — Walls

Every claim on Walls and the pages under it, one line each: name, tier, verifier. 39 claims at this build. All sections.

Walls

The locality criterion rule — explore_size_transform.py
The hiding lemma rule — explore_size_transform.py, explore_size_crystallization.py, explore_walls_provenance.py
The exact comparator and its cost law rule — explore_rns_comparator.py
A live method pays the classified price rule — explore_comparator_ruler.py
The conjunctive split rule — explore_organizing_relations.py
Cyclic orientation is totally hidden rule — explore_coupling_order.py
Nothing plays unbounded induction rule — explore_organizing_relations.py
The provenance ladder rule — explore_walls_provenance.py
The deletion is resource-forced observation — explore_merge_dissolution.py, explore_dual_merge.py, explore_noncommutative_merge.py

The index transform rule — explore_index_transform.py
The Zech wall rule — explore_index_transform.py
The rigidity dichotomy rule — explore_index_transform.py
The third log rule — explore_super_log.py
The finite ladder rule — explore_super_log.py
The two-readings criterion criterion — explore_numeration_windows.py
The readability chart rule — explore_numeration_windows.py
The internet-checksum ring rule — explore_checksum_ring.py
The machine-word tower and the uint64 departure rule — explore_machine_word_tower.py, explore_uint64_tower.py, explore_fermat_reciprocal_tail.py

Exact binding property — explore_meaning_codeword.py
Snap-to-whole in three exact zones rule — explore_meaning_codeword.py
The superposition wall and its cure rule — explore_meaning_codeword.py
The similarity carrier rule — explore_similarity_carrier.py
The component criterion and the readable hull criterion — explore_overlap_carrier.py
The decoupling law and the coupling toll rule — explore_ring_ca.py
The snap-back automaton rule — explore_snapback_ca.py

The two-pole reading criterion rule — explore_dual_lipschitz.py, explore_dual_locality.py, explore_dual_redundant.py
The exchange of crown and blind spot property — explore_dual_pole.py, explore_dual_redundant.py, explore_order_wall_shape.py
The two-ends law rule — explore_dual_pole.py, explore_dual_locality.py, explore_dual_lipschitz.py
The exception-density law rule — explore_dual_measure.py
Benford is the dual Haar property — explore_dual_measure.py

The order wall's shape rule — explore_order_wall_shape.py, explore_sign_minimal.py, explore_sign_sparse.py, explore_sign_window.py, explore_sign_monoid.py, explore_monoid_correction.py, explore_monoid_quotient.py

One channel-sensitive floor, then uniform collapse rule — explore_division_ladder.py
The composition norm is the channel-computable size rule — explore_division_ladder.py
Nilpotents return, and the meadow splits by the decality rule — explore_division_ladder.py, explore_designed_ramification.py
Napier narrows to the norm rule — explore_division_ladder.py
The criterion saturates within channels and holds across them rule — explore_division_ladder.py
Composition outlives division by exactly two floors rule — explore_division_ladder.py
Designed ramification rule — explore_designed_ramification.py
The deleted budget rule — explore_deleted_budget.py, explore_rank_face.py, explore_regulator_face.py, explore_ramification_face.py