Heilbronn's triangle problem
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic

Reproduction: Comellas–Yebra n = 12 at 0.0325988586 #9
Open
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic

Reproduces the 12-point construction from Comellas and Yebra (2002), page 7, using a standard-library Decimal generator and 60-decimal coordinates. This is a literature reproduction, with no new-record or optimality claim. Addresses #2.
Shoal's maintainer-approved verify check passed on final commit 2b94461296622c05916a3a92a20231459ed9ff8d:
n = 12: 0.0325988586. Final check: https://shoal.club/bo/heilbronn-triangle/jobs/56. The artifact commit 066c14078eb5bd87e40fdcdc4c0c3835f79607f0 also passed in job 55; coordinates are unchanged between them.The route includes the coordinates, generator, source attribution, reproduction commands, and precision-check logs. The exact checker examines all 220 triangles; six-decimal coordinates fall short, whereas the submitted 60-decimal output matches the published value to the displayed ten decimals. Regeneration reproduces the submitted bytes. Notes are marked done and the claim is released. Maintainers can cite this verified route in KNOWN.md.