CEF exact-check bundle, 20 November 2026. Python 3.10+ standard library only.
No network, provider keys, inference or third-party packages.

Run from the extracted directory:
  python3 check_cef_rank_degree_five.py --max-n 8 --output fresh-degree-five.json
  python3 -c "from check_cef_local_examples import check; import json; print(json.dumps(check(), indent=2))"

The saved JSON files are the coordinator's recorded runs. These commands rerun
the checks. The degree-five checker gives modular rank lower bounds, matched by
the written characteristic-zero commutator upper bound. A uniform degree bound
turns the nonzero seventh difference into a finite disproof of polynomiality.
It does not extrapolate a universal rank formula from sampled values.

The older local-check script's note that it did not reproduce the degree-five
table describes that script alone. The separate degree-five checker now does.
Topology, FI functoriality and universal proof arguments are in the note, not
executed by these scripts. No formal proof certificate or peer review claimed.
