Complete divisor-prefix minima through 64

../

From the repository root run:

uv run --no-sync python wiki/theory/number_theory/L35_divisor_prefix_compression/evidence/main.py

The input specifies $2\le N\le64$ and a secondary divisor-sieve limit of $10000$. The exact table records the minima, witnesses and partition counts computed by Plasma AI. Every run recomputes the table using the compression formula; its completeness does not depend on the sieve limit. All arithmetic is integral and exact.

The checker validates input coverage, counts and uniqueness of partitions, all witnesses and minima, the independently counted partition domain, the divisor-sieve comparison, and the stated boundary and extremal conclusions. It uses the repository's evidence harness and standard Python library. Expected runtime is less than a minute. Any failed obligation gives a nonzero exit, also under optimized Python. There is no reduced quick mode, discovery search beyond the stated finite domain, or asymptotic inference.