Heilbronn triangle problem (Erdős #507): exact-certified unit-disk configurations for n = 5..48 (DISK_TABLE v1.2)

Forty-four exact-certified best-known configurations for n points in the unit-radius disk for the finite-n Heilbronn triangle problem (Erdős #507, erdosproblems.com/507), contiguous for n = 5..48. Every value is an exact rational recomputed from the bundled configuration (containment x²+y² ≤ 1 verified exactly per point; minimum over all C(n,3) triangle areas in Fraction arithmetic) — no float-only claims. These are constructions (lower bounds on α(n)), not optima. To our knowledge (five independent literature digs, latest re-verified 2026-08-01) this is the first public exact-certified table for the disk variant; rows not matching a closed-form baseline are marked "⚪ candidate best-known for disk", rows n = 27/28 are honestly labeled below the transported square record, and the certified column's non-monotone pairs (35/36, 41/42, 45/46) are documented as search artifacts. The bundle is self-contained: table, regime plot, 109 configuration files, and a standard-library-only verifier (~250 lines). Download and unpack DISK_TABLE_v1.2.tar.gz, then one command re-checks everything in seconds (python certify_all.py → 109/109 PASS). Developed with AI assistance under a machine-verification gate; see README.md inside the bundle for the production chain and honest labels. v1.2 extends v1.1 (n = 5..40) to n = 5..48; the Friedman square baseline was re-fetched at freeze time (byte-identical, anchor-verified).