Packed lookup and bounded certificate repair

The bounded-map generator now splits each nonprototype pair check into at most four slopes and 64 first-parameter values. Balanced composition joins the exact ranges and slope lists. All original finite data and public map statements are preserved. Maps 24 and 63 keep their source bytes.

Map 26 and the block-composition helper passed local source checks, a 14-theorem transitive axiom audit, and separate stock-kernel replays. The aggregate integer adapter also source-passed under its exact natural-input premise. All 164 maps still require the new full hosted gates, including the unchanged prototypes because the selector dependency changed. Eight groups cover each map once. The final aggregate remains a separate proof obligation.

The bit selector uses a packed proposal table for moduli at most 1789. Consumers still check the proposed index bound and actual mask bit before using it. The soundness theorems do not assume that the table is complete or correct. Larger moduli retain the previous binary-search proposal.

The packed scalar oracle has a different role: Lean checks all 895 blocks against the existing scalar tree and proves equality for every input after folding. Its generic and p1789 modules passed local source, axiom, and independent stock-kernel gates. The literal is emitted with nat_lit to avoid expensive numeral elaboration; the checked mathematical value is unchanged.

Both p1789 ordinary and middle rows now source-pass with the tree and packed oracles. Each probe concludes the original root-block statement. The ordinary row took 15.5 seconds of kernel reduction with the tree oracle and 7.52 seconds with the packed oracle in these local measurements. These are individual rows, not complete root-prime covers. Further reuse across D rows is being formalized to make the full enumeration practical.

The ordinary registry retires the old combined bounded-map task and its two prototype tasks in favor of the eight complete groups. It also retires the older resource-failing root-star diagnostics in favor of the cached root checks. Historical receipts and sources are retained. No candidate is added to accepted roots, and no complete classification is claimed here.