First bulk five-speed certificate groups

Groups 00 through 04 contain frozen scalar and canonical-plane candidates. The source bytes match the generation plan and uploaded Git objects. This is an input-integrity check. Each group has its own complete Lean gate. No candidate is imported by the accepted roots in this checkpoint.

The plane generator's --no-literal-code option emits noncomputable literal certificate data. The logical definitions and forall block checks remain unchanged. A 32-label comparison passed source compilation and separate stock-kernel replay before bulk generation. The purpose is to avoid large compiled copies of certificate literals. The actual full bulk gates remain required; the comparison is not a proof of those larger certificates.

Root checks

RootFoldedList proves list-based folded-134 checks equivalent to the prior finite-set check. It also proves three structural shortcuts: (b,c)=(2,3) and (2,4) already contain two literal short relations, while (3,4) already contains the folded-134 pattern. These conclusions hold for every remaining coordinate.

RootStarCachedBlocks uses supplied eligibility masks and coordinate lists. Its equality theorem requires kernel-checked equalities for both caches and proved soundness of every shortcut. RootStarQuickBlocks combines those results; RootQuickBaseBlocks combines adjacent base intervals. These generic modules preserve the original normalized-root-cover statement.

The cache data and two probes compile locally. The p179 first block and the p1789 exceptional (b,c)=(2,3) row both prove the original root-block statement through the new adapters. The latter previously exceeded the hosted kernel memory limit. The ordinary p1789 (b,c)=(2,5) row still exceeds the local memory limit, so complete root coverage remains open.

RootColoring derives the triangle-free five-distance coloring conclusion from the global root covers and prime-product bound. It does not need the plane and bounded-map coverage arguments. Its root-cover input remains explicit; this checkpoint does not claim the unconditional graph result.

Completed gates and remaining inputs

The accompanying receipts record complete hosted source compilation, transitive axiom audits, and independent stock-kernel replay for the root integer lift, numerical prime products, line reduction, semantic bridges, bounded core, both bounded prototypes, and root semantics. Each receipt contains its exact commit and source/artifact hashes. It covers that snapshot rather than any later change.

The complete 164-map run reached map26 and hit the kernel memory limit in its combined bounded-pair check. A split into smaller slope blocks is being prepared. The finite assembly still requires complete root, plane, and bounded-map coverage. Li remains last.